Affiliation:
1. Bell Laboratories, Murray Hill, New Jersey
Abstract
This paper discusses algorithms which transform expression trees into code for register machines. A necessary and sufficient condition for optimality of such an algorithm is derived, which applies to a broad class of machines. A dynamic programming algorithm is then presented which produces optimal code for any machine in this class; this algorithm runs in time linearly proportional to the size of the input.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference15 articles.
1. AHO A V HOPCROFT J E AND ULLMAN J D The Destgn and Analysts of Computer Algorithms Addison-Wesley Reading Mass 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Destgn and Analysts of Computer Algorithms Addison-Wesley Reading Mass 1974
2. Optimization of Straight Line Programs
3. An axiomatic approach to code optimization for expressions
4. The Generation of Optimal Code for Stack Machines
5. Code Generation for a One-Register Machine
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Source Matching and Rewriting for MLIR Using String-Based Automata;ACM Transactions on Architecture and Code Optimization;2023-03
2. Bibliography;Engineering a Compiler;2023
3. Instruction Selection;Engineering a Compiler;2023
4. Code Shape;Engineering a Compiler;2023
5. Reimplementing the Wheel: Teaching Compilers with a Small Self-Contained One;Electronic Proceedings in Theoretical Computer Science;2022-07-26