Extended macro grammars (of the linear basic type only) are introduced as a generalization of those in , and it is shown that they have the same language generating power as (parallel) iteration grammars. In particular the IO and OI versions of extended macro grammars correspond to the deterministic and the (usual) nondeterministic iteration grammars respectively. Hence iterated substitution can be formulated using extended macro grammars. A nondeterministic register program without tests may be viewed as a macro grammar. IO-extension of this macro grammar correspond to the use of nonrecursive function procedures in the register program. OI-extended macro grammars correspond to register programs which compute on sets. Hence these features of register programs can be viewed by means of (extended) parallel rewriting systems. ---------  P.J. Downey, Formal Languages and Recursion Schemes, PhD Thesis 1974, Harvard Univ. Cambridge, MA.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Number of pages||45|
|Publication status||Published - 1978|
- HMI-SLT: Speech and Language Technology