Mitchell, Neil wrote:
Hi Martijn,
> It's not that tricky if you do a regular expression state machine
> yourself, but that's probably a bit too much work. One way to get
> a speed up might be to take the regular expressions a,b,c,d and
> generate a regex a+b+c+d, and one a+b. You can then check
On Wed, Nov 5, 2008 at 1:56 PM, Martijn van Steenbergen
<[EMAIL PROTECTED]> wrote:
> I think I'll try roger's (private)
eek, bitten by "reply to sender only" again!
i had intended to send to the list too.
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
On Tue, Nov 4, 2008 at 6:44 PM, i wrote:
> i'm sorry if this is obviously wrong (i haven't used Text.Regex), but
> can't you do this with submatches?
rights or wrongs of regexps aside, i just checked that the above
approach *is* feasible with Text.Regex
here's some code:
>module Multimatch(multi
Hello everyone,
Thank you all for your comments! Those are some very useful ideas.
I think I'll try roger's (private) and ChrisK's suggestion first: using
the match groups. I'm not sure if the match groups inside the individual
regexes will cause much trouble, but we'll see. I imagine I'll ha
Hi Martijn,
If you are brave to start implementing DFA with all required
optimisations then you might want to look at:
http://www.ontotext.com/gate/japec.html
This is a compiler for language called JAPE. In the language you
define a set of rules where the right hand side
is a regular expression
On Tue, Nov 4, 2008 at 9:05 AM, Martijn van Steenbergen
<[EMAIL PROTECTED]> wrote:
>
> For my mud client Yogurt (see hackage) I'm currently working on
> improving the efficiency of the hooks. Right now several hooks, each
> consisting of a regex and an action can be active at the same time.
> Every
Hi Martijn,
It's not that tricky if you do a regular expression state machine yourself, but
that's probably a bit too much work. One way to get a speed up might be to take
the regular expressions a,b,c,d and generate a regex a+b+c+d, and one a+b. You
can then check any string s against a+b+c+d,
