Abstract
A device called a pushdown assembler has been recently introduced and has been shown capable of defining exactly the syntax directed translations (SDT's). The output operation of the pushdown assembler can be extended in a natural way to obtain a more powerful device called a type B pushdown assembler (or B-machine). A B-machine can define SDT's more simply and directly than the original pushdown assembler. B-machines can also define many interesting translations which are not SDT's. In this paper the B-machine is defined and compared with the original pushdown assembler. The properties of B-machine translations are investigated and it is shown that, as with SDT's, there exists a natural infinite hierarchy of B-machine translations.
Similar content being viewed by others
References
E. Irons, A syntax directed compiler for ALGOL-60,Comm. ACM 4 (1961), 51–55.
K. Culik, Well-translatable languages and ALGOL-like languages,Formal Language Description Languages, pp. 76–85, North Holland Press, 1966.
P. M. Lewis II andR. E. Stearns, Syntax directed translation,IEEE Conference Record 7th Annual Sympos. on Switching and Automata Theory, pp. 21–35, 1966.
M. Paull, Bilateral descriptions of syntactic mappings,First Annual Princeton Conf. on Information Sciences and Systems, pp. 76–81, 1967.
D. Younger, Context-free language processing in timen 3,IEEE Conference Record 7th Annual Sympos. on Switching and Automata Theory, pp. 7–20, 1966. Also, Recognition and parsing of context free languages in timen 3,Information and Control 10 (1967), 189–208.
A. V. Aho andJ. D. Ullman, Properties of syntax directed and translations,J. Assoc. Comput. Mach. 3 (1969), 319–334.
J. Feldman andD. Gries, Translator writing systems,Comm. ACM 11 (1968), 77–113.
D. J. Rosenkrantz, Programmed grammars and classes of formal languages,J. Assoc. Comput. Mach. 16 (1969), 107–131.
A. V. Aho, Indexed grammars—an extension of context-free grammars,J. Assoc. Comput. Mach. 15 (1968), 647–671.
A. V. Aho andJ. D. Ullman, Syntax directed translations and the pushdown assembler,J. Comput. System Sci. 3 (1969), 37–56.
N. Chomsky, Context-free grammars and pushdown storage,Quart. Prog. Rept. 65, M.I.T. Res. Lab. Elect., 1962, pp. 187–194.
R. J. Parikh, Language generating devices,Quart. Prog. Rept. 60, M.I.T. Res. Lab. Elect., 1961, pp. 199–212.
N. Chomsky, On certain formal properties of grammars,Information and Control 2 (1959), 137–167.
J. Earley, An efficient context-free parsing algorithm,Comm. ACM 13 (1970), 94–102.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aho, A.V., Ullman, J.D. Characterizations and extensions of pushdown translations. Math. Systems Theory 5, 172–192 (1971). https://doi.org/10.1007/BF01702875
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01702875