Compilers
Autor Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullmanen Limba Engleză Paperback – 25 iul 2013
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 537.62 lei 3-5 săpt. | +79.57 lei 7-11 zile |
| Pearson – 25 iul 2013 | 537.62 lei 3-5 săpt. | +79.57 lei 7-11 zile |
| Hardback (1) | 1281.33 lei 3-5 săpt. | |
| Pearson Education – 30 aug 2006 | 1281.33 lei 3-5 săpt. |
Preț: 537.62 lei
Preț vechi: 672.02 lei
-20% Nou
Puncte Express: 806
Preț estimativ în valută:
102.88€ • 108.23$ • 85.18£
102.88€ • 108.23$ • 85.18£
Carte disponibilă
Livrare economică 24 decembrie 24 - 07 ianuarie 25
Livrare express 10-14 decembrie pentru 89.56 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781292024349
ISBN-10: 1292024348
Pagini: 942
Ilustrații: Illustrations (black and white)
Dimensiuni: 218 x 274 x 53 mm
Greutate: 2.29 kg
Ediția:2nd edition. International Edition
Editura: Pearson
Colecția Pearson Higher Education
ISBN-10: 1292024348
Pagini: 942
Ilustrații: Illustrations (black and white)
Dimensiuni: 218 x 274 x 53 mm
Greutate: 2.29 kg
Ediția:2nd edition. International Edition
Editura: Pearson
Colecția Pearson Higher Education
V-ar putea interesa
-
Still LifeSarah WinmanPreț: 85.54 lei -
The Art of Computer Programming: Fundamental AlgorithmsDonald E. Knuth-20%Preț: 471.47 lei589.33 lei -
-20%Preț: 573.23 lei716.53 lei -
The Library at Mount CharScott HawkinsPreț: 100.40 lei -
Katalin StreetMagda Szabo-25%Preț: 52.00 lei69.32 lei -
-27%Preț: 47.11 lei64.18 lei -
A Carnival of SnackeryDavid Sedaris-19%Preț: 75.36 lei93.54 lei -
The Wizard In My ShedSimon Farnaby-21%Preț: 41.09 lei52.29 lei -
-24%Preț: 48.60 lei63.80 lei -
The Last WildPiers Torday-22%Preț: 40.68 lei52.06 lei -
The Wild BeforePiers Torday-24%Preț: 62.96 lei82.79 lei -
Dark Wild: Book 2, ThePiers Torday-21%Preț: 41.78 lei52.70 lei -
Torday, P: Wild BeyondPiers Torday-22%Preț: 40.51 lei51.96 lei -
Mikrocomputerfibel: Vom 8-bit-Chip zum GrundsystemGerhard Schnell-20%Preț: 352.95 lei441.18 lei -
-20%Preț: 427.12 lei533.90 lei -
-20%Preț: 428.09 lei535.10 lei -
-20%Preț: 324.09 lei405.12 lei -
Algebraic SemanticsI. Guessarian-20%Preț: 176.45 lei220.56 lei -
-20%Preț: 410.34 lei512.93 lei -
-20%Preț: 312.85 lei391.06 lei -
-20%Preț: 323.77 lei404.71 lei -
Verifying Concurrent Processes Using Temporal LogicB. T. Hailpern-20%Preț: 321.99 lei402.50 lei -
Axiomatising the Logic of Computer ProgrammingR. Goldblatt-20%Preț: 155.36 lei194.20 lei -
-20%Preț: 233.64 lei292.05 lei -
-20%Preț: 332.50 lei415.63 lei -
An Introduction to the PL/CV2 Programming LogicR. L. Constable-20%Preț: 316.94 lei396.18 lei -
-20%Preț: 303.66 lei379.58 lei -
-20%Preț: 239.82 lei299.78 lei
Cuprins
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
7 Run-Time Environments
7.1 Storage Organization
7.2 Stack Allocation of Space
7.3 Access to Nonlocal Data on the Stack
7.4 Heap Management
7.5 Introduction to Garbage Collection
7.6 Introduction to Trace-Based Collection
7.7 Short-Pause Garbage Collection
7.8 Advanced Topics in Garbage Collection
7.9 Summary of Chapter 7
7.10 References for Chapter 7
8 Code Generation
8.1 Issues in the Design of a Code Generator
8.2 The Target Language
8.3 Addresses in the Target Code
8.4 Basic Blocks and Flow Graphs
8.5 Optimization of Basic Blocks
8.6 A Simple Code Generator
8.7 Peephole Optimization
8.8 Register Allocation and Assignment
8.9 Instruction Selection by Tree Rewriting
8.10 Optimal Code Generation for Expressions
8.11 Dynamic Programming Code-Generation
8.12 Summary of Chapter 8
8.13 References for Chapter 8
9 Machine-Independent Optimizations
9.1 The Principal Sources of Optimization
9.2 Introduction to Data-Flow Analysis
9.3 Foundations of Data-Flow Analysis
9.4 Constant Propagation
9.5 Partial-Redundancy Elimination
9.6 Loops in Flow Graphs
9.7 Region-Based Analysis
9.8 Symbolic Analysis
9.9 Summary of Chapter 9
9.10 References for Chapter 9
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
7 Run-Time Environments
7.1 Storage Organization
7.2 Stack Allocation of Space
7.3 Access to Nonlocal Data on the Stack
7.4 Heap Management
7.5 Introduction to Garbage Collection
7.6 Introduction to Trace-Based Collection
7.7 Short-Pause Garbage Collection
7.8 Advanced Topics in Garbage Collection
7.9 Summary of Chapter 7
7.10 References for Chapter 7
8 Code Generation
8.1 Issues in the Design of a Code Generator
8.2 The Target Language
8.3 Addresses in the Target Code
8.4 Basic Blocks and Flow Graphs
8.5 Optimization of Basic Blocks
8.6 A Simple Code Generator
8.7 Peephole Optimization
8.8 Register Allocation and Assignment
8.9 Instruction Selection by Tree Rewriting
8.10 Optimal Code Generation for Expressions
8.11 Dynamic Programming Code-Generation
8.12 Summary of Chapter 8
8.13 References for Chapter 8
9 Machine-Independent Optimizations
9.1 The Principal Sources of Optimization
9.2 Introduction to Data-Flow Analysis
9.3 Foundations of Data-Flow Analysis
9.4 Constant Propagation
9.5 Partial-Redundancy Elimination
9.6 Loops in Flow Graphs
9.7 Region-Based Analysis
9.8 Symbolic Analysis
9.9 Summary of Chapter 9
9.10 References for Chapter 9
Descriere
Descriere de la o altă ediție sau format:
Compilers: Principles, Techniques and Tools, known to professors, students, and developers worldwide as the "Dragon Book," is available in a new edition. 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.
New chapters include:
Chapter 10 Instruction-Level Parallelism
Chapter 11 Optimizing for Parallelism and Locality
Chapter 12 Interprocedural Analysis
Compilers: Principles, Techniques and Tools, known to professors, students, and developers worldwide as the "Dragon Book," is available in a new edition. 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.
New chapters include:
Chapter 10 Instruction-Level Parallelism
Chapter 11 Optimizing for Parallelism and Locality
Chapter 12 Interprocedural Analysis
Notă biografică
Alfred V. Aho is Lawrence Gussman Professor of Computer Science at Columbia University. Professor Aho has won several awards including the Great Teacher Award for 2003 from the Society of Columbia Graduates and the IEEE John von Neumann Medal. He is a member of the National Academy of Engineering and a fellow of the ACM and IEEE.
Monica S. Lam is a Professor of Computer Science at Stanford University, was the Chief Scientist at Tensilica and the founding CEO of moka5. She led the SUIF project which produced one of the most popular research compilers, and pioneered numerous compiler techniques used in industry.
Ravi Sethi launched the research organization in Avaya and is president of Avaya Labs. Previously, he was a senior vice president at Bell Labs in Murray Hill and chief technical officer for communications software at Lucent Technologies. He has held teaching positions at the Pennsylvania State University and the University of Arizona, and has taught at Princeton University and Rutgers. He is a fellow of the ACM.
Jeffrey Ullman is CEO of Gradiance and a Stanford W. Ascherman Professor of Computer Science at Stanford University. His research interests include database theory, database integration, data mining, and education using the information infrastructure. He is a member of the National Academy of Engineering, a fellow of the ACM, and winner of the Karlstrom Award and Knuth Prize.
Monica S. Lam is a Professor of Computer Science at Stanford University, was the Chief Scientist at Tensilica and the founding CEO of moka5. She led the SUIF project which produced one of the most popular research compilers, and pioneered numerous compiler techniques used in industry.
Ravi Sethi launched the research organization in Avaya and is president of Avaya Labs. Previously, he was a senior vice president at Bell Labs in Murray Hill and chief technical officer for communications software at Lucent Technologies. He has held teaching positions at the Pennsylvania State University and the University of Arizona, and has taught at Princeton University and Rutgers. He is a fellow of the ACM.
Jeffrey Ullman is CEO of Gradiance and a Stanford W. Ascherman Professor of Computer Science at Stanford University. His research interests include database theory, database integration, data mining, and education using the information infrastructure. He is a member of the National Academy of Engineering, a fellow of the ACM, and winner of the Karlstrom Award and Knuth Prize.
Caracteristici
- Introduces the theory and practice of compiler design.
- Covers topics like context-free grammars, fine state machines, and syntax-directed translation.
Caracteristici noi
- All new chapter on Interprocedural analysis, written by world-renowned computer scientist, Monica S. Lam.
- Presents the Five Methods for Translation to explain syntax-directed translation.
- Illustrates new techniques for data-flow analysis that emphasize the unity of code optimization and other program analysis software.
- Uses code optimization to work with parallel machines.
- Explains just-in-time compiling with programming languages such as Java.
- Discusses garbage collection.
- Brings all new material together through new case studies.
- Includes additional practice and tests comprehension of important concepts with Gradiance an online homework and tutorial system.