On the transformation of LL\((k)\)-linear to LL(1)-linear grammars

DOI10.1007/s00224-022-10108-6MaRDI QIDQ6038708

Alexander Okhotin, Ilya Olkhovsky

Publication date: 2 May 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

parsingdescriptional complexityLL grammarslinear grammars

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Some subclasses of context-free languages in \(NC^ 1\)
• Underlying principles and recurring ideas of formal grammars
• Top-down syntax nalysis
• On linear languages recognized by deterministic biautomata
• Syntax-Directed Transduction
• Notes on top-down languages
• Properties of deterministic top-down grammars

This page was built for publication: On the transformation of LL\((k)\)-linear to LL(1)-linear grammars