On the generation of sentences with their parses by propagating regular-controlled grammars

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ϱ, where w∈L(G) and ϱ 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.