Grammars with two-sided contexts

Mikhail Barash, Alexander Okhotin

Research output

Abstract

In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012), 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 and establishes the basic theory of such grammars, leading to a normal form and a parsing algorithm working in time O{script}(n4), where n is the length of the input string.

Original languageEnglish
Pages (from-to)94-108
Number of pages15
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume151
DOIs
Publication statusPublished - 21 May 2014
Event14th International Conference on Automata and Formal Languages, AFL 2014 - Szeged
Duration: 27 May 201429 May 2014

Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Grammars with two-sided contexts'. Together they form a unique fingerprint.

Cite this