| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875566 | Theoretical Computer Science | 2018 | 13 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mikhail Barash, Alexander Okhotin,