Affix grammar driven code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An improvement to bottom-up tree pattern matching
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Optimal code generation for expression trees: an application BURS theory
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient retargetable code generation using bottom-up tree pattern matching
Computer Languages
Engineering a simple, efficient code-generator generator
ACM Letters on Programming Languages and Systems (LOPLAS)
Tree automata for code selection
Acta Informatica
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient tree pattern matching (extended abstract): an aid to code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
A new algorithm for linear regular tree pattern matching
Theoretical Computer Science
Using dynamic programming to generate optimized code in a Graham-Glanville style code generator
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
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
A new method for compiler code generation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Retargetable C Compiler: Design and Implementation
A Retargetable C Compiler: Design and Implementation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Two Tree Pattern Matchers for Code Selection
Proceedings of the 2nd CCHSC Workshop on Compiler Compilers and High Speed Compilation
One-Pass, Optimal Tree Parsing - With Or Without Trees
CC '96 Proceedings of the 6th International Conference on Compiler Construction
A fast general parser for automatic code generation
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
| Hi-index | 0.00 |
We propose a new technique for constructing code-generator generators, which combines the advantages of the Graham-Glanville parsing technique and the bottom-up tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton as the matching device. This device is able to handle ambigious grammars, and can be used to generate locally optimal code without the use of heuristics. Cost computations are performed at preprocessing time. The class of regular tree grammars augmented with costs that can be handled by our system properly includes those that can be handled by bottom-up systems based on finite-state tree parsing automata. Parsing time is linear in the size of the subject tree. We have tested the system on specifications for some systems and report table sizes.