On the Covering and Reduction Problems for Context-Free Grammars

DOI10.1145/321724.321732zbMath0259.68035OpenAlexW1971656648WikidataQ128705344 ScholiaQ128705344MaRDI QIDQ5674991

Michael A. Harrison, Jim Gray

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321724.321732

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (22)

Testing for grammatical coverings ⋮ Deterministic grammars and grammar morphisms ⋮ Toward knowledge-based specifications of languages ⋮ Unnamed Item ⋮ Local constraints in programming languages. I: Syntax ⋮ On homomorphic images of left szilard languages ⋮ A note on grammatical covers ⋮ Structure preserving elimination of null productions from context-free grammars ⋮ Unnamed Item ⋮ Efficient learning of context-free grammars from positive structural examples ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Unnamed Item ⋮ Grammar functors and covers: From non-left-recursive to greibach normal form grammars ⋮ 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 ⋮ Precedence-regular grammars ⋮ SLR(k) covering for LR(k) grammars ⋮ On derivation preservation

This page was built for publication: On the Covering and Reduction Problems for Context-Free Grammars