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
At Thu, 29 Nov 2012 15:22:17 -0700, Danny Yoo wrote:
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.
On Thu, Nov 29, 2012 at 5:15 PM, Matthew Flatt mfl...@cs.utah.edu wrote:
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.
IIUC, the BM speedup comes from skipping over portions of the
3 matches
Mail list logo
