Custom cover image
Principles of Compilers : A New Approach to Compilers Including the Algebraic Method / by Yunlin Su, Song Y. Yan
Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink BücherPublisher: Berlin, Heidelberg : Higher Education Press, Beijing and Springer-Verlag Berlin Heidelberg, 2011Description: Online-Ressource (500p. 100 illus, digital)ISBN:- 9783642208355
- 005.453
- 005.4/53 005.453
- QA75.5-76.95
- QA76.76.C65 S8 2011
Contents:
Summary: Song Y. YanSummary: "Principles of Compilers: A New Approach to Compilers Including the Algebraic Method" introduces the ideas of the compilation from the natural intelligence of human beings by comparing similarities and differences between the compilations of natural languages and programming languages. The notation is created to list the source language, target languages, and compiler language, vividly illustrating the multilevel procedure of the compilation in the process. The book thoroughly explains the LL(1) and LR(1) parsing methods to help readers to understand the how and why. It not only covePPN: PPN: 1651069018Package identifier: Produktsigel: ZDB-2-SCS
Title Page; Copyright Page; Preface; Table of Contents; Chapter 1 Introduction; 1.1 Language and Mankind; 1.2 Language and Computer; 1.3 Compilation of Programming Languages; 1.4 Number of Passes of Compiler; 1.5 An Example of Compilation of a Statement; 1.6 Organization of the Book; References; Chapter 2 Grammars and Languages; 2.1 Motivation of the Chapter; 2.2 Preliminary Knowledge; 2.3 Grammar; 2.4 Language; 2.5 Language Generated by a Grammar; 2.6 Turing Machine; 2.7 Issues Concerning Grammars and Languages; Problems; References; Chapter 3 Finite State Automata and Regular Languages
3.1 Motivations of the Chapter3.2 Languages, Grammars and Automata; 3.3 Deterministic Finite Automata; 3.4 Nondeterministic Finite Automata; 3.5 Regular Expressions; 3.6 Regular Grammar; 3.7 Kleene's and Moore's Theorems; 3.8 Pumping Theorems and Closure Properties for LREG; 3.9 Applications of Finite Automata; 3.10 Variants of Finite Automata; Problems; References; Chapter 4 Lexical Analysis; 4.1 Motivation of the Chapter; 4.2 Lexical Analyzer; 4.2.1 Role of Lexical Analyzer; 4.2.2 Identifier analysis; 4.2.3 Handling of Constants; 4.2.4 Structure of Lexical Analyzer
4.3 Output of Lexical Analyzer4.4 Error Handling; Problems; References; Chapter 5 Push-Down Automata and Context-Free Languages; 5.1 Motivation of the Chapter; 5.2 Push-Down Automata; 5.3 Context-Free Languages (LCF); 5.4 Pumping Theorems for Context-Free Languages; 5.5 Push-Down Automata and Context-Free Languages; 5.6 Applications of Context-Free Languages; 5.7 Turing Machines; 5.8 Turing Machines as Language Accepters; 5.9 Equivalence of Various Turing Machines; 5.10 Recursively Enumerable Languages (LRE); 5.11 Context-Sensitive Languages (LCS)
5.12 Hierarchy of Machines, Grammars and Languages5.12.1 Hierarchy of Machines; 5.12.2 Hierarchy of Grammars and Languages; 5.13 Relations Among Machines, Languages and Grammars; Problems; References; Chapter 6 Context-Free Grammars; 6.1 Motivation of the Chapter; 6.2 Context-Free Grammars; Problems; References; Chapter 7 Syntax Analysis; 7.1 Motivation of the Chapter; 7.2 Role of Syntax Analysis in Compilers; 7.3 Methods of Syntax Analysis; 7.4 LL(1) Syntactical Analysis Method; 7.5 Bottom-Up Syntactical Analysis Method; 7.6 LR(1) Syntactical Analysis Method; 7.6.1 LR(0) Syntactical Analysis
7.6.2 SLR(1) Syntactical Analysis7.6.3 LALR(1) Syntactical Analysis; 7.6.4 LR(1) Syntactical Analysis; Problems; References; Chapter 8 Attribute Grammars and Analysis; 8.1 Motivation of the Chapter; 8.2 Attribute Grammar; 8.3 Dependence Graph and Evaluation of Attributes; 8.3.1 Dynamic Attribute Evaluation; 8.3.2 Loop Handling; 8.4 L Attribute Grammas and S Attribute Grammars; Problems; References; Chapter 9 Algebraic Method of Compiler Design; 9.1 Motivation of the Chapter; 9.2 Source Language; 9.3 Algebraic Foundation and Reasoning Language; 9.3.1 Algebra Fundamentals
9.3.2 Reasoning Language
No physical items for this record