Tree automata for code selection

DOI10.1007/BF01178733zbMath0820.68031OpenAlexW1981565634MaRDI QIDQ1342507

Helmut Seidl, Christian Ferdinand, Reinhard Wilhelm

Publication date: 11 January 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178733

zbMATH Keywords

compilersregister allocationinstruction scheduling

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (8)

Weighted tree automata and weighted logics ⋮ Compositions of tree series transformations ⋮ An optimal algorithm for computing all subtree repeats in trees ⋮ Computing all subtree repeats in ordered trees ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ On regular tree languages and deterministic pushdown automata ⋮ A new algorithm for linear regular tree pattern matching ⋮ TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING

Cites Work

• Code selection by inversion of order-sorted derivors
• Variations on the Common Subexpression Problem
• Pattern Matching in Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree automata for code selection