Vor Ort
Merkzettel Warenkorb
Produktbild: Compiler Construction

Compiler Construction

136,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

20.12.2011

Abbildungen

Drawings: 10 B&W, 0 Color

Verlag

John Wiley & Sons Inc

Seitenzahl

664

Maße (L/B/H)

26/18,3/3,9 cm

Gewicht

1408 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-0-470-94959-7

Beschreibung

Rezension

"Compiler Construction Using Java, JavaCC, and Yacc covers every topic essential to learning compilers from the ground up and is accompanied by a powerful and flexible software package for evaluating projects, as well as several tutorials, well-defined projects, and test cases." (Ulitzer, 5 December 2011)

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

20.12.2011

Abbildungen

Drawings: 10 B&W, 0 Color

Verlag

John Wiley & Sons Inc

Seitenzahl

664

Maße (L/B/H)

26/18,3/3,9 cm

Gewicht

1408 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-0-470-94959-7

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
Die Leseprobe wird geladen.
  • Produktbild: Compiler Construction
  • Preface xv
     
    Chapter 1. Strings, Languages, and Compilers 1
     
    1.1 Introduction 1
     
    1.2 Basic Language Concepts 1
     
    1.3 Basic Compiler Concepts 3
     
    1.4 Basic Set Theory 4
     
    1.5 Null String 6
     
    1.6 Concatenation 7
     
    1.7 Exponent Notation 7
     
    1.8 Star Operator 8
     
    1.9 Concatenation of Sets of Strings 9
     
    1.10 Plus Operator 11
     
    1.11 Question Mark Operator 11
     
    1.12 Shorthand Notation for a Set Containing a Single String 12
     
    1.13 Operator Precedence 12
     
    1.14 Regular Expressions 13
     
    1.15 Limitations of Regular Expressions 15
     
    Problems 16
     
    Chapter 2. Context-Free Grammars, Part 1 19
     
    2.1 Introduction 19
     
    2.2 What is a Context-Free Grammar? 20
     
    2.3 Derivations Using a Context-Free Grammar 21
     
    2.4 Language Defined by a Context-Free Grammar 23
     
    2.5 Different Ways of Representing Context-Free Grammars 25
     
    2.6 Some Simple Grammars 26
     
    2.7 Techniques for Generating Languages with Context-Free Grammars 29
     
    2.8 Regular and Right Linear Grammars 35
     
    2.9 Counting with Regular Grammars 37
     
    2.0 Grammars for Lists 39
     
    2.10 An Important Language that is Not Context Free 44
     
    Problems 45
     
    Chapter 3. Context-Free Grammars, Part 2 49
     
    3.1 Introduction 49
     
    3.2 Parse Trees 49
     
    3.3 Leftmost and Rightmost Derivations 51
     
    3.4 Substitution 52
     
    3.5 Ambiguous Grammars 54
     
    3.6 Determining Nullable Nonterminals 59
     
    3.7 Eliminating Lambda Productions 60
     
    3.8 Eliminating Unit Productions 64
     
    3.9 Eliminating Useless Nonterminals 66
     
    3.10 Recursion Conversions 71
     
    3.11 Adding the Null String to a Language 76
     
    Problems 77
     
    Chapter 4. Context-Free Grammars, Part 3 83
     
    4.1 Introduction 83
     
    4.2 Grammars for Arithmetic Expressions 83
     
    4.3 Specifying Associativity and Precedence in Grammars 90
     
    4.4 Backus-Naur Form 92
     
    4.5 Syntax Diagrams 94
     
    4.6 Abstract Syntax Trees and Three-Address Code 96
     
    4.7 Noncontracting Grammars 97
     
    4.8 Essentially Noncontracting Grammars 97
     
    4.9 Converting a Context-Free Grammar to an Essentially Noncontracting Grammar 98
     
    4.10 Pumping Property of Context-Free Languages 101
     
    Problems 104
     
    Chapter 5. Chomsky's Hierarchy 107
     
    5.1 Introduction 107
     
    5.2 Context-Sensitive Productions 107
     
    5.3 Context-Sensitive Grammars 110
     
    5.4 Unrestricted Grammars 111
     
    Problems 112
     
    Chapter 6. Top-Down Parsing 115
     
    6.1 Introduction 115
     
    6.2 Top-Down Construction of a Parse Tree 115
     
    6.3 Parses that Fail 117
     
    6.4 A Bad Grammar for Top-Down Parsing 118
     
    6.5 Deterministic Parses 119
     
    6.6 A Parser that Uses a Stack 120
     
    6.7 Table Representation of a Stack Parser 124
     
    6.8 Handling Productions with Nonleading Terminal 126
     
    6.9 Writing a Stack Parser in Java 127
     
    Problems 134
     
    Chapter 7. LL(1) Grammars 137
     
    7.1 Introduction 137
     
    7.2 FIRST Set of the Right Side of a Production 137
     
    7.3 Determining Operation Sequences 140
     
    7.4 Determining Selection Sets of Lambda Productions 142
     
    7.5 Whatever-Follows-Left-Follows-Rightmost Rule 145
     
    7.6 Selection Sets for Productions with Nullable Right Sides 147
     
    7.7 Selection Sets Containing End-of-Input Symbol 149
     
    7.8 A Stack Parser for a Grammar with Lambda Productions 152
     
    7.9 Co