Automata and languages: theory and applications
Automata and languages: theory and applications
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science
Scattered Context Grammars and Their Applications
Scattered Context Grammars and Their Applications
Classes of Szilard Languages in NC^1
SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
| Hi-index | 5.23 |
The present paper explains how to transform any regular-controlled (context-free) grammar with appearance checking G to a propagating regular-controlled (context-free) grammar with appearance checking G^' whose language L(G^') has sentences of the form w@r, where w@?L(G) and @r is a parse of w in G^'. Consequently, for every recursively enumerable language K, there exists a propagating regular-controlled grammar with appearance checking G^' with L(G^') of the above form so that K results from L(G^') by erasing all rules in L(G^'). In addition, analogical results are established (a) in terms of these grammars without appearance checking and (b) in terms of these grammars that make only leftmost derivations. In the conclusion, we point out some consequences implied by the results achieved in this paper.