Abstract
We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N > 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.
Original language | English (US) |
---|---|
Pages | 86-100 |
Number of pages | 15 |
DOIs | |
State | Published - Jul 27 1970 |
Event | 1970 Symposium on Compiler Optimization - Urbana-Champaign, United States Duration: Jul 27 1970 → Jul 28 1970 |
Other
Other | 1970 Symposium on Compiler Optimization |
---|---|
Country/Territory | United States |
City | Urbana-Champaign |
Period | 7/27/70 → 7/28/70 |
ASJC Scopus subject areas
- Hardware and Architecture