Algorithms for Compiler Design (Electrical and Computer Engineering Series)

Chapter 2: Finite Automata and Regular Expressions

EXAMPLE 2.1

EXAMPLE 2.2

EXAMPLE 2.3

EXAMPLE 2.4

EXAMPLE 2.5

EXAMPLE 2.6

EXAMPLE 2.7

EXAMPLE 2.8

EXAMPLE 2.9

EXAMPLE 2.10

Chapter 3: Context-Free Grammar and Syntax Analysis

EXAMPLE 3.1

EXAMPLE 3.2

EXAMPLE 3.3

EXAMPLE 3.4

EXAMPLE 3.5

EXAMPLE 3.6

EXAMPLE 3.7

EXAMPLE 3.8

EXAMPLE 3.9

EXAMPLE 3.10

EXAMPLE 3.11

EXAMPLE 3.12

EXAMPLE 3.13

EXAMPLE 3.14

EXAMPLE 3.15

Chapter 4: Top-Down Parsing

EXAMPLE 4.1

EXAMPLE 4.2

EXAMPLE 4.3

EXAMPLE 4.4

EXAMPLE 4.5

EXAMPLE 4.6

EXAMPLE 4.7

EXAMPLE 4.8

Chapter 5: Bottom-up Parsing

EXAMPLE 5.1

EXAMPLE 5.2

EXAMPLE 5.3

EXAMPLE 5.4

EXAMPLE 5.5

EXAMPLE 5.6

EXAMPLE 5.7

EXAMPLE 5.8

Chapter 6: Syntax-Directed Definitions and Translations

EXAMPLE 6.1

EXAMPLE 6.2

EXAMPLE 6.3

EXAMPLE 6.4

EXAMPLE 6.5

EXAMPLE 6.6

Chapter 11: Code Generation

EXAMPLE 11.1

EXAMPLE 11.2

EXAMPLE 11.3

EXAMPLE 11.4

Chapter 12: Exercises

EXERCISE 12.1

EXERCISE 12.2

EXERCISE 12.3

EXERCISE 12.4

EXERCISE 12.5

EXERCISE 12.6

EXERCISE 12.7

EXERCISE 12.8

EXERCISE 12.9

EXERCISE 12.10

EXERCISE 12.11

EXERCISE 12.12

EXERCISE 12.13

EXERCISE 12.14