On obtaining the Boyer–Moore string-matching algorithm by partial evaluation

We present the first derivation of the search phase of the Boyer–Moore string-matching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the bad-character-shift heuristic as a binding-time improvement, bounded static variation. An inefficient stri...

Ausführliche Beschreibung