74 ;;Quote: allocate registers under the assumption that explicit goto's are rare and loops easily recognized

74+;;Quote: with structured languages, loops in intermediate code usually via 'DO' construct

76 ;;Quote: compatible tracks (consecutive uses of a variable) are disjoint; assigned to same register

77 ;;Quote: register allocation by computing cost of allocating a variable to a register

77 ;;Quote: assign registers using bottom-up usage counts for variable addresses and values

78 ;;Quote: values can automatically reside in a register, must reside, be destroyed, or be preserved

79 ;;Quote: allocates registers for loop by two passes; second pass uses usages counts from first pass

79 ;;Quote: min usage count propagated at top of if statements (a merge); current usage count propagated at bottom (a fork)

79 ;;Quote: deallocate all registers at an explicit goto or label