Re: Question #4 Hwk#3

Michael W. Berry (berry@cs.utk.edu)
Mon, 16 Oct 1995 08:59:23 -0400

> I'm a bit confused on #4 It says "Explain how to use the algorithm to
> report ALL matches of the regular expression in the form of a start
> position and a length."
>
> Length of what? Are we using a PAT tree similiar to #3 in which
> external nodes point to words? If so when we have external nodes that
> point back into the orignal text, do you mean you want the length of the
> word we are pointing to with an external node?

Length refers to the length of a prefix - think in terms of the
examples we've done on simple binary text.

Mike
-------------------------------------------------------------------
Michael W. Berry Ayres Hall 114
berry@cs.utk.edu Department of Computer Science
OFF:(423) 974-3838 University of Tennessee
FAX:(423) 974-4404 Knoxville, TN 37996-1301
URL:http://www.cs.utk.edu:80/~berry/
-------------------------------------------------------------------