Extended linear macro grammars, iteration grammars, and register programs

Share/Save/Bookmark

Asveld, Peter R.J. and Engelfriet, Joost (1979) Extended linear macro grammars, iteration grammars, and register programs. Acta Informatica, 11 (3). pp. 259-285. ISSN 0001-5903

open access
[img]
Preview
PDF
1MB
Abstract:Extended macro grammars (of the linear basic type only) are introduced as a generalization of those in [5], and it is shown that they have the same language generating power as (parallel) iteration grammars. In particular the OI 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 corresponds 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 investigated by means of (extended) parallel rewriting systems.
Item Type:Article
Copyright:© 1979 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/65594
Official URL:http://dx.doi.org/10.1007/BF00289070
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page