On Thu, Oct 02, 2014 at 01:47:15PM +0100, Andy Bennett wrote: > Hi, > > > You could use submatch info and check which submatch matched. > > This would keep the matching as a single regexp, but you'd then > > need a linear scan to see which submatch succeeded. > > Thanks Alex! > > I'm trying to avoid the linear scan as there are several tens of > thousand entries in the database. How expensive do you think it would be?
My guess is that it will fall back to a backtracking parser, as this would certainly exceed the DFA compiler's size limit. And that's going to be extremely slow! Cheers, Peter -- http://www.more-magic.net _______________________________________________ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
