English

LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and Generic Tokens

Programming Languages 2015-03-17 v2 Formal Languages and Automata Theory

Abstract

The LR(1) Parser Generation System generates full LR(1) parsers that are comparable in speed and size to those generated by LALR(1) parser generators, such as yacc [5]. LR contains a number of novel feature. This paper discusses three of them in detail: an LR(1) grammar specified automatic error recovery algorithm, oracles, and generic tokens.

Cite

@article{arxiv.1010.1234,
  title  = {LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and Generic Tokens},
  author = {Arthur Sorkin and Peter Donovan},
  journal= {arXiv preprint arXiv:1010.1234},
  year   = {2015}
}

Comments

6 pages

R2 v1 2026-06-21T16:24:47.039Z