Affiliation:
1. Univ. of Illnois, Urbana
Abstract
A three-pass compiler with the following properties is briefly described: The last two passes scan an intermediate language produced by the preceding pass in essentially the reverse of the order in which it was generated, so that the first pass is the only one which has to read the relatively bulky problem-oriented input. The double scan, one in either direction, performed by the first two passes, allows the compiler to remove locally constant expressions and recursively calculable expressions from loops and to do the important part of common subexpression recognition. Optimization such as the effective use of index registers, although as important, is not discussed since the object code which would be most efficient is highly machine dependent. The discussion is in terms of a FORTRAN-like language, although the technique is applicable to most algebraic languages.
Publisher
Association for Computing Machinery (ACM)
Reference5 articles.
1. An algorithm for coding efficient arithmetic operations
2. Optimization of the Address Field Compilation in the ILLIAC 2 Assembler
3. IBM. Systems Manual for 704 FORTRAN and 709 FORTRAN Appl. Programming Dept. IBM April 1960. IBM. Systems Manual for 704 FORTRAN and 709 FORTRAN Appl. Programming Dept. IBM April 1960.
4. Sequential formula translation
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Commutative operand alignment for interconnect optimization in behavioural synthesis;International Journal of Electronics;1992-08
2. Optimization of structured programs;Software: Practice and Experience;1974-01
3. Optimization;Lecture Notes in Computer Science;1974
4. Local optimizations;ACM SIGPLAN Notices;1970-07
5. Optimization of expressions in Fortran;Communications of the ACM;1969-12