Characteristic parsing: A framework for producing compact deterministic parsers. II
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3487014 (Why is no real title available?)
- scientific article; zbMATH DE number 3515012 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3416975 (Why is no real title available?)
- An efficient context-free parsing algorithm
- Characteristic parsing: A framework for producing compact deterministic parsers. I
- On LR(k) grammars and languages
- On the Parsing of Deterministic Languages
- On the translation of languages from left to right
- Optimization of LR(k) parsers
- Pascal. User manual and report
- Practical syntactic error recovery
- Simple LR(k) grammars
- Strict deterministic grammars
- The size of LALR (1) parsers
Cited in
(11)- A Yacc extension for LRR grammar parsing
- On LR(k) grammars and languages
- A parsing automata approach to LR theory
- A Scheme for LR(k) parsing with error recovery
- SR(s,k) parsers: A class of shift-reduce bounded-context parsers
- On LLP(k) parsers
- On the relationship between the LL(k) and LR(k) grammars
- Characteristic parsing: A framework for producing compact deterministic parsers. I
- Simple chain grammars and languages
- Economy of description by parsers, DPDA's, and PDA's
- Two iteration theorems for the LL(k) languages
This page was built for publication: Characteristic parsing: A framework for producing compact deterministic parsers. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240565)
