A Note on the Complexity of Restricted Attribute-Value Grammars
Abstract
The recognition problem for attribute-value grammars (AVGs) was shown to be undecidable by Johnson in 1988. Therefore, the general form of AVGs is of no practical use. In this paper we study a very restricted form of AVG, for which the recognition problem is decidable (though still NP-complete), the R-AVG. We show that the R-AVG formalism captures all of the context free languages and more, and introduce a variation on the so-called `off-line parsability constraint', the `honest parsability constraint', which lets different types of R-AVG coincide precisely with well-known time complexity classes.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 1995
- DOI:
- 10.48550/arXiv.cmp-lg/9503021
- arXiv:
- arXiv:cmp-lg/9503021
- Bibcode:
- 1995cmp.lg....3021T
- Keywords:
-
- Computer Science - Computation and Language
- E-Print:
- 18 pages, also available by (1) anonymous ftp at ftp://ftp.fwi.uva.nl/pub/theory/illc/researchReports/CT-95-02.ps.gz