Extending lookahead for LR parsers (original) (raw)

Practical Arbitrary Lookahead LR Parsing

Manuel Bermudez

Journal of Computer and System Sciences, 1990

View PDFchevron_right

A unifying model for lookahead LR parsing

Manuel E. Bermudez

Computer Languages, 1991

View PDFchevron_right

A practical arbitrary look-ahead LR parsing technique

Manuel Bermudez, Karl Schimpf

Sigplan Notices, 1986

View PDFchevron_right

Construction Methods of LR Parsers

Karl Schimpf

1981

View PDFchevron_right

Generation of LR parsers by partial evaluation

Peter Thiemann

ACM Transactions on Programming Languages and Systems, 2000

View PDFchevron_right

An alternative approach to the improvement of LR(k) parsers

Roland Backhouse

Acta Informatica, 1976

View PDFchevron_right

Abstract LDTA’04 Preliminary Version Parameterized LR Parsing

Matthias Neubauer

2008

View PDFchevron_right

Parameterized LR Parsing

Matthias Neubauer

Electronic Notes in Theoretical Computer Science

View PDFchevron_right

Construction of efficient generalized LR parsers

Miguel Angel Alonso Pardo

Automata Implementation, 1998

View PDFchevron_right

Symbolic Lookaheads for Bottom-up Parsing

Paola Quaglia

2016

View PDFchevron_right

A Drop-in Replacement for LR(1) Table-Driven Parsing

Michael J Oudshoorn

Advances in Computing and Engineering, 2021

View PDFchevron_right

Tomita-Style Generalised LR Parsers

Shamsa Hussain

Royal Holloway University of London, 2000

View PDFchevron_right

An LR parsing technique for extended context-free grammars* 1

Augusto Celentano

Computer Languages, 1981

View PDFchevron_right

Incremental generation of LR parsers

Nigel Horspool

Computer Languages, 1990

View PDFchevron_right

The Use of Predicates In LL(k) And LR(k) Parser Generators (Technical Summary)

Russell Quong

View PDFchevron_right

A new parsing method for non-LR(1) grammars

Vincent Heuring

Software: Practice and Experience, 1992

View PDFchevron_right

SL Parses The LR Languages

David Barnard

Computer Languages, Systems & Structures - CL, 1988

View PDFchevron_right

Building collections of LR(K) items with partial expansion of lookahead strings

Massimo Ancona

ACM SIGPLAN Notices, 1982

View PDFchevron_right

Semantic routines and LR(k) parsers

Paul Purdom

Acta Informatica, 1980

View PDFchevron_right

On directly constructing LR(k) parsers without chain reductions

Wilf Lalonde

Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76, 1976

View PDFchevron_right

Generalized LR parsing for extensions of context-free grammars

David Cabrero Souto

Current Issues in Linguistic Theory, 2000

View PDFchevron_right

An LALR Parser Generator Supporting Conflict Resolution

Roberto Da Silva Bigonha

Journal of Universal Computer Science, 2008

View PDFchevron_right

Optimization of LR(k) parsers

Alfred Aho

Journal of Computer and System Sciences, 1972

View PDFchevron_right

A New Approach to the Construction of Generalized LR Parsing Algorithms

Miguel Angel Alonso Pardo

View PDFchevron_right

A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

Joop Leo

Theoretical Computer Science, 1991

View PDFchevron_right

LL and LR translators need k >1 lookahead

Russell Quong

ACM SIGPLAN Notices, 1996

View PDFchevron_right

Incremental LR parsers

Augusto Celentano

Acta Informatica, 1978

View PDFchevron_right

LL (*): The foundation of the ANTLR parser generator

Kathleen Fisher

2011

View PDFchevron_right

A programmer-friendly LL(1) parser generator

Dick Grune

Software: Practice and Experience, 1988

View PDFchevron_right

Repairing syntax errors in LR parsers

jose Antonio fregozo Perez

ACM Transactions on Programming Languages and Systems, 2002

View PDFchevron_right

DR parsers: a generalization of LR parsers

Gennaro COSTAGLIOLA

Proceedings of the 1990 IEEE Workshop on Visual Languages

View PDFchevron_right