Truly prefix-correct chain-free LR(1) parsers
- 1 December 1985
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (5) , 499-536
- https://doi.org/10.1007/bf00267043
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the correct elimination of chain productions from lr parsersInternational Journal of Computer Mathematics, 1984
- Inessential Error Entries and Their Use in LR Parser OptimizationACM Transactions on Programming Languages and Systems, 1982
- A parsing automata approach to LR theoryTheoretical Computer Science, 1981
- Eliminating unit reductions from LR(k) parsers using minimum contextsActa Informatica, 1981
- A unified approach to the generation and the acception of formal languagesActa Informatica, 1978
- A practical general method for constructing LR(k) parsersActa Informatica, 1977
- Eliminating unit productions from LR parsersActa Informatica, 1977
- Elimination of single productions from LR parsers in conjunction with the use of default reductionsPublished by Association for Computing Machinery (ACM) ,1977
- EfficientLR (1) parsersActa Informatica, 1973