On parsing coupled-context-free languages

DOI10.1016/0304-3975(95)00114-XzbMath0872.68089OpenAlexW1983079678MaRDI QIDQ1351955

Günter Hotz, Gisela Pitsch

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00114-x

Mathematics Subject Classification ID

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

Related Items (5)

Algebraic dynamic programming for multiple context-free grammars ⋮ Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars ⋮ Finding the smallest binarization of a CFG is NP-hard ⋮ Distributional Learning of Context-Free and Multiple Context-Free Grammars ⋮ The Pumping Lemma for Well-Nested Multiple Context-Free Languages

Cites Work

• Unnamed Item
• Tree adjunct grammars
• Scattered context grammars
• On certain formal properties of grammars
• Recognition and parsing of context-free languages in time n3
• Some inherently ambiguous context-free languages

This page was built for publication: On parsing coupled-context-free languages