LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and Generic Tokens
Arthur Sorkin, Peter Donovan
TL;DR
This paper presents an LR(1) parser generation system with novel features including automatic error recovery, oracles, and generic tokens, achieving comparable speed and size to existing LALR(1) parsers.
Contribution
It introduces three new features for LR(1) parsers—error recovery, oracles, and generic tokens—that enhance parser robustness and flexibility.
Findings
Achieves parser speed and size comparable to LALR(1) generators
Introduces automatic error recovery algorithm for LR(1) parsers
Develops techniques for using oracles and generic tokens in parsing
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Software Testing and Debugging Techniques · Logic, programming, and type systems