On the size of unambiguous context-free grammars

DOI10.1016/0304-3975(86)90138-6zbMath0621.68047OpenAlexW1820667573MaRDI QIDQ1090466

Piotr Wyrostek

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90138-6

zbMATH Keywords

sizeunambiguous context-free grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Optimization of LR(k) parsers
• Unnamed Item

This page was built for publication: On the size of unambiguous context-free grammars