Sequential formula translation

  title={Sequential formula translation},
  author={K. Samelson and F. L. Bauer},
  journal={Commun. ACM},
The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state-symbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes… Expand
23 Citations

Tables and Topics from this paper

Stack automata and compiling
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
Programming Language Concepts
  • P. Sestoft
  • Computer Science
  • Undergraduate Topics in Computer Science
  • 2012
From mathematical logic to programming-language semantics: a discussion with Tony Hoare
Local optimizations
Translator writing systems
An undergraduate compiler laboratory