An efficient recognizer for the Boolean closure of context-free languages

DOI10.1016/0304-3975(91)90205-GzbMath0726.68052MaRDI QIDQ802880

Lothar Schmitz, Stephan Heilbrunner

Publication date: 1991

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

zbMATH Keywords

Earley's algorithmcontextfree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (3)

Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ The Boolean closure of linear context-free languages ⋮ Boolean kernels of context-free languages

Cites Work

• General context-free recognition in less than cubic time
• An Improved Context-Free Recognizer
• An efficient context-free parsing algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient recognizer for the Boolean closure of context-free languages