On Mon, Nov 27, 2000 at 01:29:27PM -0500, Rocco Caputo wrote:
> Text::Trie is an amazing little module. I've abused it in a macro processing
> source filter to build optimum regexps out of lists of tokens.
Have you tried out Regex::PreSuf?
I tried making a monster regexp out of /usr/dict/words
Text::Trie is an amazing little module. I've abused it in a macro processing
source filter to build optimum regexps out of lists of tokens.
I've attached a proof-of-concept/benchmark program using the interesting bits
from POE::Preprocessor to build, test, and time regexps. Results of a sample
At 05:17 PM 11/27/00 +, Nicholas Clark wrote:
> > > "ST" == Sam Tregar <[EMAIL PROTECTED]> writes:
> > ST> Perhaps we really need a new kind of regex that works by-design against
> > ST> streams of bytes?
>
>I don't think any change is needed in the regex syntax. I think just being
>carefu
