An LR parsing technique for extended context-free grammars* 1 (original) (raw)
Related papers
Generalized LR parsing for extensions of context-free grammars
Current Issues in Linguistic Theory, 2000
Efficient parsing algorithms for general context-free parsers
Information Sciences, 1975
A new parsing method for non-LR(1) grammars
Software: Practice and Experience, 1992
Construction of efficient generalized LR parsers
Automata Implementation, 1998
A New Approach to the Construction of Generalized LR Parsing Algorithms
Method and Means of Development of Context-Free Grammars for Natural Language Parsers
Abstract LDTA’04 Preliminary Version Parameterized LR Parsing
2008
Electronic Notes in Theoretical Computer Science
Generation of LR parsers by partial evaluation
ACM Transactions on Programming Languages and Systems, 2000
A practical arbitrary look-ahead LR parsing technique
Sigplan Notices, 1986
The Use of Predicates In LL(k) And LR(k) Parser Generators (Technical Summary)
Incremental generation of LR parsers
Computer Languages, 1990
A programmer-friendly LL(1) parser generator
Software: Practice and Experience, 1988
Relational parsing: a clean, fast parsing strategy for all context-free languages
ArXiv, 2019
LL (*): The foundation of the ANTLR parser generator
2011
A Constraint-Satisfaction Parser for Context-Free Grammars
2011
Construction Methods of LR Parsers
1981
ANTLR: A predicated-LL(k) parser generator
Software: Practice and Experience, 1995
Theoretical Computer Science, 1991
2013
ANTLR: A Predicated-LL(k) Parser
1997
The ModelCC Model-Based Parser Generator
Parsing techniques for lexicalized context-free grammars
2000
Computer Languages, Systems & Structures, 2010
Left-Corner Parsing Algorithm for Unification Grammars
1999
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language
2003
Practical Arbitrary Lookahead LR Parsing
Journal of Computer and System Sciences, 1990
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
Parsing Revisited: a Transformation-Based Approach to Parser Generation.
3
DPL – a computational method for describing grammars and modelling parsers
1985
A generic parser for strings and trees
Computer Science and Information Systems, 2012
Context-Free Grammar of a New Programming Language for Teaching and Learning
Equivalent Transformations and Regularization in Context-Free Grammars
Cybernetics and Information Technologies, 2015