Abstract
A formalism is presented for describing the actions of processors for programming languages—compilers, interpreters, assemblers—and their interactions in complex systems such as compiler-compilers or extendible languages. The formalism here might be used to define and answer such a question as “Can one do bootstrapping using a metacompiler whose metaphase is interpretive?” In addition an algorithm is presented for deciding whether or not a given system can be produced from a given set of component processors. © 1970, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Earley, J., & Sturgis, H. (1970). A Formalism for Translator Interactions. Communications of the ACM, 13(10), 607–617. https://doi.org/10.1145/355598.362740
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.