Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
Automatic error recovery for LR parsers
Communications of the ACM
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Error recovery for Simple LR(k) parsers
ACM '76 Proceedings of the 1976 annual conference
Generalized bottom-up parsing.
Generalized bottom-up parsing.
On parsing context free languages in parallel environments.
On parsing context free languages in parallel environments.
Scannerless NSLR(1) parsing of programming languages
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Packrat parsing:: simple, powerful, lazy, linear time, functional pearl
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded-connect noncanonical discriminating-reverse parsers
Theoretical Computer Science - Implementation and application automata
Some observations on LR-like parsing with delayed reduction
Information Processing Letters
An experimental ambiguity detection tool
Science of Computer Programming
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 |
Two noncanonical extensions of the simple LR(1) (SLR(1)) method are presented, which reduce not only handles but also other phrases of sentential forms. A class of context-free grammars called leftmost SLR(1) (LSLR(1)) is defined by using lookahead symbols which appear in leftmost derivations. This class includes the SLR(1), reflected SMSP, and total precedence grammars as proper subclasses. The class of LSLR(1) languages properly includes the deterministic context-free languages, their reflections, and total precedence languages. By requiring that phrases which have been scanned be reduced as early as possible, a larger class of context-free grammars called noncanonical SLR(1) (NSLR(1)) is defined. The NSLR(1) languages can be recognized deterministically in linear time using a two-stack pushdown automaton. An NSLR(1) parser generator has been implemented. Empirical results show that efficient NSLR(1) parsers can be constructed for some non-LR grammars which generate nondeterministic languages. Applications of the NSLR(1) method to improve the parsing and translation of programming languages are discussed.