Sequential formula translation
- 1 February 1960
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 3 (2) , 76-83
- https://doi.org/10.1145/366959.366968
Abstract
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 such as recursive address calculation.Keywords
This publication has 4 references indexed in Scilit:
- The arithmetic translator-compiler of the IBM FORTRAN automatic coding systemCommunications of the ACM, 1959
- A Description of a Cooperative Venture in the Production of an Automatic Coding SystemJournal of the ACM, 1956
- The use of a ‘floating address’ system for orders in an automatic digital computerMathematical Proceedings of the Cambridge Philosophical Society, 1953
- Über automatische Rechenplanfertigung bei programmgesteuerten RechenmaschinenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1951