On Wed, 26 Nov 2003 16:39:24 -0500, Pedro Sam <[EMAIL PROTECTED]> writes:
> On November 26, 2003 12:58 pm, Kris Deugau wrote: > > Which is next to useless for even 30-40 rules. You would have to have > > n![1] states for n rules- there is NO way to determine which individual > > rules will trigger in advance. > > Yeah, I wondered about that... I was just proposing how one may be able to > identify which rules were triggered. I'm sure Scott solved the problem with > some voodoo magic he hasn't told us about :) > > Flipping over the Dragon Book, it mentioned something about "lazy transition > evaluation", perhaps I'd check that out when I feel less lazy. :) Thats for the worst case. Use the algorithm in Chapter 3.9. Or convert the regexp into an NFA and use thealgorithm a few sections earlier to convert that into a DFA. Scott ------------------------------------------------------- This SF.net email is sponsored by: SF.net Giveback Program. Does SourceForge.net help you be more productive? Does it help you create better code? SHARE THE LOVE, and help us help YOU! Click Here: http://sourceforge.net/donate/ _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
