NobleBlocks

Research indexJournal article

A pattern compiler

Jenks

1 Jan 1976

NobleIDark:/48914/w1/20260522/636464A0DOI10.1145/800205.806324

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

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.

Discussion

Citations

Topics

More

Suggest a correction or report