Register allocation in a pattern matching code generator

Register allocation in a pattern-matching code generator is discussed, and a strategy for the allocation of registers is presented. The strategy is suitable for code generators that perform no data-flow analysis, but do perform common subexpression analysis. An implementation of the strategy has produced high quality code.