Index_D

C

Call and return sequences, stack allocation and, 250-253

Canonical collection of sets

algorithm for, 146-152

exercises, 324

of LR(1), algorithm, 161-163

Cartesian products, set operation, 7

CASE statements, 229-234

Closure

property closure of a relation, 9

set operation, 7-8

Closure operations, regular sets and, 47

Code generation phase, 2, 3, 4

DAGs and, 305-316

difficulties encountered during, 296-297

getreg() function and, 300-305

labeled trees and, 307-316

straightforward strategy for, 299-305

Code optimization phase, 2, 3

algebraic properties to reduce register requirements, 317-318

algebraic simplifications , 320

defined and described, 269-270

global common subexpressions , eliminating, 290-292

jumps , eliminate multiple, 319

loads and stores, eliminating redundancy, 319

local common subexpressions, eliminating, 288-290

loop optimization, 270-284

machine idioms and, 321

partitioning three-address code into basic blocks, 271-273

peephole optimization, 318-321

reducible flow graphs and, 274-284

strength reduction, 321

unreachable code, eliminating, 319-320

Compilation, process described, 2-5

Compilers

defined, 1

front-end vs. back-end compilers, 4

organization of, 4

Computational order, 296

Concatenation

defined, 6

set operation, 7

Concatenation operation, regular sets and, 47

Context-free grammars (CFGs)

algorithm for identifying useless symbols, 64

defined and described, 54

derivation in, 55-56

ˆˆ - productions and, 70-73

left linear grammar, 86-90

left-recursive grammar, 75-77

productions (P) in, 54

reduction of grammar, 61-70

regular grammar as, 77-85

right linear grammar, 85-86

SLR(1) grammars, 152-161

start symbol (S) in, 54

in syntax analysis phase, 53-54

terminals (T) in, 54

unit productions and, 73-75

variables (V) or nonterminals in, 54, 56

Cross-compilers, defined, 1-2