Economy of description by parsers, DPDA's, and PDA's
From MaRDI portal
Publication:1239011
DOI10.1016/0304-3975(77)90033-0zbMath0357.68086MaRDI QIDQ1239011
Jeffrey D. Ullman, Harry B. III Hunt, Thomas G. Szymanski, Matthew M. Geller
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/23031
68Q45: Formal languages and automata
Related Items
Lower bounds on the size of deterministic parsers, Constructing a realtime deterministic pushdown automaton from a grammar, On LLP(k) parsers, A pushdown automaton or a context-free grammar - which is more economical?, Why it might pay to assume that languages are infinite, On the size of parsers and \(\text{LR}(k)\)-grammars, IN MEMORIAM CHANDRA KINTALA, Some formal results about stratificational grammars and their relevance to linguistics
Cites Work
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- Strict deterministic grammars
- Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
- Practical syntactic error recovery
- Intercalation theorems for stack languages
- A regularity test for pushdown machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item