Estimated by Fri, 9 May - Fri, 16 MayEstimated delivery Fri, 9 May - Fri, 16 May
Returns:
30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount. Policy depends on postage service.
Condition:
NewNew
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 been 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. 0201100886B04062001
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherAddison-Wesley Longman, Incorporated
ISBN-100201100886
ISBN-139780201100884
eBay Product ID (ePID)70824
Product Key Features
Number of Pages500 Pages
LanguageEnglish
Publication NameCompilers : Principles, Techniques, and Tools
SubjectSystems Architecture / General, Compilers
Publication Year1986
TypeTextbook
Subject AreaComputers
AuthorJeffrey D. Ullman, Alfred V. Aho, Ravi Sethi
FormatHardcover
Dimensions
Item Height1.3 in
Item Weight41.8 Oz
Item Length9.4 in
Item Width6.6 in
Additional Product Features
Intended AudienceCollege Audience
LCCN85-015647
Dewey Edition22
Dewey Decimal005.453
Table Of Content1. 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. 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. 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. 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. 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. 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. 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. 8. Intermediate Code Generation. Intermediate Languages. 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. 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. 11. Want to Write a Comp
SynopsisThis 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 been 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. 0201100886B04062001, This book provides the foundation for understanding the theory and pracitce of compilers. Revised and updated, it reflects the current state of compilation. Every chapter has been completely revised to reflect developments in software engineering, programming languages, and computer architecture that have occurred since 1986, when the last edition published.& The authors, recognizing that few readers will ever go on to construct a compiler, retain their focus on the broader set of problems faced in software design and software development. Computer scientists, developers, & and aspiring students that want to learn how to build, maintain, and execute a compiler for a major programming language.
If you need to learn the internals of compilers and the available tools and techniques for writing new programming languages, this book is for you. It is a bit dated, but still covers all necessary foundations to understand the inner magic of lexical analysis, grammars, parsing, intermediate representations and so on. Much recommended!