Size/lookahead tradeoff for \(LL(k)\)-grammars

DOI10.1016/S0020-0190(01)00156-9zbMath1032.68090OpenAlexW2087882380MaRDI QIDQ1603369

E. Bertsch, Mark-Jan Nederhof

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00156-9

zbMATH Keywords

Formal languagesParsing theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

IN MEMORIAM CHANDRA KINTALA ⋮ THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS ⋮ Succinct description of regular languages by weak restarting automata

Cites Work

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

This page was built for publication: Size/lookahead tradeoff for \(LL(k)\)-grammars