Automatic code generators often contain pattern matchers that are based on tree grammars. In this work we generalise this approach by developing pattern matchers that are based on more powerful term rewrite systems. A pattern matcher based on a term rewrite system computes all the sequences of rewrite rules that will reduce a given expression tree to a given goal. While the number of sequences of rewrite rules that are generated is typically enormous, the vast majority of sequences are in fact redundant. This redundancy is caused by the fact that many rewrite sequences are permutations of each other. A theory and a series of algorithms are systematically developed that identify and remove two types of redundant rewrite sequences. These algorithms terminate if rewrite sequences do not diverge.
Katoen, J. P., & Nymeyer, A. (2000). Pattern-matching algorithms based on term rewrite systems. Theoretical computer science, 238(1-2), 439-463. [10.1016/S0304_3975(00)00041-4]. https://doi.org/10.1016/S0304-3975(00)00041-4