A survey of normal form covers for context-free grammars

DOI10.1007/BF00264257zbMath0419.68096MaRDI QIDQ1132639

Anton Nijholt

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

survey; parsing; Greibach normal form; epsilon-free grammars; non-left-recursive grammars; normal form covers for context-free grammars

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N20: Theory of compilers and interpreters

Cites Work

• Context-free grammar forms
• On the equivalence, containment, and covering problems for the regular and context-free languages
• The covering problem for linear context-free grammars
• On the covering of parsable grammars
• The nonexistence of some covering context-free grammars
• On the covering problem for left-recursive grammars
• From left-regular to Greibach normal form grammars
• Structural equivalence of context-free grammars
• Strict deterministic grammars
• Grammar functors and covers: From non-left-recursive to greibach normal form grammars
• On the Complete Covering Problem for LR ( k )Grammars
• Some Preservation Properties of Normal Form Grammars
• Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
• On the relative efficiencies of context-free grammar
• On top-to-bottom recognition and left recursion
• The augmented predictive analyzer for context-free languages—its relative efficiency
• A syntax improving program
• The normal form theorem--another proof
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item