Lar(m, c, l) grammars
From MaRDI portal
Publication:4730800
DOI10.1080/00207168908803726zbMath0681.68095OpenAlexW2067141579MaRDI QIDQ4730800
Publication date: 1989
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168908803726
Cites Work
- Unnamed Item
- Unnamed Item
- A practical general method for constructing LR(k) parsers
- Efficient LR(1) parsers
- LR-regular grammars - an extension of LR(k) grammars
- A new analysis of LALR formalisms
- The Complexity of LALR (k) Testing
- A general model for fixed look-ahead lr parsers
- Methods for Computing LALR( k ) Lookahead
- Efficient Computation of LALR(1) Look-Ahead Sets
- A practical method for constructing LR ( k ) processors
- Simple LR(k) grammars
- On the translation of languages from left to right