Truly prefix-correct chain-free LR(1) parsers
Acta Informatica
Methods for Computing LALR(k) Lookahead
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inessential Error Entries and Their Use in LR Parser Optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM SIGPLAN Notices
Building collections of LR(K) items with partial expansion of lookahead strings
ACM SIGPLAN Notices
Generation and recognition of formal languages by modifiable grammars
ACM SIGPLAN Notices
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution
Proceedings of the 2008 ACM symposium on Applied computing
Science of Computer Programming
Full LR(1) parser generator Hyacc and study on the performance of LR(1) algorithms
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
| Hi-index | 0.00 |
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.