Parallel time O (log n) recognition of unambiguous context-free languages
Information and Computation
Observations on log(n) time parallel recognition of unambiguous CFL's
Information Processing Letters
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
On real time one-way cellular array
Theoretical Computer Science
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Ambiguity in context free languages
Journal of the ACM (JACM)
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
On ambiguity in phrase structure languages
Communications of the ACM
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The hardest linear conjunctive language
Information Processing Letters
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Recursive descent parsing for Boolean grammars
Acta Informatica
Well-Founded semantics for boolean grammars
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Conjunctive Grammars with Restricted Disjunction
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the number of nonterminal symbols in unambiguous conjunctive grammars
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.00 |
Boolean grammars are an extension of context-free grammars, in which conjunction and negation may be explicitly used in the rules. In this paper, the notion of ambiguity in Boolean grammars is defined. It is shown that the known transformation of a Boolean grammar to the binary normal form preserves unambiguity, and that every unambiguous Boolean language can be parsed in time O(n^2). Linear conjunctive languages are shown to be unambiguous, while the existence of languages inherently ambiguous with respect to Boolean grammars is left open.