Even faster generalized LR parsing
- Cite this article as:
- Aycock, J., Horspool, N., Janoušek, J. et al. Acta Informatica (2001) 37: 633. doi:10.1007/PL00013319
- 64 Views
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.