编译原理(英文版.第2版)(享有“龙书”的美誉，编译领域无可替代的经典著作)

书籍
计算机书籍
　　本书是编译领域无可替代的经典著作，被广大计算机专业人士誉为“龙书”。本书上一版自1986年出版以来，被世界各地的著名高等院校和研究机构（包括美国哥伦比亚大学、斯坦福大学、哈佛大学、普林斯顿大学、贝尔实验室）作为本科生和研究生的编译原理课程的教材。该书对我国高等计算机教育领域也产生了重大影响。
　　第2版对每一章都进行了全面的修订，以反映自上一版出版20多年来软件工程。程序设计语言和计算机体系结构方面的发展对编译技术的影响。本书全面介绍了编译器的设计，并强调编译技术在软件设计和开发中的广泛应用。每章中都包含大量的习题和丰富的参考文献。
　　本书适合作为高等院校计算机专业本科生和研究生的编译原理与技术课程的教材，也可供广大计算机技术人员参考。
　　 cd中包含如下内容：
　　 ·comptia project+考试模拟题。
　　 ·作者的项目管理培训视频。
　　 ·项目管理工作表和模板。
　　

1 introduction
1.1 language processors
1.2 the structure of a compiler
1.3 the evolution of programming languages
1.4 the science of building a compiler
1.5 applications of compiler technology
1.6 programming language basics
1.7 summary of chapter 1
1.8 references for chapter 1
2 a simple syntax-directed translator
2.1 introduction
2.2 syntax definition
2.3 syntax-directed translation
2.4 parsing
2.5 a translator for simple expressions
2.6 lexical analysis
2.7 symbol tables
2.8 intermediate code generation
2.9 summary of chapter 2
3 lexical analysis

　　In the time since the 1986 edition of this book, the world of compiler design has changed significantly. Programming languages have evolved to present new compilation problems. Computer architectures offer a variety of resources of which the compiler designer must take advantage. Perhaps most interestingly,the venerable technology of code optimization has found use outside compilers.It is now used in tools that find bugs in software, and most importantly, find security holes in existing code. And much of the "front-end" technology -grammars, regular expressions, parsers, and syntax-directed translators -- are still in wide use.
　　Thus, our philosophy from previous versions of the book has not changed.We recognize that few readers will build, or even maintain, a compiler for a major programming language. Yet the models, theory, and algorithms associ-ated with a compiler can be applied to a wide range of problems in software design and softwarc development. We therefore emphasize problems that are most commonly encountered in designing a' language processor, regardless of the source language or target machine.
　　Use of the Book
　　It takes at least two quarters or even two semesters to cover all or most of the material in this book. It is common to cover the first half in an undergraduate course and the second half of the book -- stressing code optimization in a second course at the graduate or mezzanine level. Here is an outline of the chapters:
　　Chapter 1 contains motivational material and also presents some background issues in computer architecture and programming-language principles.
　　Chapter 2 develops a miniature compiler and introduces many of the impor-tant concepts, which are then developed in later chapters. The compiler itself appears in the appendix.
　　Chapter 3 covers lexical analysis, regular expressions, finite-state machines, and scanner-generator tools. This material is fundamental to text-processing of all sorts.
　　Chapter 4 covers the major parsing methods, top-down (recursive-descent, LL)and bottom-up (LR and its variants).
　　Chapter 5 introduces the principal ideas in syntax-directed definitions and syntax-directed translations.
　　Chapter 6 takes the theory of Chapter 5 and shows how to use it to generate intermediate code for a typical programming language.
　　Chapter 7 covers run-time environments, especially management of the run-thne stack and garbage collection.
　　Chapter 8 is on object-code generation. It covers construction of basic blocks,generation of code from expressions and basic blocks, and register-allocation techniques.
　　Chapter 9 introduces the technology of code optimization, including flow graphs,data-flow frameworks, and iterative algorithms for solving these frameworks.
　　Chapter 10 covers instruction-level optimization. The emphasis is on the ex-traction of parallelism from small sequences of instructions and scheduling them on single processors that can do more than one thing at once.
　　Chapter 11 talks about larger-scale parallelism detection and exploitation. Here,the emphasis is on numeric codes that have many tight loops that range over multidimensional arrays.
　　Chapter 12 is on interprocedural analysis. It covers pointer analysis, aliasing,and data-flow analysis that takes into account the sequence of procedure calls that reach a given point in the code.
　　Courses from material iii this book have been taught at Columbia, Harvard,and Stanford. At Columbia, a senior/first-year graduate course on program-ming languages and translators has been regularly offered using material from the first eight chapters. A highlight of this course is a semester-long project in which students work in small teams to create and implement a little lan-guage of their own design. The student-created languages have covered diverse application domains including quantum computation, music synthesis, com-puter graphics, gaming, matrix operations and many other areas. Students use compiler-component generators such as ANTLR, Lex, and Yacc and the syntax-directed translation techniques discussed in chapters two and five to build their compilers. A follow-on graduate course has focused on material in Chapters 9 through 12, emphasizing code generation and optimization for contemporary machines including network processors and multiprocessor architectures.
　　At Stanford, a one-quarter introductory course covers roughly the mate-rial in Chapters I through 8, although there is an introduction to global code optimization from Chapter 9. The second compiler course covers Chapters 9 through 12, plus the more advanced material on garbage collection from Chap-ter 7. Students use a locally developed, Java-based system called Joeq for implementing data-flow analysis algorithms.
　　Prerequisites
　　The reader should possess some "computer-science sophistication," including at least a second course on programming, and courses in data structures and discrete mathematics. Knowledge of several different programming languages is useful.