[racket-dev] String search in mred/private/wxme: knuth-bendix?!

I'm staring at do-find-string-all's implementation, and right before the
string-matching logic, there's a mysterious comment "Knuth Bendix" in
there.  I'm staring at the code some more, and it looks more like KMP
(Knuth-Morris-Pratt) to me.

(I have no idea what the Knuth-Bendix algorithm looks like, but I'm pretty
sure it has little to do with string matching: it's supposed to be an
algorithm for solving a system of equations...)

Assuming that it is KMP, is there a reason why we're not using Boyer-Moore
here instead?  My understanding was BM was faster than KMP for common
situations.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/dev/archive/attachments/20121129/88fa68f1/attachment.html>