Optimal left-to-right pattern-matching automata

  • Nadia Nedjah
  • Colin D. Walter
  • Stephen E. Eldridge
Theorem Proving Methods

DOI: 10.1007/BFb0027016

Volume 1298 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Nedjah N., Walter C.D., Eldridge S.E. (1997) Optimal left-to-right pattern-matching automata. In: Hanus M., Heering J., Meinke K. (eds) Algebraic and Logic Programming. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg

Abstract

We propose a practical technique to compile pattern-matching for prioritised overlapping patterns in equational languages into a minimal, deterministic, left-to-right, matching automaton. First, we present a method for constructing a tree matching automaton for such patterns. This allows pattern-matching to be performed without any backtracking. Space requirements are reduced by using a directed acyclic graph (dag) automaton that shares all the isomorphic subautomata which 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 conclude with some easily computed bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

Keywords

Term rewriting system pattern-matching tree automaton dag automaton 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Nadia Nedjah
    • 1
  • Colin D. Walter
    • 1
  • Stephen E. Eldridge
    • 1
  1. 1.Computation Dept.UMISTManchesterUK