Sequential formula translation
Klaus Samelson, Friedrich Ludwig Bauer · Communications of the ACM · 1960
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.
Cited by 85 works. doi:10.1145/366959.366968 Open-access PDF
Authors
References
- International Business Machines Corp.
- The arithmetic translator-compiler of the IBM FORTRAN automatic coding system
- The use of a ‘floating address’ system for orders in an automatic digital computer
- A Description of a Cooperative Venture in the Production of an Automatic Coding System
- Über automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen