Sequential formula translation

@article{Samelson1960SequentialFT,
  title={Sequential formula translation},
  author={K. Samelson and F. L. Bauer},
  journal={Commun. ACM},
  year={1960},
  volume={3},
  pages={76-83}
}
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
  • 123
Program control via transition matrices—a novel application of micro-programming
  • 3
  • Highly Influenced
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
  • 55
  • PDF
Programming Language Concepts
  • P. Sestoft
  • Computer Science
  • Undergraduate Topics in Computer Science
  • 2012
  • 6
  • PDF
From mathematical logic to programming-language semantics: a discussion with Tony Hoare
  • 2
Local optimizations
  • 5
Translator writing systems
  • 179
An undergraduate compiler laboratory
  • 2
Some proposals for improving the efficiency of ALGOL 60
  • 17
...
1
2
3
...