A general model for fixed look-ahead lr parsers
From MaRDI portal
Publication:3815546
DOI10.1080/00207168808803647zbMath0664.68084OpenAlexW2078799220MaRDI QIDQ3815546
Manuel E. Bermudez, Karl M. Schimpf
Publication date: 1988
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168808803647
Related Items
Cites Work
- Unnamed Item
- Practical arbitrary lookahead LR parsing
- A practical general method for constructing LR(k) parsers
- LR-regular grammars - an extension of LR(k) grammars
- A new analysis of LALR formalisms
- The Complexity of LALR (k) Testing
- Methods for Computing LALR( k ) Lookahead
- Efficient Computation of LALR(1) Look-Ahead Sets
- Simple LR(k) grammars
- On the translation of languages from left to right