This new, expanded 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 are missing from most books. In addition, more advanced chapters are now included so that it can be used as the basis for a two-semester or graduate course. 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 C header files. 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 includes the advanced chapters, covers the compilation of object-oriented and functional languages, garbage collection, loop optimizations, SSA form, loop scheduling, and optimization for cache-memory hierarchies.
Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual C header files. The first part of the book, Fundamentals of Compilation, is suitable for a one-semester first course in compiler design.
Peyton Jones, S. and Partain, W. 1993. Measuring the effectiveness of a simple strictness analyser. In Functional Programming: Glasgow 1993, K. Hammond and M. O'Donnell, Eds. Springer Workshops in Computer Science.
A unique feature of the book is a well-designed compiler implementation project in C, including front-end and 'high-tech' back-end phases, so that students can build a complete working compiler in one semester.
This new edition has been extensively rewritten to include more discussion of Java and object-oriented programming concepts, such as visitor patterns.
... meant to beindependent of any source language; also,the logical operators might beused in implementing other features of MiniJava. MEM(e) The contentsof wordSize bytes of memory starting at address e(where wordSizeis defined in the ...
The student who has finished this book can expect to understand the workings of and add to a language processor for each of the modern paradigms, and be able to read the literature on how to proceed.
A unique feature of the book is a well designed compiler implementation project in Java, including front-end and 'high-tech' back-end phases, so that students can build a complete working compiler in one semester.
This book provides a practically-oriented introduction to high-level programming language implementation.
[339] W. Waite, G. Goos, Compiler Construction, Springer-Verlag, New York, 1984. ... [345] B.W. Watson, A fast and simple algorithm for constructing minimal acyclic deterministic finite automata, J. Univers. Comput. Sci.
This is the first book to show how concepts from the theory of programming languages can be applied to the producton of practical optimising compilers for modern languages like ML. This book will be essential reading for compiler writers in ...