編譯原理(英文版.第2版)(享有“龍書”的美譽，編譯領域無可替代的經典著…|197632 下載 mobi epub pdf 電子書 2024

☆☆☆☆☆
簡體網頁||繁體網頁

美 Alfred V Aho，Mo 著

下載链接在页面底部

點擊這裡下載

想要找書就要到圖書大百科

book.teaonline.club

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

發表於2024-11-24

類似圖書點擊查看全場最低價

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

圖書介紹

店鋪：互動齣版網圖書專營店

齣版社：機械工業齣版社

ISBN：9787111326748

商品編碼：11257824975

叢書名：經典原版書庫

齣版時間：2011-01-01

頁數：1009

圖書描述

書[0名0]：	編譯原理(英文版.[0第0]2版)(享有“龍書”的美譽，編譯[0領0]域無可替代的經典著作)\|197632
圖書定價：	78元
圖書作者：	(美)Alfred V. Aho; Monica S. Lam; Ravi Sethi; Jeffrey D. Ullman
齣版社：	機械工業齣版社
齣版日期：	2011/1/1 0:00:00
ISBN號：	9787111326748
開本：	32開
頁數：	1009
版次：	2-1

作者簡介

Alfred V．Aho，美[0國0]歌倫比亞[0大0][0學0]教授，美[0國0][0國0]傢工程院院士，ACM和IEEE[0會0]士，曾獲得IEEE的馮·諾伊曼奬。著有多部算[0法0]、數據結構、編譯器、數據庫係統及計算機科[0學0]基礎方麵的著作。 Monica S．Lam，斯坦福[0大0][0學0]計算機科[0學0]係教授，曾任Tensilica的[0首0]席科[0學0]傢，也是Moka5的[0首0]任CEO。曾經主持SUIF項目，該項目産生瞭流行的研究用編譯器之一。 Ravi Sethi，Avaya實驗室總裁，曾任貝爾實驗室高級副總裁和Lucent Tech[0no0]logies通信軟件的CTO。他曾在賓夕[0法0]尼亞州立[0大0][0學0]，亞利桑那州立[0大0][0學0]和普林斯頓[0大0][0學0]任教，是ACM[0會0]士。 Jefirey D．Ullman斯坦福[0大0][0學0]計算機科[0學0]係教授和Gradiance CEO。他的研究興趣包括數據庫理論、數據庫集成、數據挖掘和利用信息基礎設施教[0學0]等。他是美[0國0][0國0]傢工程[0學0]院院士、IEEE[0會0]士，獲得過ACM的Karlstrom傑齣教育奬和Knuth奬。

內容簡介

本書是編譯[0領0]域無可替代的經典著作，被廣[0大0]計算機專業人士譽為“龍書”。本書上一版自1986年齣版以來，被世界各地的著[0名0]高等院校和研究機構（包括美[0國0]哥倫比亞[0大0][0學0]、斯坦福[0大0][0學0]、哈佛[0大0][0學0]、普林斯頓[0大0][0學0]、貝爾實驗室）作為本科生和研究生的編譯原理課程的教材。該書對我[0國0]高等計算機教育[0領0]域也産生瞭重[0大0]影響。
[0第0]2版對每一章都進行瞭全麵的修訂，以反映自上一版齣版20多年來軟件工程。程序設計語言和計算機體係結構方麵的發展對編譯技術的影響。本書全麵介紹瞭編譯器的設計，並強調編譯技術在軟件設計和開發中的廣泛應用。每章中都包含[0大0]量的習題和豐富的參考文獻。
本書適閤作為高等院校計算機專業本科生和研究生的編譯原理與技術課程的教材，也可供廣[0大0]計算機技術人員參考。
CD中包含如下內容：
·CompTIA Project+考試模擬題。
·作者的項目管理培訓視頻。
·項目管理工作錶和模闆。

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 Tech[0no0]logy
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 hnplementing 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 [0No0]nlocal 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 m 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
10 Instruction-Level Par[0all0]elism
10.1 Processor Architectures
10.2 Code-Scheduling Constraints
10.3 Basic-Block Scheduling
10.4 Global Code Scheduling
10.5 Software Pipelining
10.6 Summary of Chapter 10
10.7 References for Chapter 10
11 Optimizing for Par[0all0]elism and Locality
11.1 Basic Concepts
11.2 Matrix Multiply: An In-Depth Example
11.3 Iteration Spaces
11.4 Aftlne Array Indexes
11.5 Data Reuse
11.6 Array Data-Dependence Analysis
11.7 Finding Synchronization-Free Par[0all0]elism
11.8 Synchronization Between Par[0all0]el Loops
11.9 Pipelining
11.10 Locality Optimizations
11.11 Other Uses of Affine Transforms
11.12 Summarv of Chapter 11
11.13 References for Chapter 11
12 Interprocedural Analysis
12.1 Basic Concepts
12.2 Why Interprocedural Analysis?
12.3 A Logical Representation of Data Flow
12.4 A Simple Pointer-Analysis Algorithm
12.5 Context-Insensitive Interprocedural Analysis
12.6 Context-Sensitive Pointer Analysis
12.7 Datalog Implementation by BDD's
12.8 Summary of Chapter 12
12.9 References for Chapter 12
A A Complete Front End
A.1 The Source Language
A.2 Main
A.3 Lexical Analyzer
A.4 Symbol Tables and Types
A.5 Intermediate Code for Expressions
A.6 Jumping Code for Boolean Expressions
A.7 Intermediate Code for Statements
A.8 Parser
A.9 Creating the Front End
B 編譯原理(英文版.第2版)(享有“龍書”的美譽，編譯領域無可替代的經典著…|197632 下載 mobi epub pdf txt 電子書格式