Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Efficient construction of LR(k) states and tables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursive ascent parsing: from Earley to Marcus
Theoretical Computer Science
LL and LR translators need k1 lookahead
ACM SIGPLAN Notices
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalized left corner parsing
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Context-Free Grammars: Covers, Normal Forms, and Parsing
Context-Free Grammars: Covers, Normal Forms, and Parsing
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
The Java Language Specification
The Java Language Specification
Applying software engineering techniques to parser design: the development of a C# parser
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
A Bounded Graph-Connect Construction for LR-regular Parsers
CC '01 Proceedings of the 10th International Conference on Compiler Construction
Some observations on LR-like parsing with delayed reduction
Information Processing Letters
The Usability of Ambiguity Detection Methods for Context-Free Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
An experimental ambiguity detection tool
Science of Computer Programming
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
The paper investigates an extension of LR parsing that allows the delay of parsing decisions until a sufficient amount of context has been processed. We provide two characterizations for the resulting class of grammars, one based on grammar transformations, the other on the direct construction of a parser. We also report on experiments with a grammar collection.