Top-down parsing of conjunctive languages

DOI10.1023/A:1014219530875zbMath1003.68058MaRDI QIDQ1604833

Alexander Okhotin

Publication date: 9 July 2002

Published in: Grammars (Search for Journal in Brave)

zbMATH Keywords

context-free grammarconjunctive grammars

Mathematics Subject Classification ID

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

Related Items (6)

Conjunctive grammars and alternating pushdown automata ⋮ Recursive descent parsing for Boolean grammars ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A recognition and parsing algorithm for arbitrary conjunctive grammars. ⋮ LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata ⋮ LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

This page was built for publication: Top-down parsing of conjunctive languages