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

DOI10.1016/0304-3975(91)90205-GzbMATH Open0726.68052MaRDI QIDQ802880FDOQ802880

Authors: Stephan Heilbrunner, Lothar Schmitz 

Publication date: 1991

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

Recommendations

• Developments in Language Theory
• The Boolean closure of linear context-free languages
• Developments in Language Theory
• Boolean grammars
• Recursive descent parsing for Boolean grammars

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient context-free parsing algorithm
• General context-free recognition in less than cubic time
• An Improved Context-Free Recognizer
• Title not available (Why is that?)

Cited In (6)

• Bounded fixed-point definability and tabular recognition of languages
• Fast nondeterministic recognition of context-free languages using two queues
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Boolean kernels of context-free languages
• The Boolean closure of linear context-free languages
• Developments in Language Theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802880)