A Yacc extension for LRR grammar parsing
Theoretical Computer Science
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Journal of the ACM (JACM)
Generalized L.R. Parsing
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Generating LR(1) Parsers of Small Size
CC '92 Proceedings of the 4th International Conference on Compiler Construction
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Practical Nondeterministic DR(k) Parsing on Graph-Structured Stack
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Bounded Graph-Connect Construction for LR-regular Parsers
CC '01 Proceedings of the 10th International Conference on Compiler Construction
| Hi-index | 0.00 |
We present a noncanonical extension to the Discriminating Reverse parsing method, which accepts non-LR grammars. In cases of parsing conflict, actions are deferred and a mark is virtually pushed onto the parsing stack. Then, locally-canonical DR parsing resumes until sufficient right context is read to resolve the initial conflict. Marks code coverings of the right contexts that are compatible with the actions in conflict. A suboptimal solution for such a coding is proposed, which is computed from the DR automaton itself. The stack vocabulary is enlarged with the mark set, but no new state is added to the basic DR automaton. Moreover, conflict resolution basically uses the DR parser. The method determines at construction time whether all the conflicts can be resolved, and only produces deterministic parsers.