722 ;;Quote: in a syntax tree, interior nodes are operators and leaves are operands with pointers into the symbol table

QuoteRef: ahoAV_1973 ;;724 intermediate representationspre or postfix polish, linked list trees, multiple address code with named or implicit results

QuoteRef: ahoAV_1973 ;;788 "Symbol tables are an integral feature of virtually all compilers

QuoteRef: ahoAV_1973 ;;791 declarations are instructions to the book keeping mechanism

815 ;;Quote: a property grammar is a regular, context free grammar with a property table mapping righthand side elements to the lefthand side

QuoteRef: ahoAV_1973 ;;845 value of a block is value of output variables after last statement, equiv. if same value.

QuoteRef: ahoAV_1973 ;;850 optimization eliminate useless assignments, redundant computations

QuoteRef: ahoAV_1973 ;;870 handle commutative reordering by ordering operands

QuoteRef: ahoAV_1973 ;;894 if memory reference commutative operators then commute syntax tree so all id leave on right hand side

QuoteRef: ahoAV_1973 ;;915 a program block directly dominates some other block if it is the latest block on all paths through the program

QuoteRef: ahoAV_1973 ;;918 if two equivalent expressions do not have any subexpressions changed on any path between a dominating block and a block then can reuse result

QuoteRef: ahoAV_1973 ;;920 optimize by compile time execution

QuoteRef: ahoAV_1973 ;;922 strongly connected region of program flow graph consists of unique entry, path between all blocks in region, allows independence

QuoteRef: ahoAV_1973 ;;926 induction variables for arbitrary paths through a region shows a arithmetic progression

QuoteRef: ahoAV_1973 ;;927 if induction variable same initial value and not used outside can be removed, if several induction variables all but one can be computed on exit

QuoteRef: ahoAV_1973 ;;932 if loop only a few times can turn it into a sequence

QuoteRef: ahoAV_1973 ;;937 data flow analysis for global code movement uses intervals and bit vectors

QuoteRef: ahoAV_1973 ;;941 reducible flow graph if treating intervals also as node end up with one interval (all lang. programs are reducible)
