On the size of parsers and \(\text{LR}(k)\)-grammars

DOI10.1016/S0304-3975(98)00199-6zbMath0944.68083MaRDI QIDQ1575535

Detlef Wotschke, Hing-Man Leung

Publication date: 21 August 2000

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

zbMATH Keywords

grammarparsingdescriptional complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (6)

IN MEMORIAM CHANDRA KINTALA ⋮ Syntax checking either way ⋮ A predictive bottom-up parser ⋮ Succinct description of regular languages by weak restarting automata ⋮ Syntax checking either way ⋮ Size/lookahead tradeoff for \(LL(k)\)-grammars

Cites Work

• Unnamed Item
• Economy of description by parsers, DPDA's, and PDA's
• Early error detection in syntax-driven parsers

This page was built for publication: On the size of parsers and \(\text{LR}(k)\)-grammars