On satisfying the LL-iteration theorem

DOI10.1016/0304-3975(88)90011-4zbMath0501.68045OpenAlexW2033529069WikidataQ127498880 ScholiaQ127498880MaRDI QIDQ1172400

Anton Nijholt

Publication date: 1983

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

Full work available at URL: https://research.utwente.nl/en/publications/on-satisfying-the-lliteration-theorem(fe0253da-7a72-42c7-b5fc-bb96b7c5c0ee).html

zbMATH Keywords

LL-languages

Mathematics Subject Classification ID

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

Cites Work

• Two iteration theorems for the LL(k) languages
• A note on the sufficiency of Sokolowski's criterion for context-free languages
• Pumping languages^†
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item

This page was built for publication: On satisfying the LL-iteration theorem