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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleenes theorem. Information Processing Letters 24(1), 1–4 (1987)
Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18(2), 115–148 (1982)
Engelfriet, J., Fülöop, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Automata, Languages and Combinatorics 7, 11–70 (2002)
Ferdinand, C., Seidl, H., Wilhelm, R.: Tree automata for code selection. Acta Informatica 31(8), 741–760 (1994)
Glanville, R.S., Graham, S.L.: A new method for compiler code generation. In: Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pp. 231–240 (1978)
Gough, K.J., Ledermann, J.: Optimal code-selection using MBURG. Presented to the 20th Australian Computer Science Conference, Sydney (1997)
Hoffmann, C., O’Donnell, M.J.: Pattern matching in trees. J. ACM 29, 68–95 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borchardt, B. (2005). Code Selection by Tree Series Transducers. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)