A necessary and sufficient condition for a power language to be LL(k)

DOI10.1093/comjnl/16.4.351zbMath0271.68058OpenAlexW2114957682MaRDI QIDQ3214435

H. Saya, J. Bordier

Publication date: 1973

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/16.4.351

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Two iteration theorems for the LL(k) languages ⋮ Necessary and sufficient conditions for a power language to be deterministic

This page was built for publication: A necessary and sufficient condition for a power language to be LL(k)