Tree automata for code selection

@article{Ferdinand1991TreeAF,
  title={Tree automata for code selection},
  author={Christian Ferdinand and Helmut Seidl and Reinhard Wilhelm},
  journal={Acta Informatica},
  year={1991},
  volume={31},
  pages={741-760}
}
We deal with the generation of code selectors in compiler backends. The fundamental concepts are systematically derived from the theory of regular tree grammars and finite tree automata. We use this general approach to construct algorithms that generalize and improve existing methods.