ACM Home Page
Please provide us with feedback. Feedback
Sequential formula translation
Full text PdfPdf (1.16 MB)
Source
Communications of the ACM archive
Volume 3 ,  Issue 2  (February 1960) table of contents
Pages: 76 - 83  
Year of Publication: 1960
ISSN:0001-0782
Authors
K. Samelson  Johannes Gutenberg Univ., Mainz, Germany
F. L. Bauer  Johannes Gutenberg Univ., Mainz, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 38,   Citation Count: 42
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/366959.366968
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GOLDSTINE:, H. AND VON NEUMANN, J.: Planning and coding for an electronic computing instrument. Institute for Advanced Study, Princeton, N. J., 1947/48.
 
2
International Business Machines Corp., FORTRAN Manual.
3
 
4
RUTISHAUSER L H. Uber automatische Rechenplanferdgung bei programmgesteuerten Reehenanlageu. Z. Angew. Math. Mech. 31 (1951), 255.
 
5
RUTSHAUSER H.: Automatisehe Reehenplanferdgung bei programmgesteuerten Reehenmasehinen. Mitt, Inst. f. Angew. Math. der ETH Zurich, Nr. 3 (1952).
 
6
SAMELSON, K.: Probleme der Programmierungsteehnik. Intern. Kolloquium fiber Probleme der Rechentechnik, Dresden 1955, p. 61-68.
7
 
8
 
9
WILKES, M. V. : The use of a floating address system for orders in an automatic digital computer. Proc, Cambridge Philos. Soc. 49 (1953), 84-89.
 
10
ADAMS, CHARLES W., AND LANING, J. H., JR. The M.I.T. System of Automatic Coding: Comprehensive, Summer Session and Algebraic. in: Symposium on Automatic Programming for Digital Computer, U. S. Department of Commerce.
 
11
ACM Committee on Programming language and GAMM Committee on Programming Report on the Algorithmic language ALGOL. edited by A. J. Perlis and K. Samelson Num, Math. 1 (1959), 41-60.
 
12
ZEMANEK, H. Die algorithmisehe Vormebprache ALGOL Elektronische Rechenungagen 1 (1959), 72-79 amd 140-143.
 
13
BAUGER, F. L, The formula controlled logical computer Stanislaus. To appear in Math. Tables. Aids Comp.
 
14
BOHM.

CITED BY  42
Collaborative Colleagues:
K. Samelson: colleagues
F. L. Bauer: colleagues