Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
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)
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Information and Computation
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
General context-free recognition in less than cubic time
Journal of Computer and System Sciences
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
LL(*): the foundation of the ANTLR parser generator
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 0.00 |
Conjunctive grammars (Okhotin, 2001) are an extension of the standard context-free grammars with a conjunction operation, which maintains most of their practical properties, including many parsing algorithms. This paper introduces a further extension to the model, which is equipped with quantifiers for referring to the left context, in which the substring being defined does occur. For example, a rule A → a & ◺B defines a string a, as long as it is preceded by any string defined by B. The paper gives two equivalent definitions of the model--by logical deduction and by language equations--and establishes its basic properties, including a transformation to a normal form, a cubic-time parsing algorithm, and another recognition algorithm working in linear space.