On the covering problem for left-recursive grammars

DOI10.1016/0304-3975(79)90052-5zbMath0408.68067OpenAlexW1971649374MaRDI QIDQ1258609

Eljas Soisalon-Soininen

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90052-5

zbMATH Keywords

Covering ProblemLeft-FactoringLeft-Recursive GrammarsTop-Down Parsing

Mathematics Subject Classification ID

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

Related Items (3)

A survey of normal form covers for context-free grammars ⋮ Structure preserving elimination of null productions from context-free grammars ⋮ From left-regular to Greibach normal form grammars

Cites Work

• Unnamed Item
• On top-to-bottom recognition and left recursion
• A syntax improving program
• The theory of languages
• On the Covering and Reduction Problems for Context-Free Grammars

This page was built for publication: On the covering problem for left-recursive grammars