boyer

This was done by Boyer and Moore (the same names behind the Boyer–Moore string search algorithm) at Computational Logic, Inc.

Couldn't be that hard to do a boyer moore for non RE substrings.

Stephan Boyer teaches about them in a peculiarly pragmatic way.

This leads to constructive mathematics, Russell and Whitehead, Boyer and Moore, and an incredible amount of grinding just to get the basics of arithmetic and number theory locked down solid.

Somewhat similar to how a Boyer-Moore search doesn't need to scan the whole haystack while looking for needles.

We used the Boyer-Moore theorem prover and the Stanford Pascal Verifier, but the tools were not there yet.

You can do Boyer-Moore on byte sequences and return the byte offset instead of the character offset.

It's not cutting edge at this point, but still covers all the basics (like Boyer-Moore) really well.

How about substring searching: Boyer- Moore searches backwards, Rabin Karp computes hashes while others simulate automata.

It is evident that Boyer–Moore string search algorithm will outshine any engine on that regular expression.

Boyer - A History of Mathematics - William Dunham - Journey Through Genius - Philip J.

For a time, I was fascinated by Boyer-Moore theory and their theorem prover.

One example from later in that email thread: ^foo is the same as a fixed string search for foo I presume there are ways you can bound your fixed searches, and have your NFA work "backwards" through the string after a boyer-moore hits.

Somewhat similar to how a Boyer-Moore search doesn't need to scan the whole haystack while looking for needles.

We used the Boyer-Moore theorem prover and the Stanford Pascal Verifier, but the tools were not there yet.

You can do Boyer-Moore on byte sequences and return the byte offset instead of the character offset.