Sequential formula translation-Reference-Cited by-同舟云学术

Sequential formula translation

Published:1983-01 Issue:1 Volume:26 Page:9-13
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Samelson K.¹,Bauer F. L.¹

Affiliation:

1. Johannes Gutenberg Univ., Mainz, Germany

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- s ymbol 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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/357980.357983

Reference14 articles.

1. GOLDSTINE H. AND VON INEUMANN J.: Planning ana Coding for an electronic computing instrument. Institute for Advanced Study Princeton N. J. 1947/48. GOLDSTINE H. AND VON INEUMANN J.: Planning ana Coding for an electronic computing instrument. Institute for Advanced Study Princeton N. J. 1947/48.

2. International Business Machines Corp. FORTRAN Manual. International Business Machines Corp. FORTRAN Manual.

3. A Description of a Cooperative Venture in the Production of an Automatic Coding System

4. Über automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen

5. RUTISHAUSER H.: Automatisebe Rechenplanfertigung bei programmgesteuerten Recbenmasehinen. Mitt. Inst. f. Angew. Math. der ETH Zurich Nr. 3 (1952). RUTISHAUSER H.: Automatisebe Rechenplanfertigung bei programmgesteuerten Recbenmasehinen. Mitt. Inst. f. Angew. Math. der ETH Zurich Nr. 3 (1952).