> -----Original Message----- > From: Scott A Crosby > Sent: Thursday, December 11, 2003 6:49 AM [...] > > The major catch with this particular implementation is that it cannot > deal with nondeterministic transformations. What this means is that > any consequent for a substitute rule must be a single character. ( '4 > -> for' would be bad) Thats not something that I think is going to be > a real problem in practice. Another problem is that with a few good > transforming rulesets, you've just increased the regexp ruleset > 5x. The matching engine has to support that without even more of a > resource hog. This would be a problem for the perl regexp engine that > SA uses, but not for an automata based matcher like what I have been > proposing and implementing. > >
One implementation might be to convert the rewrite rules into an equivalent flex description, and let flex generate the automaton in C. Compile the C, and build a Perl binding to it. ------------------------------------------------------- This SF.net email is sponsored by: IBM Linux Tutorials. Become an expert in LINUX or just sharpen your skills. Sign up for IBM's Free Linux Tutorials. Learn everything from the bash shell to sys admin. Click now! http://ads.osdn.com/?ad_id=1278&alloc_id=3371&op=click _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
