Compilers: Principles, Techniques, and Tools (Subscription), 2nd Edition
- By Alfred V. Aho, Jeffrey D. Ullman, Ravi Sethi, Monica S. Lam
- Published Nov 21, 2011 by Pearson.
eBook (Adobe DRM)
- Your Price: $94.99
- About Adobe DRM eBooks
- Install the free Adobe Digital Editions software on your machine. Adobe Digital Editions only works on Macintosh and Windows, and requires the Adobe Flash Player. Please see the official system requirements.
- Authorize your copy of Adobe Digital Editions using your Adobe ID (select AdobeID as the eBook vendor). If you don't already have an Adobe ID, you can create one here.
This eBook requires the free Adobe® Digital Editions software.
Before downloading this DRM-encrypted PDF, be sure to:
About
Features
Hallmark features of this title
- Introduces the theory and practice of compiler design.
- Covers topics like context-free grammars, fine state machines, and syntax-directed translation.
Description
- Copyright 2012
- Pages: 1040
- Edition: 2nd
- eBook (Adobe DRM)
- ISBN-10: 0-13-300214-4
- ISBN-13: 978-0-13-300214-0
Compilers: Principles, Techniques and Tools (known to professors, students and developers worldwide as the Dragon Book") has been fully revised in its 2nd Edition to reflect developments in software engineering, programming languages, and computer architecture. As few readers will ever go on to construct a compiler, the authors retain their focus on the broader set of problems faced in software design and software development. New chapters include Instruction-Level Parallelism (Ch. 10), Optimizing for Parallelism and Locality (Ch. 11), and Interprocedural Analysis (Ch. 12). More resources are found at dragonbook.stanford.edu.
Sample Content
Table of Contents
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
3.1 The Role of the Lexical Analyzer
3.2 Input Buffering
3.3 Specification of Tokens
3.4 Recognition of Tokens
3.5 The Lexical-Analyzer Generator Lex
3.6 Finite Automata
3.7 From Regular Expressions to Automata
3.8 Design of a Lexical-Analyzer Generator
3.9 Optimization of DFA-Based Pattern Matchers
3.10 Summary of Chapter 3
3.11 References for Chapter 3
4 Syntax Analysis
4.1 Introduction
4.2 Context-Free Grammars
4.3 Writing a Grammar
4.4 Top-Down Parsing
4.5 Bottom-Up Parsing
4.6 Introduction to LR Parsing: Simple LR
4.7 More Powerful LR Parsers
4.8 Using Ambiguous Grammars
4.9 Parser Generators
4.10 Summary of Chapter 4
4.11 References for Chapter 4
5 Syntax-Directed Translation
5.1 Syntax-Directed Definitions
5.2 Evaluation Orders for SDD's
5.3 Applications of Syntax-Directed Translation
5.4 Syntax-Directed Translation Schemes
5.5 Implementing L-Attributed SDD's
5.6 Summary of Chapter 5
5.7 References for Chapter 5
6 Intermediate-Code Generation
6.1 Variants of Syntax Trees
6.2 Three-Address Code
6.3 Types and Declarations
6.4 Translation of Expressions
6.5 Type Checking
6.6 Control Flow
6.7 Backpatching
6.8 Switch-Statements
6.9 Intermediate Code for Procedures
6.10 Summary of Chapter 6
6.11 References for Chapter 6
More Information
Other Things You Might Like
