Advanced Compiler Design Implementation
From the Foreword by Susan L. Graham:
This book takes on the challenges of contemporary languages and architectures, and prepares the reader for the new compiling problems that will inevitably arise in the future.
The definitive book on advanced compiler design
This comprehensive, up-to-date work examines advanced issues in the design and implementation of compilers for modern processors. Written for professionals and graduate students, the book guides readers in designing and implementing efficient structures for highly optimizing compilers for real-world languages. Covering advanced issues in fundamental areas of compiler design, this book discusses a wide array of possible code optimizations, determining the relative importance of optimizations, and selecting the most effective methods of implementation.
* Lays the foundation for understanding the major issues of advanced compiler design
* Treats optimization in-depth
* Uses four case studies of commercial compiling suites to illustrate different approaches to compiler structure, intermediate-code design, and optimization-these include Sun Microsystems's compiler for SPARC, IBM's for POWER and PowerPC, DEC's for Alpha, and Intel's for Pentium an related processors
* Presents numerous clearly defined algorithms based on actual cases
* Introduces Informal Compiler Algorithm Notation (ICAN), a language devised by the author to communicate algorithms effectively to people
What people are saying - Write a review
User Review - Flag as inappropriate
Introduction to Advanced Topics 1
Informal Compiler Algorithm Notation ICAN
Producing Code Generators Automatically
e13 Redundancy Elimination
a 17 Code Scheduling
ControlFlow and LowLevel Optimizations
Interprocedural Analysis and Optimization
Optimization for the Memory Hierarchy
9 Dependence Analysis and Dependence Graphs
List of Tables
algorithm alias alias analysis aliasing approach assignment basic block begin bit vectors Block[m boolean branch bset code in Figure common-subexpression elimination compiler compute conditional constant propagation constant folding constant propagation construct control-flow copy propagation data structures data-flow analysis data-flow information dead-code elimination defined definition dependence depth-first determine discussed edges entry evaluation example execution exit expression false flow functions flow-sensitive flowgraph in Figure follows fotr global goto L1 graph coloring ICAN implement improper region induction variable inst instruction integer intermediate code interprocedural iteration Kkind label language lattice loop-invariant code motion MIRInst nested ninsts opd1 opd2 operands operations optimizations PA-Risc partial-redundancy elimination path perform pointer procedure reduce register allocation result returns true routine scheduling Section sequence set of Node shown in Figure software pipelining Sparse conditional constant stack strength reduction subexpression Succ symbolic registers Tail-call optimization transformations tree value numbering worklist
Page 810 - Hummel, and A. Nicolau. A general data dependence test for dynamic, pointer-based data structures. In Proceedings of the SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 218-229, June 1994.
Page 804 - 89 Conference on Programming Language Design and Implementation.  Preston Briggs. Register Allocation via Graph Coloring. PhD thesis, Rice University, April 1992.  Preston Briggs, Keith D. Cooper, Ken Kennedy, and Linda Torczon. Coloring heuristics for register allocation.
Page 802 - Proc. Symp. on Architectural Support for Programming Languages and Operating Systems (Palo Alto, Calif., March 1-3, 1982), ACM, New York, NY, 1982.
Page 808 - ... interface for ANSI C. Software — Practice and Experience, 21(9):963-988, September 1991. [FH91b] Christopher W. Fraser and Robert R. Henry. Hard-coding bottom-up code generation tables to save time and space. Software — Practice and Experience, 21(1):1-12, January 1991. [FHP91] Christopher W. Fraser, Robert R. Henry, and Todd A. Proebsting. BURG — fast optimal instruction selection and tree parsing. Technical Report 1066, University of Wisconsin, 1991. [Han90] David R. Hanson. Fast allocation...
Page 805 - Robert F. Cmelik and David Keppel. Shade: A Fast InstructionSet Simulator for Execution Profiling.
Page 805 - ASPLOS, 1992.  WY Chen, SA Mahlke, PP Chang, and WW Hwu, "Data Access Microarchitectures for Superscalar Processors with Compiler-Assisted Data Prefetching", Proc. of 25th MICRO, 1991.  C. Chi and H. Dietz, 'Unified Management of Registers and Cache Using Liveness and Cache Bypass", Proc.
All Book Search results »