Context-Free Grammars with Graph Controlled Tables
DOI:
https://doi.org/10.7146/dpb.v4i43.6463Abstract
It is shown that every context-sensitive language can be generated by a context-free grammar with graph control over sets of productions. This can be done in two different ways, corresponding to unconditional transfer programmed grammars and programmed grammars with empty failure fields. Also some results concerning ordinary programmed grammars are established.Downloads
Published
1975-01-01
How to Cite
Rozenberg, G., & Salomaa, A. (1975). Context-Free Grammars with Graph Controlled Tables. DAIMI Report Series, 4(43). https://doi.org/10.7146/dpb.v4i43.6463
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.