Code selection by tree series transducers, in (2004)
| Venue: | Proc. 9th Int. Conf. on Implementation and Application of Automata, Vol. 3317 of LNCS |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Borchardt04codeselection,
author = {Björn Borchardt},
title = {Code selection by tree series transducers, in},
booktitle = {Proc. 9th Int. Conf. on Implementation and Application of Automata, Vol. 3317 of LNCS},
year = {2004},
pages = {57--67},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this paper we model code selection by tree series transducers. We are given an intermediate representation of some compiler as well as a machine grammar with weights, which reflect the number of machine cycles of the instructions. The derivations of the machine grammar are machine codes. In general, a machine grammar is ambiguous and hence there might exist more than one derivation of an intermediate code. We show how to filter out a cheapest such derivation and thereby perform tree parsing and tree pattern matching using tree series transducers. 1
Citations
| 133 | Pattern matching in trees - Hoffmann, O’Donnell - 1982 |
| 49 | A new method for compiler code generation - Glanville, Graham - 1978 |
| 45 | C.: Recognizable formal power series on trees - Berstel, Reutenauer - 1982 |
| 28 | Bottom-Up and Top-Down Tree Series Transformations - Engelfriet, Fulop, et al. |
| 27 | Tree Automata for Code Selection - Ferdinand, Seidl, et al. - 1992 |
| 9 | Weighted grammars and Kleene’s theorem - Alexandrakis, Bozapalidis - 1987 |
| 1 | Optimal code-selection using MBURG. Presented to the 20th Australian Computer Science Conference - Gough, Ledermann - 1997 |
