Algorithms for Compiler Design (Electrical and Computer Engineering Series)

D

DAGs. See Directed acyclic graphs (DAGs)

Data storage. See Storage management

Data structures for representing parsing tables, 178-179

Dead states of DFAs, 27

detection of, 31

Decrement operators, implementation of, 224-225

Dependency graphs, 199-201

Derivation

in context-free grammar, 55-56

derivation trees in CFG, 56-61

Detection, of DFA unreachable and dead states, 28-31

Deterministic finite automata (DFA)

Action GOTO tables, 141-142

augmented grammar and, 142-146

equivalent to NFAs with ˆˆ -moves, 23-27

exercises, 323-324

minimization of, 27-31

minimization/optimization of, 27-31

transforming NFAs into, 16-18

DFA. See Deterministic finite automata (DFA)

Directed acyclic graphs (DAGs), 288-290

code generation and, 305-316

heuristic DAG ordering, 305-307

labeling algorithm and, 307-309

DO-WHILE statements and translation, 220-221

Dummy synthesized attributes, 199-201