Compilers: Principles, Techniques, and Tools (精裝) 美國版
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman
- 出版商: Addison Wesley
- 出版日期: 1986-01-01
- 售價: $1,100
- 貴賓價: 9.8 折 $1,078
- 語言: 英文
- 頁數: 796
- 裝訂: Hardcover
- ISBN: 0201100886
- ISBN-13: 9780201100884
-
相關分類:
Compiler
無法訂購
買這商品的人也買了...
-
Computer Organization & Design: The Hardware/Software Interface, 2/e$1,200$1,176 -
計算機組織與設計--軟硬體界面第二版 (Computer Organization & Design, 2/e)$680$537 -
Data Mining: Concepts and Techniques$2,620$2,489 -
$970Introduction to Algorithms, 2/e -
Digital Image Processing, 2/e(IE)(美國版ISBN:0201180758)$1,150$1,127 -
Thinking in Java 中文版 (Thinking in Java, 2/e)$920$727 -
LPI Linux 資格檢定 (LPI Linux Certification in a Nutshell)$880$695 -
$1,274Computer Architecture: A Quantitative Approach, 3/e(精裝本) -
$1,029Operating System Concepts, 6/e (Windows XP Update) -
演算法導論 (Introduction to Algorithms, 2/e)$860$731 -
Cryptography and Network Security Principles and Practices, 3/e$1,030$1,009 -
JavaScript 範例活用辭典$450$351 -
Understanding the Linux Kernel, 2/e (Paperback)$1,860$1,767 -
Sun Certified Programmer & Developer for Java 2 Study Guide, 2/e$1,900$1,805 -
作業系統概念 (Operating System Concepts, 6/e Windows XP Update)$780$741 -
Red Hat Linux 9 實務應用$650$553 -
802.11 無線網路技術通論 (802.11 Wireless Networks: The Definitive Guide)$760$600 -
Dreamweaver MX 互動網站百寶箱 for ASP$580$458 -
ASP.NET 程式設計徹底研究$590$466 -
Red Hat Linux 9 架站實務$620$527 -
STRUTS 實作手冊(Struts in Action: Building Web Applications with the Leading Java Framework)$690$538 -
深入淺出 JBuilder 程式設計實作(JBuilder 9.0/8.0/7.0 適用) (Charlie Calvert's Learn Jbuilder)$720$562 -
重構─改善既有程式的設計$720$569 -
鳥哥的 Linux 私房菜－伺服器架設篇$750$675 -
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560$504
相關主題
商品描述
Description
This introduction to compilers is the direct descendant of the well-known book by Aho and Ullman, Principles of Compiler Design. The authors present updated coverage of compilers based on research and techniques that have developed in the field over the past few years. The book provides a thorough introduction to compiler design and covers topics such as context-free grammars, fine state machines, and syntax-directed translation. 
Table Of Contents
1. Introduction to Compiling. Compilers.
Analysis of the Source Program.
The Phases of a Compiler.
Cousins of the Compiler.
The Grouping of Phases.
Compiler-Construction Tools.
Bibliographic Notes.
Analysis of the Source Program.
The Phases of a Compiler.
Cousins of the Compiler.
The Grouping of Phases.
Compiler-Construction Tools.
Bibliographic Notes.
2. A Simple One-Pass Compiler.
Overview Syntax Definition.
Syntax-Directed Translation.
Parsing.
A Translator for Simple Expressions.
Lexical Analysis.
Incorporating a Symbol Table.
Abstract Stack Machines.
Putting the Techniques Together.
Exercises.
Bibliographic Notes.
Syntax-Directed Translation.
Parsing.
A Translator for Simple Expressions.
Lexical Analysis.
Incorporating a Symbol Table.
Abstract Stack Machines.
Putting the Techniques Together.
Exercises.
Bibliographic Notes.
3. Lexical Analysis.
The Role of the Lexical Analyzer.
Input Buffering.
Specification of Tokens.
Recognition of Tokens.
A Language for Specifying Lexical Analyzers.
Finite Automata.
From a Regular Expression to an NFA.
Design of a Lexical Analyzer Generator.
Optimization of DFA-Based Pattern Matchers.
Exercises.
Bibliographic Notes.
Input Buffering.
Specification of Tokens.
Recognition of Tokens.
A Language for Specifying Lexical Analyzers.
Finite Automata.
From a Regular Expression to an NFA.
Design of a Lexical Analyzer Generator.
Optimization of DFA-Based Pattern Matchers.
Exercises.
Bibliographic Notes.
4. Syntax Analysis.
The Role of the Parser.
Context-Free Grammars.
Writing a Grammar.
Top-Down Parsing.
Bottom-Up Parsing.
Operator-Precedence Parsing.
LR Parsers.
Using Ambiguous Grammars.
Parser Generators.
Exercises.
Bibliographic Notes.
Context-Free Grammars.
Writing a Grammar.
Top-Down Parsing.
Bottom-Up Parsing.
Operator-Precedence Parsing.
LR Parsers.
Using Ambiguous Grammars.
Parser Generators.
Exercises.
Bibliographic Notes.
5. Syntax-Directed Translation.
Syntax-Directed Definitions.
Construction of Syntax Trees.
Bottom-Up Evaluation of S-Attributed Definitions.
L-Attributed Definitions.
Top Down Translation.
Bottom-Up Evaluation of Inherited Attributes.
Recursive Evaluators.
Space for Attribute Values at Compile Time.
Assigning Spaces at Compiler-Construction Time.
Analysis of Syntax-Directed Definitions.
Exercises.
Bibliographic Notes.
Construction of Syntax Trees.
Bottom-Up Evaluation of S-Attributed Definitions.
L-Attributed Definitions.
Top Down Translation.
Bottom-Up Evaluation of Inherited Attributes.
Recursive Evaluators.
Space for Attribute Values at Compile Time.
Assigning Spaces at Compiler-Construction Time.
Analysis of Syntax-Directed Definitions.
Exercises.
Bibliographic Notes.
6. Type Checking.
Type Systems.
Specification of a Simple Type Checker.
Equivalence of Type Expressions.
Type Conversions.
Overloading of Functions and Operators.
Polymorphic Functions.
An algorithm for Unification.
Exercises.
Bibliographic Notes.
Specification of a Simple Type Checker.
Equivalence of Type Expressions.
Type Conversions.
Overloading of Functions and Operators.
Polymorphic Functions.
An algorithm for Unification.
Exercises.
Bibliographic Notes.
7. Run-Time Environments.
Source Language Issues.
Storage Organization.
Storage-Allocation Strategies.
Access to Nonlocal Names.
Parameter Passing.
Symbol Tables.
Language Facilities for Dynamic Storage Allocation.
Dynamic Storage Allocation Techniques.
Storage Allocation in Fortran.
Exercises.
Bibliographic Notes.
Storage Organization.
Storage-Allocation Strategies.
Access to Nonlocal Names.
Parameter Passing.
Symbol Tables.
Language Facilities for Dynamic Storage Allocation.
Dynamic Storage Allocation Techniques.
Storage Allocation in Fortran.
Exercises.
Bibliographic Notes.
8. Intermediate Code Generation.
Intermediate Languages.
Declarations.
Assignment Statements.
Boolean Expressions.
Case Statements.
Backpatching.
Procedure Calls.
Exercises.
Bibliographic Notes.
Declarations.
Assignment Statements.
Boolean Expressions.
Case Statements.
Backpatching.
Procedure Calls.
Exercises.
Bibliographic Notes.
9. Code Generation.
Issues in the Design of a Code Generator.
The Target Machine.
Run-Time Storage Management.
Basic Blocks and Flow Graphs.
Next-Use Information.
A Simple Code Generator.
Register Allocation and Assignment.
The Dag Representation of Basic Blocks.
Peephole Optimization.
Generating Code from Dags.
Dynamic Programming Code-Generation Algorithm.
Code-Generator Generators.
Exercises.
Bibliographic Notes.
The Target Machine.
Run-Time Storage Management.
Basic Blocks and Flow Graphs.
Next-Use Information.
A Simple Code Generator.
Register Allocation and Assignment.
The Dag Representation of Basic Blocks.
Peephole Optimization.
Generating Code from Dags.
Dynamic Programming Code-Generation Algorithm.
Code-Generator Generators.
Exercises.
Bibliographic Notes.
10. Code Optimization.
Introduction.
The Principal Sources of Optimization.
Optimization of Basic Blocks.
Loops in Flow Graphs.
Introduction to Global Data-Flow Analysis.
Iterative Solution of Data-Flow Equations.
Code-Improving Transformations.
Dealing with Aliases.
Data-Flow Analysis of Structured Flow Graphs.
Efficient Data-Flow Algorithms.
A Tool for Data-Flow Analysis.
Estimation of Types.
Symbolic Debugging of Optimized Code.
Exercises.
Bibliographic Notes.
The Principal Sources of Optimization.
Optimization of Basic Blocks.
Loops in Flow Graphs.
Introduction to Global Data-Flow Analysis.
Iterative Solution of Data-Flow Equations.
Code-Improving Transformations.
Dealing with Aliases.
Data-Flow Analysis of Structured Flow Graphs.
Efficient Data-Flow Algorithms.
A Tool for Data-Flow Analysis.
Estimation of Types.
Symbolic Debugging of Optimized Code.
Exercises.
Bibliographic Notes.
11. Want to Write a Compiler?
Planning a Compiler.
Approaches to Compiler Development.
The Compiler-Development Environment.
Testing and Maintenance.
Approaches to Compiler Development.
The Compiler-Development Environment.
Testing and Maintenance.
12. A Look at Some Compilers.
EQN, a Preprocessor for Typesetting Mathematics.
Compilers for Pascal.
The C Compilers.
The Fortran H Compilers.
The Bliss/11 Compiler.
Modula-2 Optimizing Compiler.
Compilers for Pascal.
The C Compilers.
The Fortran H Compilers.
The Bliss/11 Compiler.
Modula-2 Optimizing Compiler.
Appendix: A Compiler Project.
Introduction.
A Pascal Subset.
Program Structure.
Lexical Conventions.
Suggested Exercises.
Evolution of the Interpreter.
Extensions.
A Pascal Subset.
Program Structure.
Lexical Conventions.
Suggested Exercises.
Evolution of the Interpreter.
Extensions.
Bibliography.
Index.
