Skip to content

State greediness of GraphQL #564

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions spec/Appendix A -- Notation Conventions.md
Original file line number Diff line number Diff line change
Expand Up @@ -43,6 +43,20 @@ ListOfLetterA :
- `a`
- ListOfLetterA `a`

The GraphQL grammar is greedy; this means that given a choice between matching an optional token or a subsequent rule, the optional token prevails. For example, given the following grammar:

Example :
- Letters
- Letters Example

Letters :
- `a` LetterB?
- LetterB

LetterB :: `b`

The sequence of tokens `ab` are matched by a single {Letters} production, rather than two productions matching `a` and `b`, respectively.


## Lexical and Syntactical Grammar

Expand Down