Attributed linear intermediate representations for retargetable code generators
Software—Practice & Experience
The Generation of Optimal Code for Arithmetic Expressions
Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees
Journal of the ACM (JACM)
Code Generation for a One-Register Machine
Journal of the ACM (JACM)
Code Generation for Expressions with Common Subexpressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Retargetable Compiler Code Generation
ACM Computing Surveys (CSUR)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Deterministic parsing of ambiguous grammars
Communications of the ACM
A portable compiler: theory and practice
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A new method for compiler code generation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Code-generation for machines with multiregister operations
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Description-driven code generation using attribute grammars
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Instruction selection by attributed parsing
Instruction selection by attributed parsing
A compiler writing system with optimization capabilities for complex object order structures
A compiler writing system with optimization capabilities for complex object order structures
An efficient and systematic method of compiler code-generation.
An efficient and systematic method of compiler code-generation.
Tree templates and subtree transformational grammars.
Tree templates and subtree transformational grammars.
Automatic generation of code generators.
Automatic generation of code generators.
Formalization and automatic derivation of code generators.
Formalization and automatic derivation of code generators.
A machine independent algorithm for code generation and its use in retargetable compilers.
A machine independent algorithm for code generation and its use in retargetable compilers.
Retargetable code generation and optimization using attribute grammars
Retargetable code generation and optimization using attribute grammars
Graham/glanville code generators (compiler, parser, programming language)
Graham/glanville code generators (compiler, parser, programming language)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Affix grammar driven code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrating code generation and optimization
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Up-down parsing with prefix grammars
ACM SIGPLAN Notices
Limitations of Graham-Glanville style code generation
ACM SIGPLAN Notices
DAGON: technology binding and local optimization by DAG matching
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Anatomy of a hardware compiler
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
DAGON: Technology binding and local optimization by DAG matching
25 years of DAC Papers on Twenty-five years of electronic design automation
A language for writing code generators
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel tree pattern matching
Journal of Symbolic Computation
Automated generation of code using backtracking parsers for attribute grammars
ACM SIGPLAN Notices
Industrial strength compiler construction with equations
ACM SIGPLAN Notices
Boolean matching of sequential elements
DAC '94 Proceedings of the 31st annual Design Automation Conference
Fast module mapping and placement for datapaths in FPGAs
FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Extending Graham-Glanville techniques for optimal code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
High-quality code generation via bottom-up tree pattern matching
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Tree Pattern Matching for Linear Static Terms
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Tree template matching in ranked ordered trees by pushdown automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Tree template matching in ranked ordered trees by pushdown automata
Journal of Discrete Algorithms
Tree template matching in unranked ordered trees
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We show that tree pattern matching has significant advantages in the specification and implementation of efficient code generators. We present a top-down tree-matching algorithm that is particularly well suited to code generation applications. Finally, we present a new back-end language that incorporates tree pattern matching with dynamic programming into a uniform framework for the specification and implementation of efficient code generators.