Linear-space recognition for grammars with contexts

A1 Journal article (refereed)


Internal Authors/Editors


Publication Details

List of Authors: Barash M, Okhotin A
Publisher: ELSEVIER SCIENCE BV
Publication year: 2018
Journal: Theoretical Computer Science
Journal acronym: THEOR COMPUT SCI
Volume number: 719
Start page: 73
End page: 85
Number of pages: 13
ISSN: 0304-3975


Abstract

Grammars with contexts are an extension of context-free grammars equipped with operators for referring to the left and the right contexts of a substring being defined. These grammars are notable for still having a cubic-time parsing algorithm, as well as for being able to describe some useful syntactic constructs, such as declaration before use. It is proved in this paper that every language described by a grammar with contexts can be recognized in deterministic linear space. (C) 2017 Elsevier By. All rights reserved.


Keywords

Conjunctive grammars, Context-free grammars, Context-sensitive grammars, Parsing, Space complexity

Last updated on 2019-15-10 at 01:14