Paper Info
Title
Extending lookahead for LR parsers
Abstract
A practical method is presented for extending the lookahead of LR parsers, by the addition of “reduce-arcs.” Applied to an LR(0) parser, this gives a machine which is close in size to the corresponding LALR(1) machine, but is capable of making use of unbounded lookahead. The class of grammars parsable by this method is a subset of the LR-regular grammars which is shown to be properly included in the LALR(k) grammars, if limited to k symbols of lookahead, but also includes non-LR grammars if no such limit is imposed. Application is foreseen to error recovery in LALR(1) parsers, as well as the handling of occasional non-LALR(1) situations in normal parsing.
Year
DOI
Venue
1981
10.1016/0022-0000(81)90030-1
Journal of Computer and System Sciences
Field
DocType
Volume
Rule-based machine translation,LR parser,L-attributed grammar,Programming language,Context-free grammar,Computer science,Algorithm,Parsing expression grammar,LALR parser,Parsing,Canonical LR parser
Journal
22
Issue
ISSN
Citations 
2
0022-0000
13
PageRank 
References 
Authors
1.33
6
1
Name
Order
Citations
PageRank
T. P. Baker11648171.36