Code selection by tree series transducers

Authors:
Björn Borchardt
Affiliations:
Department of Computer Science, Dresden University of Technology, Dresden, Germany
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 5
Cited 7

Weighted grammars and Kleene's theorem

Information Processing Letters
Tree automata for code selection

Acta Informatica
Pattern Matching in Trees

Journal of the ACM (JACM)
A new method for compiler code generation

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Bottom-up and top-down tree series transformations

Journal of Automata, Languages and Combinatorics

Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations

Theoretical Computer Science
Weighted tree automata and weighted logics

Theoretical Computer Science
Compositions of tree series transformations

Theoretical Computer Science
Incomparability results for classes of polynomial tree series transformations

Journal of Automata, Languages and Combinatorics
Recognizable tree series with discounting

Acta Cybernetica
Weighted muller tree automata and weighted logics

Journal of Automata, Languages and Combinatorics
Does o-substitution preserve recognizability?

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.