Modern Compiler Implementation in ML
This textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that is missing from most books. The most accepted and successful techniques are described in a concise way, rather than as an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual ML signatures. The first part of the book, Fundamentals of Compilation, is suitable for a one-semester first course in compiler design. The second part, Advanced Topics, which include SSA form, loop scheduling, pipelining, and optimization for cache-memory hierarchies, can be used as the basis for a second semester or graduate course. A unique feature of the book is a well designed compiler implementation project in ML, including front-end and "high-tech" back-end phases, so that students can build a complete working compiler in one semester. Accompanying support software is available.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Translation to Intermediate Code
Basic Blocks and Traces
Functional Programming Languages
Static SingleAssignment Form
Pipelining and Scheduling
The Memory Hierarchy
Other editions - View all
0-function abstract syntax Absyn algorithm argument array assembly language assignment basic blocks BINOP cache coalescing color compute CONST containing copy copy propagation cycle data structure dataflow dataflow analysis declaration definition delete depth-first depth-first search described descriptor dominance frontier dominator edge error ESEQ evaluation example executed fetch field Figure flow graph formal parameter function call garbage collection goto grammar graph coloring implement induction variable inline expansion input integer iteration label let function lexical analyzer liveness analysis loop loop-invariant machine Maximal Munch memory module move instructions munchExp nested node nonterminal operands optimization parse tree parser parsing table Poly-Tiger polymorphic precolored prefetch procedure programming language record recursive register allocation regular expressions representation result scheduling semantic actions shift spill stack frame statement static link string symbol TEMP temporary tile tion to-space token Translate type-checking work-list