Tree automata for code selection

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.

[1]  Robert Rettig Henry.  Graham/glanville code generators (compiler, parser, programming language) , 1984 .

[2]  Susan L. Graham,et al.  Optimal Code Generation for Expression Trees: An Application of BURS (bottom-Up Rewrite Systems) Theory , 1988 .

[3]  Christian Ferdinand.  Pattern Matching in a Functional Transformation Language using Treeparsing , 1990, PLILP.

[4]  Alfred V. Aho,et al.  Efficient tree pattern matching (extended abstract): an aid to code generation , 1985, POPL '85.

[5]  Robert R Henry.  Graham-Glanville Code Generators , 1999 .

[6]  Albert Gräf,et al.  Left-to-Right Tree Pattern Matching , 1991, RTA.

[7]  David R. Chase,et al.  An improvement to bottom-up tree pattern matching , 1987, POPL '87.

[8]  Robert Steven Glanville,et al.  A Machine Independent Algorithm for Code Generation and Its Use in Retargetable Compilers , 1977 .

[9]  Robert Giegerich.  Code Selection by Inversion of Order-Sorted Derivors , 1990, Theor. Comput. Sci..

[10]  Helmut Emmelmann.  Code Selection by Regularly Controlled Term Rewriting , 1991, Code Generation.

[11]  Reinhard Wilhelm,et al.  Two Tree Pattern Matchers for Code Selection , 1988, CC.

[12]  Aline Deruyver,et al.  Compilation of Ground Term Rewriting Systems and Applications , 1989, RTA.

[13]  Alfred V. Aho,et al.  Efficient Tree Pattern Matching: An Aid to Code Generation. , 1985 .

[14]  Robert Giegerich,et al.  Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors , 1988, ESOP.

[15]  Hans H. Kron,et al.  Tree templates and subtree transformational grammars. , 1975 .

[16]  Andreas Podelski,et al.  Tree Automata and Languages , 1992 .

[17]  Susan L. Graham,et al.  A new method for compiler code generation , 1978, POPL '78.

[18]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[19]  Reinhard Wilhelm,et al.  Table compression for tree automata , 1991, TOPL.

[20]  Eduardo Pelegri-Llopart,et al.  Rewrite systems, pattern matching, and code generation , 1988 .

[21]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.