Abstract.
We prove a property of generalized LR (GLR) parsing – if the grammar is without right and hidden left recursions, then the number of consecutive reductions between the shifts of two adjacent symbols cannot be greater than a constant. Further, we show that this property can be used for constructing an optimized version of our GLR parser. Compared with a standard GLR parser, our optimized parser reads one symbol on every transition and performs significantly fewer stack operations. Our timings show that, especially for highly ambiguous grammars, our parser is significantly faster than a standard GLR parser.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 9 May 2000 / 5 March 2001
Rights and permissions
About this article
Cite this article
Aycock, J., Horspool, N., Janoušek, J. et al. Even faster generalized LR parsing. Acta Informatica 37, 633–651 (2001). https://doi.org/10.1007/PL00013319
Issue Date:
DOI: https://doi.org/10.1007/PL00013319