Up-down parsing with prefix grammars
ACM SIGPLAN Notices
An improvement to bottom-up tree pattern matching
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
BEG: a generator for efficient back ends
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)
Science of Computer Programming
Efficient retargetable code generation using bottom-up tree pattern matching
Computer Languages
Tree automata for code selection
Acta Informatica
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
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
Compiler Design
Two Tree Pattern Matchers for Code Selection
Proceedings of the 2nd CCHSC Workshop on Compiler Compilers and High Speed Compilation
Tree templates and subtree transformational grammars.
Tree templates and subtree transformational grammars.
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such algorithms on words or generalizations thereof using finite (tree) automata. Regrettably no coherent, extensive toolkit of such algorithms and automata existed, complicating their use. Our toolkit FOREST FIRE contains many such algorithms and automata constructions. It is accompanied by the graphical user interface (GUI) FIRE WOOD. The toolkit and GUI provide a useful environment for experimenting with and comparing the algorithms. In this tool paper we give an overview of the toolkit and GUI, their context and design rationale, and mention some results obtained with them.