On LL-regular grammars

DOI10.1016/0022-0000(79)90031-XzbMath0411.68060MaRDI QIDQ1259430

David A. Poplawski

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

parsingregular context-free grammarstop-down algorithm

Mathematics Subject Classification ID

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

Related Items (7)

An experimental ambiguity detection tool ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ Unnamed Item ⋮ Look-ahead on pushdowns ⋮ Ll-regular grammars ⋮ A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages ⋮ Tests for the LR-, LL-, and LC-regular conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Attributed translations
• LL-regular grammars
• Top-down syntax nalysis
• LR-regular grammars - an extension of LR(k) grammars

This page was built for publication: On LL-regular grammars