A Yacc extension for LRR grammar parsing
Theoretical Computer Science
Parsing techniques: a practical guide
Parsing techniques: a practical guide
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Generating LR(1) Parsers of Small Size
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
The precision of right-hand context covering for conflict resolution is improved over previous NDR parsers, resulting in acceptation of wider subsets of LR-regular and LR-nonregular grammars, including all LALR(k) grammars for a given k. Parser generation combines a new form of DR items and subgraph connections of bounded length, without the need to implement subgraph copies. The NDR parser, whose algorithm remains essentially unchanged, is presented as an extended two-stack pushdown automaton. The technique is illustrated with a detailed example.