Third generation compiler design

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Third generation compiler design

Full text

Pdf (509 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1975 annual conference table of contents

Pages: 253 - 258

Year of Publication: 1975

Author

Marvin V. Zelkowitz

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

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

ABSTRACT

Compilers, besides testing for errors in a particular implementation of an algorithm, can be implemented to analyze program structure. This information can be fed back to the programmer in order to improve the structure, reliability and efficiency of the resulting program. This paper surveys several techniques that are currently implementable in a compiler, describes several new techniques that can be applied to programs, and briefly describes one such implementation of many of these ideas.

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	R. N. Chanon, On a measure of program structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.9-16, April 09-11, 1974
	2	R. W. Conway , W. L. Maxwell, CORC—the Cornell computing language, Communications of the ACM, v.6 n.6, p.317-321, June 1963 [doi>10.1145/366604.366651]
	3	Richard W. Conway , Thomas R. Wilcox, Design and implementation of a diagnostic compiler for PL/I, Communications of the ACM, v.16 n.3, p.169-179, March 1973 [doi>10.1145/361972.361992]
	4	Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968 [doi>10.1145/362929.362947]
	5	Floyd R. Assigning meanings to programs. Symposium in Applied Mathematics 19 (1967) 19-32.
	6	Maurice Halstead , Rudolf Bayer, Algorithm dynamics, Proceedings of the annual conference, p.126-135, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805693]
	7	Hellerman L. A measure of computational work. IEEE Transactions on Computers C-21, no. 5 (May, 1972) 439-446.
	8	C. A. R. Hoare, Hints on programming language design., Stanford University, Stanford, CA, 1973
	9	Ingalls D. The execution time profile as a programming tool. Compiler Optimization, Prentice Hall (1972), 107-128.
	10	Knuth D. An empirical study of FORTRAN programs. Software Practice and Experience 1, no. 2 (1971) 105-133.
	11	Lyon G. and R. Stillman. A FORTRAN analyzer. National Bureau of Standards Technical Note 849 (October, 1974).
	12	Morrison J. E. User program performance in virtual storage systems. IBM systems Journal 12, no. 3 (1973) 216-237.
	13	P. G. Moulton , M. E. Muller, DITRAN—a compiler emphasizing diagnostics, Communications of the ACM, v.10 n.1, p.45-52, Jan. 1967 [doi>10.1145/363018.363060]
	14	D. L. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, v.15 n.12, p.1053-1058, Dec. 1972 [doi>10.1145/361598.361623]
	15	Ramamoorthy C. V. and S. B. F. Ho. Testing large software with automated software evaluation systems. IEEE Transactions on Software Engineering SE-1, no. 1 (March, 1975) 46-58.
	16	Saul Rosen , Robert A. Spurgeon , Joel K. Donnelly, PUFFT—The Purdue University fast FORTRAN translator, Communications of the ACM, v.8 n.11, p.661-666, Nov. 1965 [doi>10.1145/365660.365671]
	17	Peter W. Shantz , R. A. German , J. G. Mitchell , R. S. K. Shirley , C. R. Zarnke, WATFOR—The University of Waterloo FORTRAN IV compiler, Communications of the ACM, v.10 n.1, p.41-44, Jan. 1967 [doi>10.1145/363018.363059]
	18	van Emden M. H. The hierarchical decomposition of complexity. Machine Intelligence 5 (1970), 361-380.
	19	Zelkowitz M. PLUM: The University of Maryland PL/1 system. Technical Report TR-318, Computer Science, University of Maryland, July, 1974.

CITED BY 2

	Marvin V. Zelkowitz, Automatic program analysis and evaluation, Proceedings of the 2nd international conference on Software engineering, p.158-163, October 13-15, 1976, San Francisco, California, United States
	Marvin V. Zelkowitz, Perspectives in Software Engineering, ACM Computing Surveys (CSUR), v.10 n.2, p.197-216, June 1978