Some observations on LR-like parsing with delayed reduction

We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled deterministically by this method. Surprisingly, and counter-intuitively from the viewpoint of LR(k), increase of delay may lead to decrease of determinism. We also present a variant that uses both delay and lookahead. Key words: Formal languages, grammars, parsing, LR(k)

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Eberhard Bertsch, Mark-Jan Nederhof
• Keywords: Bottom-up Parsing Technique, Grammars, IPL 2007, Parsing