作者: Todd A. Proebsting , David R. Hanson , Christopher W. Fraser
DOI:
关键词: Programming language 、 Twig 、 Tree (data structure) 、 Matching (graph theory) 、 Computer science 、 Code generation 、 Code (cryptography) 、 Dynamic programming 、 Unreachable code 、 Dead code
摘要: Many code generator generators use tree pattern matching and dynamic programming. This note describes a simple program that generates matchers are fast, compact, easy to understand. It is simpler than common alternatives: 200{700 lines of Icon versus 3000 C for Twig 5000 burg. Its run up 25 times faster Twig's. They necessarily slower burg's BURS (bottom-up rewrite system) but they more exible still practical. AT&T Bell Laboratories, 600 Mountain Avenue 2C-464, Murray Hill, NJ 07974 Department Computer Science, The University Arizona, Tucson, AZ 85721