Extended macro grammars and stack controlled machines
Engelfriet, Joost and Slutzki, Giora (1984) Extended macro grammars and stack controlled machines. Journal of Computer and System Sciences, 29 (3). pp. 366408. ISSN 00220000

PDF
2MB 
Abstract:  Kextended basic macro grammars are introduced, where K is any class of languages. The class B(K) of languages generated by such grammars is investigated, together with the class LB(K) of languages generated by the corresponding linear basic grammars. For any full semiAFL K, B(K) is a full AFL closed under iterated LB(K)substitution, but not necessarily under substitution. For any machine type D, the stack controlled machine type corresponding to D is introduced, denoted S(D), and the checkingstack controlled machine type CS(D). The data structure of this machine is a stack which controls a pushdown of data structures from D. If D accepts K, then S(D) accepts B(K) and CS(D) accepts LB(K). Thus the classes B(K) are characterized by stack controlled machines and the classes LB(K), i.e., the full hyperAFLs, by checkingstack controlled machines. A full basicAFL is a full AFL K such that B(K)C K. Every full basicAFL is a full hyperAFL, but not vice versa. The class of OI macro languages (i.e., indexed languages, i.e., nested stack automaton languages) is a full basicAFL, properly containing the smallest full basicAFL. The latter is generated by the ultrabasic macro grammars and accepted by the nested stack automata with bounded depth of nesting (and properly contains the stack languages, the ETOL languages, i.e., the smallest full hyperAFL, and the basic macro languages). The full basicAFLs are characterized by bounded nested stack controlled machines. 
Item Type:  Article 
Copyright:  © 1984 Elsevier Science 
Link to this item:  http://purl.utwente.nl/publications/69266 
Official URL:  http://dx.doi.org/10.1016/00220000(84)900060 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page