Boyer-Moore string search algorithm implementation in C.
The algorithm performs its matching backwards, from right to left and proceeds by iteratively matching, shifting the pattern, matching, shifting, etc. The shift amount is calculated by applying these two rules:
- the bad character rule
- good suffix rule
An actual shifting offset is the maximum one of them.
delta1- the "Bad Character" table
This table contains an entry for every character in the alphabet. The entry for char specifies how far the pattern should be right shifted when chars found in the string and it does not match the current pattern character.
delta2- the "Good Suffix" table
This table contains an entry for each character in the pattern. The entry for pattern[j] specifies how far the current string position should shift to the right when pattern[j-1] does not match the string but the suffix at pattern[j .. patlen-1] does match.
To compile and execute the tests:
$ make
$ ./bm
To remove the compiled file:
$ make clean