Greibach normal form transformation revisited.

DOI10.1006/inco.1998.2772zbMath1045.68584OpenAlexW2047349327MaRDI QIDQ1854266

Yanyan Li

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1cac6a117b782829780207236b8e2443a73d12b7

zbMATH Keywords

context-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Decision problems for word-hyperbolic semigroups ⋮ Finally tagless observable recursion for an abstract grammar model ⋮ Arithmetic Circuits, Monomial Algebras and Finite Automata ⋮ Efficient reconfigurable embedded parsers ⋮ Normal form algorithms for extended context-free grammars ⋮ Categorial dependency grammars

Cites Work

• Complexity of normal form grammars
• Optimization of LR(k) parsers
• An easy proof of Greibach normal form
• Greibach normal form transformation, revisited
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Matrix Equations and Normal Forms for Context-Free Grammars
• On Greibach normal form construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greibach normal form transformation revisited.