编译原理是计算机专业的一门重要专业课，旨在介绍编译程序构造的一般原理和基本方法。教育部要求高等院校的部分专业课须采用全英文教学，故本书为全英文教材。本书全面、深入地探讨了编译器设计方面的重要主题，包括词法分析、语法分析、语法制导定义和语法制导翻译、运行时刻环境、目标代码生成、代码优化技术、并行性检测以及过程间分析技术，涵盖了编译器开发方面的全新进展，并在相关章节中给出大量的实例，每章中都提供了大量的系统及参考范例。

Chapter 1 Overview of Compilation
1.1 Introduction
1.2 The Structure of a Compiler
1.3 The Compiler Framework of Huawei Kunpeng Processor
1.4 Summary
1.5 Exercises
Chapter 2 Context-Free Grammar
2.1 The Definition of a Context—Free Grammar
2.2 Derivations
2.3 Parse Trees
2.4 Ambiguity
2.5 Eliminating Ambiguity
2.6 Context-Free Language
2.7 Designing a Context-Free Grammar
2.8 Regular Grammar
2.9 Non—Context—Free Language Constructs
2.10 Chomsky Hierarchy
2.11 Summary
2.12 Exercises
Chapter 3 Lexical Analysis
3.1 The Scanning Process
3.2 Regular Expressions
3.3 Transition Diagrams
3.4 Finite Automata
3.4.1 Nondeterministic Finite Automata
3.4.2 Deterministic Finite Automata
3.5 From Regular Expressions to Automata
3.5.1 Construction of an NFA from a Regular Expression
3.5.2 Conversion of an NFA to a DFA
3.5.3 Minimizing the Number of States of a DFA
3.6 Regular Grammars and Regular Expressions
3.7 Summary
3.8 Exercises
Chapter 4 Syntax Analysis
4.1 The Parsing Process
4.2 LL(1)Parsing
4.2.1 Elimination of Left Recursion
4.2.2 Left Factoring
4.2.3 Computing FIRST and FOLLOW Sets
4.2.4 Constructing LL(1)Parsing Tables
4.2.5 LL(1)Parser
4.2.6 Error Recovery in LL(1)Parsing
4.3 LR Parsing
4.3.1 LR(0、Automaton
4.3.2 The LR—Parsing Algorithm
4.3.3 Constructing SLR—Parsing Tables
4.3.4 Constructing LR(1)Parsing Tables
4.3.5 Constructing LALR Parsing Tables
4.3.6 Using Ambiguous Grammars
4.3.7 Error Recovery in LR Parsing
4.4 Hierarch of Grammar Classes
4.5 Summary
4.6 Exercose
Chapter 5 Syntax-Directed Translation
5.1 Attributes and Attributes Grammars
5.2 Evaluation Methods for Syntax-Directed Definitions
5.2.1 Dependency Graphs
5.2.2 Evaluation Orders of Attributes
5.3 Syntax—Directed Translation Schemes
5.4 Symbol Tables
5.4.1 The Structure of the Symbol Table
5.4.2 Scope Rules and Block Structure
5.5 Summary
5.6 Exercises
Chapter 6 Intermediate-Code Generation
6.1 Three.Address Code
6.2 Translation of Expressions
6.2.1 Operations Within Expressions
6.2.2 Incremental Translation
6.2.3 Addressing Array Elements
6.2.4 Translation of Array References
6.3 Type Checking
6.4 Control Flow
6.4.1 Boolean Expressions
6.4.2 Translation of Boolean Operators into Jumps
6.4.3 Translation 0f Boolean Operators into Boolean Valu
6.4.4 Flow—of.Control Statements
6.4.5 Contr01.Flow Translation of Boolean Expressions
6.5 Backpatching
6.5.1 Code Generation Using Backpatching
6.5.2 Backpatching for Boolean Expressions
6.5.3 Flow.of-Control Statements
6.5.4 Break，Continue，and Goto—Statements
6.6 Switch—Statements
6.6.1 Translation of Switch—Statements
6.6.2 Syntax—Directed Translation of Switch-Statements
6.7 Summary
6.8 Exercises
Chapter 7 Runtime Environments
7.1 Storage Organization
7.2 Stack Allocation of Space
7.2.1 Activation Records
7.2.2 Calling Sequences
7.2.3 Dealing with Variable-Length Data Oil the Stack
7.3 Access to Nonlocal Data on the Stack
7.4 Heap Management
7.4.1 The Memory Manager
7.4.2 The Memory Hierarchy of a Computer
7.4.3 Locality in Programs
7.4.4 Reducing Fragmentation
7.5 Parameter Passing Mechanisms
7.5.1 Call—by—Value
7.5.2 Call.by.Reference
7.5.3 Call-by-Name
7.5.4 Aliasing
7.6 Summary
7.7 Exercises
Chapter 8 Code Optimizations
8.1 Basic Blocks and Control—Flow Graphs
8.1.1 Basic Blocks
8.1.2 Control-Flow Graphs
8.2 Overview of Optimization
8.3 Optimization of Basic Blocks
8.3.1 The DAG Representation of Basic Blocks
8.3.2 Finding Local Common Subexpressions
8.3.3 Dead Co