From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_40,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!attcan!uunet!husc6!bbn!uwmcsd1!ig!agate!ucbvax!sklhx.csc.ti.COM!french
From: french@sklhx.csc.ti.COM (Stewart French)
Newsgroups: comp.lang.ada
Subject: Boyer-Moore string search problems (and solution)
Message-ID: <8805201818.AA08220@ti.com>
Date: 20 May 88 16:04:34 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The Internet
List-Id: <comp.lang.ada>

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