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

@inproceedings{Parr2011LLTF,
  title={LL(*): the foundation of the ANTLR parser generator},
  author={Terence Parr and Kathleen Fisher},
  booktitle={PLDI},
  year={2011}
}
Despite the power of Parser Expression Grammars (PEGs) and GLR, parsing is not a solved problem. Adding nondeterminism (parser speculation) to traditional LL and LR parsers can lead to unexpected parse-time behavior and introduces practical issues with error handling, single-step debugging, and side-effecting embedded grammar actions. This paper introduces the LL(*) parsing strategy and an associated grammar analysis algorithm that constructs LL(*) parsing decisions from ANTLR grammars. At… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 139 CITATIONS

A Reflexive and Automated Approach to Syntactic Pattern Matching in Code Transformations

  • 2018 IEEE International Conference on Software Maintenance and Evolution (ICSME)
  • 2018
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Systematic parsing of X.509: Eradicating security issues with a parse tree

  • Journal of Computer Security
  • 2018
VIEW 13 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Finding counterexamples from parsing conflicts

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the incremental growth and shrinkage of LR goto-graphs

  • Acta Informatica
  • 2014
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Automating Abstract Syntax Tree Construction for Context Free Grammars

  • 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • 2012
VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2011
2019

CITATION STATISTICS

  • 20 Highly Influenced Citations

  • Averaged 15 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Packrat Parsing: Simple, Powerful, Lazy, Linear Time

  • ICFP 2006
  • 2002
VIEW 19 EXCERPTS
HIGHLY INFLUENTIAL

Practical Experiments with Regular Approximation of Context-Free Languages

  • Computational Linguistics
  • 1999
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Practical Arbitrary Lookahead LR Parsing

  • J. Comput. Syst. Sci.
  • 1990
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

On LL-Regular Grammars

  • J. Comput. Syst. Sci.
  • 1979
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

On the Parsing of LL-Regular Grammars

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A Practical Method for Constructing Efficient LALR(K) Parsers with Automatic Error Recovery

P. Charles
  • PhD thesis,
  • 1991
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL