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)
68Q42: Grammars and rewriting systems
Related Items
On the number of nonterminals in linear conjunctive grammars, On the closure properties of linear conjunctive languages.
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