On compiling algorithms for arithmetic expressions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On compiling algorithms for arithmetic expressions

Full text

Pdf (298 KB)

Source

Communications of the ACM archive
Volume 10 , Issue 8 (August 1967) table of contents

Pages: 492 - 494

Year of Publication: 1967

ISSN:0001-0782

Author

Ikuo Nakata

Central Research Laboratory, Hitachi, Ltd., Tokyo, Japan

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 28, Citation Count: 24

Additional Information:

abstract references cited by index terms collaborative colleagues

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/363534.363549 What is a DOI?

ABSTRACT

This paper deals with algorithms concerning arithmetic expressions used in a FORTRAN IV compiler for a HITAC-5020 computer having n accumulators. The algorithms generate an object code which minimizes the frequency of storing and recovering the partial results of the arithmetic expressions in cases where there are several accumulators.

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	James P. Anderson, A note on some compiling algorithms, Communications of the ACM, v.7 n.3, p.149-150, March 1964 [doi>10.1145/363958.363976]
	2	MURATA, K., AND NAKAZAWA, K. Very high speed serial and serial-parallel computers HITAC 5020 and 5020E. Proc. AFIPS 1964 Fall Joint Comput. Conf., Vol. 26, Pt. 1. 187-203.
	3	FERGUSON, DAVID E. LARC scientific compiler phase 7 internal system manual. UNIVAC Div. of Sperry Rand Corp., 1961.

CITED BY 24

	A. V. Aho , S. C. Johnson , J. D. Ullman, Code-generation for machines with multiregister operations, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.21-28, January 17-19, 1977, Los Angeles, California
	Bhaskaram Prabhala , Ravi Sethi, Efficient Computation of Expressions with Common Subexpressions, Journal of the ACM (JACM), v.27 n.1, p.146-163, Jan. 1980
	A. V. Aho , S. C. Johnson, Optimal Code Generation for Expression Trees, Journal of the ACM (JACM), v.23 n.3, p.488-501, July 1976
	John Bruno , Ravi Sethi, Code Generation for a One-Register Machine, Journal of the ACM (JACM), v.23 n.3, p.502-510, July 1976
	Bhaskaram Prabhala , Ravi Sethi, Efficient computation of expressions with common subexpressions, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.222-230, January 23-25, 1978, Tucson, Arizona
	Ravi Sethi , J. D. Ullman, The Generation of Optimal Code for Arithmetic Expressions, Journal of the ACM (JACM), v.17 n.4, p.715-728, Oct. 1970
	Martin Farach , Vincenzo Liberatore, On local register allocation, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.564-573, January 25-27, 1998, San Francisco, California, United States
	E. G. Coffman, Jr. , Ravi Sethi, Instruction Sets for Evaluating Arithmetic Expressions, Journal of the ACM (JACM), v.30 n.3, p.457-478, July 1983
	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
	Bhaskaram Prabhala , Ravi Sethi, A comparison of instruction sets for stack machines, Proceedings of the ninth annual ACM symposium on Theory of computing, p.132-142, May 04-04, 1977, Boulder, Colorado, United States
	J. L. Bruno , T. Lassagne, The Generation of Optimal Code for Stack Machines, Journal of the ACM (JACM), v.22 n.3, p.382-396, July 1975
	Robert J. Sheraga , John L. Gieser, Automatic microcode generation for horizontally microprogrammed processors, ACM SIGMICRO Newsletter, v.12 n.4, p.154-168, Dec. 1981
	D. Bernstein , J. M. Jaffe , M. Rodeh, Scheduling arithmetic and load operations in parallel with no spilling, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.263-273, January 21-23, 1987, Munich, West Germany
	A. V. Aho , S. C. Johnson, Optimal code generation for expression trees, Proceedings of seventh annual ACM symposium on Theory of computing, p.207-217, May 05-07, 1975, Albuquerque, New Mexico, United States
	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts
	Vincent A. Busam , Donald E. Englund, Optimization of expressions in Fortran, Communications of the ACM, v.12 n.12, p.666-674, Dec. 1969
	C. V. Ramamoorthy , M. J. Gonzalez, Subexpression ordering in the execution of arithmetic expressions, Communications of the ACM, v.14 n.7, p.479-485, July 1971
	Ravi Sethi, Complete register allocation problems, Proceedings of the fifth annual ACM symposium on Theory of computing, p.182-195, April 30-May 02, 1973, Austin, Texas, United States
	Waleed M. Meleis , Edward S. Davidson, Dual-issue scheduling with spills for binary trees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.678-686, January 17-19, 1999, Baltimore, Maryland, United States
	R. R. Redziejowski, On arithmetic expressions and trees, Communications of the ACM, v.12 n.2, p.81-84, Feb. 1969
	Robert W. Witty, The switching reverse polise algorithm, ACM SIGPLAN Notices, v.12 n.9, p.114-123, September 1977
	Jerry L. Apperson, Optimal evaluation order for expressions with redundant subexpressions, ACM SIGPLAN Notices, v.8 n.6, June 1973
	G. Chroust, Scope conserving expression evaluation: a class of storage optimal evaluation strategies for arithmetic expressions, ACM SIGPLAN Notices, v.12 n.12, p.68-72, December 1977
	Alfred V. Aho , Ravi Sethi , J. D. Ullman, A formal approach to code optimization, ACM SIGPLAN Notices, v.5 n.7, p.86-100, July 1970