Some observations on LR-like parsing with delayed reduction

Authors:
E. Bertsch;M. -J. Nederhof
Affiliations:
Ruhr University, Faculty of Mathematics, Universitätsstraße 150, D-44780 Bochum, Germany;School of Computer Science, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SX, Scotland, UK
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Parsing theory volume 2: LR(K) and LL(K) parsing

Parsing theory volume 2: LR(K) and LL(K) parsing
Recursive ascent parsing: from Earley to Marcus

Theoretical Computer Science
Noncanonical SLR(1) Grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory of Syntactic Recognition for Natural Languages

Theory of Syntactic Recognition for Natural Languages
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
On formalizations of Marcus' parser

COLING '86 Proceedings of the 11th coference on Computational linguistics
Right nulled GLR parsers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Noncanonical LALR(1) parsing

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled deterministically by this method. Surprisingly, and counter-intuitively from the viewpoint of LR(k), increase of delay may lead to decrease of determinism. We also present a variant that uses both delay and lookahead.