A recognition and parsing algorithm for arbitrary conjunctive grammars.
From MaRDI portal
Publication:1401337
DOI10.1016/S0304-3975(02)00853-8zbMath1044.68081MaRDI QIDQ1401337
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (10)
On the closure properties of linear conjunctive languages. ⋮ Conjunctive grammars and alternating pushdown automata ⋮ On the number of nonterminals in linear conjunctive grammars ⋮ LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Complexity of equations over sets of natural numbers ⋮ One-nonterminal conjunctive grammars over a unary alphabet ⋮ LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata ⋮ LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata ⋮ The hardest linear conjunctive language
Cites Work
- Space-bounded reducibility among combinatorial problems
- Top-down parsing of conjunctive languages
- An Improved Context-Free Recognizer
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- An efficient context-free parsing algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A recognition and parsing algorithm for arbitrary conjunctive grammars.
