Boyer-Moore string search problems (and solution)

[french@sklhx.csc.ti.COM (Stewart French)]

Folks,

An article called "Implementing a Faster String Search Algorithm in
Ada" by David P. Woody and David Turcaso appears in ACM "Ada Letters"
Volume VIII Number 3. May/June 1988.  pp. 87-97 (latest one).

The code is divided into two "approaches" a function and a package both
implementing the Boyer-Moore string search algorithm.  I started
entering them into our Reusable Software Library and decided that I
better write some test routines to make sure they work OK.  Well, they
don't work OK. 

o Neither the function or the package implementation works correctly with
  slices passed in as Word and Text.
o Under certain circumstances infinite loops can exist.

So, I have modified them to work correctly (and to pass my "test
suite").  If anyone wants them drop me a line.

-Stewart French
Texas Instruments
French@skvax1.ti.com