Journal of the ACM (JACM)
The Generation of Optimal Code for Arithmetic Expressions
Journal of the ACM (JACM)
The Generation of Optimal Code for Stack Machines
Journal of the ACM (JACM)
Register allocation via usage counts
Communications of the ACM
Generation of optimal code for expressions via factorization
Communications of the ACM
Optimal code for serial and parallel computation
Communications of the ACM
The Design of an Optimizing Compiler
The Design of an Optimizing Compiler
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Compiler Construction, An Advanced Course, 2nd ed.
Optimal code generation for expression trees
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A compiler writing system with optimization capabilities for complex object order structures
A compiler writing system with optimization capabilities for complex object order structures
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
The VLSI Design Automation Assistant: Prototype system
DAC '83 Proceedings of the 20th Design Automation Conference
Automatic storage optimization
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Automatic storage optimization
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Comprehensive isomorphic subtree enumeration
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
| Hi-index | 0.00 |
Easy as the task may seem, many compilers generate rather inefficient code. Some of the difficulty of generating good code may arise from the lack of realistic models for programming language and machine semantics. In this paper we show that the computational complexity of generating efficient code in realistic situations may also be a major cause of difficulty in the design of good compilers. We consider the problem of generating optimal code for a set of expressions. If the set of expressions has no common sub-expressions, then a number of efficient optimal code generation algorithms are known for wide classes of machines [SU, AJ, BL].