Revision as of 05:05, 4 June 2008 edit Paul Foxworthy (talk \| contribs) Extended confirmed users 2,731 edits m →Relationship to other parsers: Fixed link to shift-reduce ← Previous edit		Revision as of 09:27, 28 November 2008 edit undo 80.254.190.93 (talk) →Example algorithm to parse infix notation Next edit →
Line 19: Operator precedence grammar is the only grammar which can construct the parse tree even though the given grammar is ambiguous. == Example algorithm to parse infix notation (aka. precedence climbing) == An [[EBNF]] grammar that parses infix notation will usually look like this:

Operator-precedence parser: Difference between revisions