Lower bounds on the size of deterministic parsers

DOI10.1016/0022-0000(83)90010-7zbMath0536.68071OpenAlexW2022515241MaRDI QIDQ792100

Esko Ukkonen

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90010-7

zbMATH Keywords

deterministic parsingLL(k) grammarsLR(k) grammarsparser size bounds

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (4)

Syntax checking either way ⋮ Syntax checking either way ⋮ On parsing LL-languages ⋮ Upper bounds on the size of LR(k) parsers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Economy of description by parsers, DPDA's, and PDA's
• Optimization of LR(k) parsers
• On the Parsing of Deterministic Languages
• The size of LALR (1) parsers
• On the complexity of LR(k) testing
• A note on the succinctness of descriptions of deterministic languages
• Properties of deterministic top-down grammars
• On the translation of languages from left to right

This page was built for publication: Lower bounds on the size of deterministic parsers