Question #4 Hwk#3

Aaron 'Raz' Wrasman (wrasman@cs.utk.edu)
Mon, 16 Oct 1995 00:34:53 -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?

Aaron 'Raz' Wrasman