D-E
dangling else, 68 dangling reference, 122 data type, abstract, see abstract data type dataflow, see also liveness, reaching definitions, available expressions, etc. analysis, 6 bit vector, 361 equations, 205-210, 352, 354, 356, 368, 372, 379 iteration, see iteration algorithms work-list algorithms, 363 dead code, 312, 326, 360, 364, 365, 368, 369, 389, 394, 417, 426-428 dead state, 23 def (of variable), 205 def-use chain, 399, 438 deforestation, 327-328 dependence control, see control dependence data, 423, 442, 476 loop-carried, 445 memory and array, 423-425, 445 read-after-write, see dependence, data write-after-read, 423, 441, 476 write-after-write, 423, 441, 476 depth-first search for dataflow analysis, 207, 209, 362, 363 garbage collection, 257, 268, 279 spanning tree, 410-411 derivation, 41 descriptor class, 276, 285-289, 292-297 level, 155 record, 276, 278 DFA, see finite automaton display, 134 class hierarchy, 290, 295, 296 dominance frontier, 404, 436 dominance property, see static single-assignment form dominator, 379-382, 384, 392-395, 436 efficient calculation of, 410-416, 434 dynamic programming for instruction selection, 182-186 for register allocation, 241-244 dynamic scheduling, see out-of-order execution edge splitting, 408 edge-split SSA, see static single-assignment form else, dangling, 68 emission in instruction selection phase, 183, 185 of assembly code, 5, 6, 198, 244 end-of-file marker, 45 environment, 11, 103-111, 115, 284, 301, 317 functional, 107 imperative, 106 multiple, 105 equational reasoning, 298-302, 306, 321, 430 error message, 91 error recovery, 53 escape, 124, 302, 321, 332, see also FindEscape ESEQ, 162-169 expression sequence, see also ESEQ