Some effects of the 6600 computer on language structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Some effects of the 6600 computer on language structures

Full text

Pdf (668 KB)

Source

Communications of the ACM archive
Volume 7 , Issue 2 (February 1964) table of contents

Pages: 112 - 119

Year of Publication: 1964

ISSN:0001-0782

Authors

R. W. Allard	Central Data Corporation, Minneapolis, MN
K. A. Wolf	Central Data Corporation, Minneapolis, MN
R. A. Zemlin	Central Data Corporation, Minneapolis, MN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 8

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363921.363940 What is a DOI?

ABSTRACT

The problem of compiling efficient 6600 codes prompted the development of an intermediate language reflecting the structure of the machine, that is more easily manipulated in improving object program efficiency. The subject of this paper is the intermediate language and methods of manipulating it. Compilations of a series of arithmetic statements are discussed. It is assumed that all functions and exponentials have been removed from these statements, and replaced by simple variables. For purposes of simplicity the treatment of subscripts is ignored. A simplified 6600 structure is presented to illustrate the compiling method. Several assumptions are made for purposes of simplification, although there are cases in which the assumptions are violated in the actual machine.

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	B. Arden , R. Graham, On GAT and the construction of translators, Communications of the ACM, v.2 n.7, p.24-26, July 1959 [doi>10.1145/368370.368373]
	2	B. W. Arden , B. A. Galler , R. M. Graham, The internal organization of the MAD translator, Communications of the ACM, v.4 n.1, p.28-31, Jan. 1961 [doi>10.1145/366062.366079]
	3	A. P. Ershov, On programming of arithmetic operations, Communications of the ACM, v.1 n.8, p.3-6, Aug. 1958 [doi>10.1145/368892.368907]

CITED BY 8

	Harold S. Stone, One-Pass compilation of arithmetic expressions for a parallel processor, Communications of the ACM, v.10 n.4, p.220-223, April 1967
	James C. Beatty, An axiomatic approach to code optimization for expressions, Journal of the ACM (JACM), v.19 n.4, p.613-640, Oct. 1972
	J. F. Thorlin, Code generation for PIE (Parallel Instruction Execution) computers, Proceedings of the April 18-20, 1967, spring joint computer conference, April 18-20, 1967, Atlantic City, New Jersey
	J. L. Baer, A Survey of Some Theoretical Aspects of Multiprocessing, ACM Computing Surveys (CSUR), v.5 n.1, p.31-80, March 1973
	Peter Hibbard, Multiprocessor software design, Proceedings of the ACM 1980 annual conference, p.527-536, January 1980
	Edward S. Lowry , C. W. Medlock, Object code optimization, Communications of the ACM, v.12 n.1, p.13-22, Jan. 1969
	Paul B. Schneck, A survey of compiler optimization techniques, Proceedings of the annual conference, p.106-113, August 27-29, 1973, Atlanta, Georgia, United States
	Robert M. Keller, Look-Ahead Processors, ACM Computing Surveys (CSUR), v.7 n.4, p.177-195, Dec. 1975