Context-Free Grammars with Graph Controlled Tables

Forfattere

  • Grzegorz Rozenberg
  • Arto Salomaa

DOI:

https://doi.org/10.7146/dpb.v4i43.6463

Resumé

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.

Forfatterbiografier

Grzegorz Rozenberg

Arto Salomaa

Downloads

Publiceret

1975-01-01

Citation/Eksport

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

Nummer

Nr. 43 (1975): PB-43 Context-Free Grammars with Graph Controlled Tables

Sektion

Articles

Licens

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.