Economy of description by parsers, DPDA's, and PDA's

DOI10.1016/0304-3975(77)90033-0zbMath0357.68086OpenAlexW1963502093MaRDI QIDQ1239011

Matthew M. Geller, Harry B. III Hunt, Thomas G. Szymanski, Jeffrey D. Ullman

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Some formal results about stratificational grammars and their relevance to linguistics ⋮ IN MEMORIAM CHANDRA KINTALA ⋮ Why it might pay to assume that languages are infinite ⋮ Syntax checking either way ⋮ On the complexity and decidability of some problems involving shuffle ⋮ On LLP(k) parsers ⋮ A pushdown automaton or a context-free grammar - which is more economical? ⋮ Syntax checking either way ⋮ On the size of parsers and \(\text{LR}(k)\)-grammars ⋮ Constructing a realtime deterministic pushdown automaton from a grammar ⋮ Lower bounds on the size of deterministic parsers

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

This page was built for publication: Economy of description by parsers, DPDA's, and PDA's