A formalism for translator interactions

  • Authors:
  • Jay Earley;Howard Sturgis

  • Affiliations:
  • Univ. of California, Berkeley;Univ. of California, Berkeley

  • Venue:
  • Communications of the ACM
  • Year:
  • 1970

Quantified Score

Hi-index 48.22

Visualization

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.