Upper bounds on the size of LR(k) parsers

DOI10.1016/0020-0190(85)90072-9zbMath0573.68048OpenAlexW1995191248MaRDI QIDQ1062769

Esko Ukkonen

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90072-9

zbMATH Keywords

context-free grammarsLR parserlinear grammarsdouble exponential upper boundrecursive grammarssize bounds

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Lower bounds on the size of deterministic parsers
• On the translation of languages from left to right
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds on the size of LR(k) parsers