Paper Info
Title
A pattern compiler
Abstract
A pattern compiler for the SCRATCHPAD system provides an efficient implementation of sets of user-defined pattern-replacement rules for symbolic mathematical computation such as tables of integrals or summation identities. Rules are compiled together, with common search paths merged and factored out and with the resulting code optimized for efficient recognition over all patterns. Matching principally involves structural comparison of expression trees and evaluation of predicates. Pattern recognizers are “fully compiled” if values of match variables can be determined by solving equations at compile time. Recognition times for several pattern matchers are compared.
Year
DOI
Venue
1976
10.1145/800205.806324
International Symposium on Symbolic and Algebraic Computation
Keywords
Field
DocType
recognition time,pattern recognizers,pattern compiler,expression tree,pattern matchers,common search path,efficient implementation,match variable,efficient recognition,scratchpad system,pattern matching,code optimization
Equation solving,Programming language,Compile time,Computer science,Compiler,Theoretical computer science,Predicate (grammar),Binary expression tree,Computation
Conference
Citations 
PageRank 
References 
6
3.51
1
Authors
1
Name
Order
Citations
PageRank
Richard D. Jenks17753.14