Revision as of 23:47, 4 December 2011 edit Ruud Koot (talk \| contribs) 31,416 edits m In computer science, ... ← Previous edit		Revision as of 04:40, 9 May 2012 edit undo DBSand (talk \| contribs) 411 edits remove link to specific subheading in LR article Next edit →
Line 31: ;</pre> This grammar is [[LR ~~parsing#A note about LR(0) versus SLR and LALR~~ parsing\|LR(0)]] in that it is left-recursive (in the '''expr''' non-terminal) but does not require any lookahead. Recursive ascent is also capable of handling grammars which are LALR(1) in much the same way that table-driven parsers handle such cases (by pre-computing conflict resolutions based on possible lookahead). The following is a [[Scala (programming language)\|Scala]] implementation of a recursive ascent parser based on the above grammar:

Recursive ascent parser: Difference between revisions