Two-sided context specifications in formal grammars

In a recent paper (M. Barash, A. Okhotin, "An extension of context-free grammars with one-sided context specifications", Inform. and Comput., 2014), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being defined. This paper proposes a more general model, in which context specifications may be two-sided, that is, both the left and the right contexts can be specified by the corresponding operators. The paper gives the definitions, presents several examples of grammars and establishes a basic normal form theorem. This normal form, in particular, leads to a simple parsing algorithm working in time O ( n 4 ) , where n is the length of the input string.

[1]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[2]  Mikhail Barash,et al.  Programming language specification by a grammar with contexts , 2013, NCMA.

[3]  Zoltán Ésik,et al.  Boolean Fuzzy Sets , 2007, Int. J. Found. Comput. Sci..

[4]  Alexander Okhotin,et al.  Generalized LR Parsing for Grammars with Contexts , 2015, CSR.

[5]  Max Rabkin,et al.  Recognizing Two-Sided Contexts in Cubic Time , 2014, CSR.

[6]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[7]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[8]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[9]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[10]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[11]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

[12]  Artur Jez.  Conjunctive Grammars Can Generate Non-regular Unary Languages , 2007, Developments in Language Theory.

[13]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[14]  Ivan Hal Sudborough,et al.  A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[15]  Alexander Okhotin.  Conjunctive Grammars and Systems of Language Equations , 2004, Programming and Computer Software.

[16]  William C. Rounds,et al.  LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity , 1988, Comput. Linguistics.

[17]  Alexander Okhotin,et al.  Conjunctive and Boolean grammars: The true general case of the context-free grammars , 2013, Comput. Sci. Rev..

[18]  Alexander Okhotin.  Boolean grammars , 2004, Inf. Comput..

[19]  Alexander Okhotin.  Parsing by matrix multiplication generalized to Boolean grammars , 2014, Theor. Comput. Sci..

[20]  Panos Rondogiannis,et al.  Well-founded semantics for Boolean grammars , 2009, Inf. Comput..

[21]  Michael Kaminski,et al.  LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata , 2011, J. Comput. Syst. Sci..

[22]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[23]  Alexander Okhotin.  Improved Normal Form for Grammars with One-Sided Contexts , 2013, DCFS.

[24]  Alexander Okhotin,et al.  An extension of context-free grammars with one-sided context specifications , 2014, Inf. Comput..