Unambiguous Boolean grammars
From MaRDI portal
Publication:948095
DOI10.1016/J.IC.2008.03.023zbMATH Open1328.68106OpenAlexW2039297197MaRDI QIDQ948095FDOQ948095
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
Recommendations
Cites Work
- Title not available (Why is that?)
- An efficient context-free parsing algorithm
- Parallel time O(log n) recognition of unambiguous context-free languages
- Boolean grammars
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Title not available (Why is that?)
- On the equivalence of linear conjunctive grammars and trellis automata
- Two Families of Languages Related to ALGOL
- A very hard log-space counting class
- Recursive descent parsing for Boolean grammars
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
- The hardest linear conjunctive language
- Systolic trellis automatata †
- A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
- On real time one-way cellular array
- Characterizations and computational complexity of systolic trellis automata
- Ambiguity in context free languages
- The undecidability of the ambiguity problem for minimal linear grammars
- Expressive Power of LL(k) Boolean Grammars
- Well-Founded Semantics for Boolean Grammars
- A helpful result for proving inherent ambiguity
- Title not available (Why is that?)
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
- Sublogarithmic ambiguity
Cited In (20)
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- Well-founded semantics for Boolean grammars
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Conjunctive grammars with restricted disjunction
- Well-Founded Semantics for Boolean Grammars
- An extension of context-free grammars with one-sided context specifications
- Boolean grammars and gsm mappings
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- Boolean grammars
- Input-driven languages are linear conjunctive
- Primal grammars and unification modulo a binary clause
- Title not available (Why is that?)
- Unambiguous conjunctive grammars over a one-symbol alphabet
- Linear-space recognition for grammars with contexts
- Conjunctive Grammars with Restricted Disjunction
- Parsing by matrix multiplication generalized to Boolean grammars
- Title not available (Why is that?)
- Boolean algebras of unambiguous context-free languages
Uses Software
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)
