Efficient full LR(I) parser generation
- 1 December 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (12) , 143-150
- https://doi.org/10.1145/57669.57684
Abstract
This paper proposes that full LR(1) parser generators are easier to use than the LALR(1) parser generators commonly in use, and that minimal-state full LR(1) tables are not much larger than LALR(1) tables. A method is presented for the automatic construction of minimal-state full LR(1) parser tables. The method is fast and accurate because it starts with the LR(0) table and resolves lookahead ambiguities as necessary by tracing the LR(0) table and splitting the minimum number of states, and because there is no need for generalized set manipulation.Keywords
This publication has 7 references indexed in Scilit:
- Truly prefix-correct chain-free LR(1) parsersActa Informatica, 1985
- Building collections of LR(K) items with partial expansion of lookahead stringsACM SIGPLAN Notices, 1982
- Inessential Error Entries and Their Use in LR Parser OptimizationACM Transactions on Programming Languages and Systems, 1982
- Full LR(1) parser generationACM SIGPLAN Notices, 1981
- Methods for Computing LALR( k ) LookaheadACM Transactions on Programming Languages and Systems, 1981
- A practical general method for constructing LR(k) parsersActa Informatica, 1977
- On the translation of languages from left to rightInformation and Control, 1965