Unambiguous Boolean grammars

DOI10.1016/J.IC.2008.03.023MaRDI QIDQ948095zbMATH OpenOpenAlexFDO

Authors Alexander Okhotin

Publication date 8 October 2008

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.03.023

zbMATH Keywords

ambiguityparsingBoolean grammarsconjunctive grammars

Mathematics Subject Classification ID

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

Recommendations

• Boolean grammars
• Well-Founded Semantics for Boolean Grammars
• scientific article; zbMATH DE number 2040923
• Well-founded semantics for Boolean grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• scientific article; zbMATH DE number 3361265 (Why is no real title available?)
• A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
• A helpful result for proving inherent ambiguity
• A very hard log-space counting class
• Ambiguity in context free languages
• An efficient context-free parsing algorithm
• Boolean grammars
• CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
• Characterizations and computational complexity of systolic trellis automata
• Expressive Power of LL(k) Boolean Grammars
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
• On real time one-way cellular array
• On the equivalence of linear conjunctive grammars and trellis automata
• Parallel time O(log n) recognition of unambiguous context-free languages
• Recursive descent parsing for Boolean grammars
• Sublogarithmic ambiguity
• Systolic trellis automatata †
• The hardest linear conjunctive language
• The undecidability of the ambiguity problem for minimal linear grammars
• Two Families of Languages Related to ALGOL
• Well-Founded Semantics for Boolean Grammars

Cited in

(20)

• Primal grammars and unification modulo a binary clause
• Boolean grammars and gsm mappings
• Input-driven languages are linear conjunctive
• Comparing linear conjunctive languages to subfamilies of the context-free languages
• scientific article; zbMATH DE number 1062291 (Why is no real title available?)
• Conjunctive grammars with restricted disjunction
• Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
• Conjunctive Grammars with Restricted Disjunction
• Boolean grammars
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Boolean algebras of unambiguous context-free languages
• Parsing by matrix multiplication generalized to Boolean grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• scientific article; zbMATH DE number 2040923 (Why is no real title available?)
• Well-founded semantics for Boolean grammars
• Unambiguous conjunctive grammars over a one-symbol alphabet
• Well-Founded Semantics for Boolean Grammars
• Parsing Boolean grammars over a one-letter alphabet using online convolution
• An extension of context-free grammars with one-sided context specifications
• Linear-space recognition for grammars with contexts

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Unambiguous Boolean grammars

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