Compilers, principles, techniques, and tools
著者
書誌事項
Compilers, principles, techniques, and tools
(Addison-Wesley series in computer science)
Addison-Wesley Pub. Co., c1986
大学図書館所蔵 全37件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. [752]-779) and index
内容説明・目次
内容説明
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
目次
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. 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 Compiler? Planning a Compiler. 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. Appendix: A Compiler Project. Introduction. A Pascal Subset. Program Structure. Lexical Conventions. Suggested Exercises. Evolution of the Interpreter. Extensions. Bibliography. Index.
「Nielsen BookData」 より