This directory refers to the classes for matching strings implemented using the
Sather 1.0 version. The string matching algorithms implemented are the
naive and the KNUTH-MORRIS-PRATT algorithms. They come from
Thomas H. Cormen, Charles E., Introduction to Algorithms, MIT Press,1990,
pp. 853-885. 
<P>

In this directory you can find the following files:
<ul>
<li> strmatch.sa : <Br>
	The principal class for all string matching algorithms.
	Each routine corresponds to an algorithm and can be called by 
	any application. 
<li> prestrmatch.sa : <br>
	A simple example program for testing the class STRMATCH. It prepares the 
    text and the pattern string to be compared. The text string is read
    from a file  while the pattern string is read from the stdin.
    The file name of the text string is got from stdin too.
    The user can selects the algorithm to be performed using the stdin.
<li>times : <br>
	The values of time measured using the "time" command. For the 
	testing execution, I modified the program in order that 
	any output messages regarding the positions where
	the strings are matched are deleted.