A Yacc extension for LRR grammar parsing
Theoretical Computer Science
A programmer-friendly LL(1) parser generator
Software—Practice & Experience
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
Incremental analysis of real programming languages
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
The Java Language Specification
The Java Language Specification
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
A Basis for Looping Extensions to Discriminating-Reverse Parsing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generalised Recursive Descent parsing and Fellow-Determinism
CC '98 Proceedings of the 7th International Conference on Compiler Construction
CC '99 Proceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
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
On LR parsing with selective delays
CC'13 Proceedings of the 22nd international conference on Compiler Construction
| Hi-index | 0.00 |
Parser generation tools currently used for computer language analysis rely on user wisdom in order to resolve grammar conflicts. Here practical LR(0)-based parser generation is introduced, with automatic conflict resolution by potentially-unbounded lookahead exploration. The underlying LR(0)-automaton item dependence graph is used for lookahead DFA construction. A bounded graph-connect technique overcomes the difficulties of previous approaches with empty rules, and compact coding allows to precisely resume right-hand contexts. Resulting parsers are deterministic and linear, and accept a large class of LR-regular grammars including LALR(k). Their construction is formally introduced, shown to be decidable, and illustrated by a detailed example.