|
ABSTRACT
This paper describes an intermediate language to be generated by a syntax analyzer and processed by a code generator. An (essentially) optional code optimization phase may be used before code generation. The language is designed to exclude source and target dependencies (these are specified in a set of auxiliary tables) and has been used to implement a general purpose code optimization module. This module has been incorporated into compilers for several source languages and has resulted in production-quality target code. The paper focuses on the features of the language and reviews the optimizations for which it has been designed. A major benefit of this approach has been to isolate many of the characteristics which lead to code optimization opportunities. Of particular note are numerous facts which can be gathered in a target-independent manner, even though their utilization will depend on the details of the target 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
|
Allen, Frances E., "Program Optimization" in Annual Review in Automatic Programming, ed. Mark I. Halpern and Christopher J. Shaw. Vol. V. Oxford: Pergamon Press, 1969, 239-307.
|
 |
2
|
|
| |
3
|
|
| |
4
|
Earnest, C. P., "Some Topics in Code Optimization," Computer Sciences Corporation, 1969.
|
 |
5
|
|
| |
6
|
|
| |
7
|
Halstead, Maurice, "Machine Independence and Third Generation Computers" in Proceedings of the Fall Joint Computer Conference. Washington: Thompson Books, 1967, 587-592.
|
 |
8
|
|
 |
9
|
|
 |
10
|
Sam F. Mendicino , Robert A. Hughes , Jeanne T. Martin , Frank H. McMahon , John E. Ranelletti , Richard G. Zwakenberg, The LRLTRAN compiler, Communications of the ACM, v.11 n.11, p.747-755, Nov. 68
[doi> 10.1145/364139.364154]
|
| |
11
|
Rustin, Randall (ed.), Design and Optimization of Compilers. Englewood Cliffs, N. J.: Prentice Hall, 1972.
|
| |
12
|
Tarjan, Robert E., "Complexity of Combinatorial Algorithms," SIAM Review, XX (July, 1978), 457-491.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|