Optimal Regular Tree Pattern Matching Using Pushdown Automata

Abstract

Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionally generated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed by conventional methods, and has been tested on some input problem instances representing instruction sets for processors.

Tree pattern matching from regular tree expressions

“…Other techniques use a pushdown automaton [12,26]. In [12] the method used is analogous to the construction of string pattern matchers: for given patterns, a nondeterministic pushdown automaton is created which is then determinized for efficiency reasons.…”