The bad character shift table would have two slots, for '0' and for '1'. Practical value of such arrangement is nil.
Exactly! (Glad that someone, even an anonymous someone :) also sees the problem.
But the algorithms can be augmented to handle multiple "characters" at a time, and this is when they become lucrative.
Clue sticks and references cordially invited?
(Though my immediate reaction is that compound characters simply reduce to a different alphabet with more bits -- ie. (ab) becomes a single symbol that requires twice as many bits -- and the problem remains the same, or is compounded because the lookup table(s) need to be bigger.
In reply to Re^2: Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)
by BrowserUk
in thread Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |