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

DOI10.1016/0304-3975(91)90205-GMaRDI QIDQ802880zbMATHFDO

Authors Stephan Heilbrunner, Lothar Schmitz

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)

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

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• An Improved Context-Free Recognizer
• An efficient context-free parsing algorithm
• General context-free recognition in less than cubic time

Cited in

(6)

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

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)