Efficient Pattern Matching for Non-strongly Sequential Term Rewriting Systems

2007 ◽  
pp. 416-425
Author(s):  
Nadia Nedjah ◽  
Luiza de Macedo Mourelle
Keyword(s):  
Pattern Matching ◽  
Term Rewriting ◽  
Term Rewriting Systems ◽  
Rewriting Systems

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING

2006 ◽  
Vol 17 (06) ◽  
pp. 1253-1272
Author(s):  
LOEK CLEOPHAS ◽  
KEES HEMERIK ◽  
GERARD ZWAAN
Keyword(s):  
Pattern Matching ◽  
Term Rewriting ◽  
Tree Automata ◽  
Term Rewriting Systems ◽  
Missing Link ◽  
Rewriting Systems ◽  
Tree Pattern ◽  
Tree Pattern Matching

Tree pattern matching (TPM) algorithms on ordered, ranked trees play an important role in applications such as compilers and term rewriting systems. Many TPM algorithms appearing in the literature are based on tree automata. For efficiency, these automata should be deterministic, yet deterministic root-to-frontier tree automata (DRFTAS) are less powerful than nondeterministic ones, and no root-to-frontier TPM algorithm using a DRFTA has appeared so far. Hoffmann & O'Donnell presented a root-to-frontier TPM algorithm based on an Aho-Corasick automaton recognizing tree stringpaths. No relationship between this algorithm and algorithms using tree automata has however been described. We show that a specific DRFTA can be used for stringpath matching in a root-to-frontier TPM algorithm. This new algorithm provides a missing link between TPM algorithms using stringpath automata and those using tree automata. We also investigate the correspondence between the automata used by the two algorithms.

Sign in / Sign up

Export Citation Format

Share Document