Hi,<div><br></div><div>In regex-pderiv, we gave a practical implementation of regex matching using partial derivative. </div><div>But of course we could easy write one which using brzozoski's derivative, but some simplification is required other wise</div>
<div>there are infinitely many states. Probably Martin has an implementation somewhere.</div><div><br></div><div>Regards,</div><div>Kenny</div><div><br></div><div><br></div><div><div class="gmail_quote">On Tue, Aug 2, 2011 at 12:38 AM, Alex Clemmer <span dir="ltr"><<a href="mailto:clemmer.alexander@gmail.com">clemmer.alexander@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hmm. Not sure how I missed that. And, I also inquired about developing a "core featre" instead of a library -- implying disparity where in retrospect there doesn't appear to be any.<br>
<br>That's too bad, but thanks for the helpful response!<div><div></div><div class="h5"><br>
<br><div class="gmail_quote">On Mon, Aug 1, 2011 at 12:26 PM, Antoine Latter <span dir="ltr"><<a href="mailto:aslatter@gmail.com" target="_blank">aslatter@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div><div></div><div>On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer<br>
<<a href="mailto:clemmer.alexander@gmail.com" target="_blank">clemmer.alexander@gmail.com</a>> wrote:<br>
> Hi Haskell people,<br>
><br>
> I've been snooping through various mailing lists and the current Haskell<br>
> implementation of regular expressions and I was wondering if there has been<br>
> a discussion about implementing regex parsing with derivatives. If so, I<br>
> haven't seen it. If not, I'd like to have a discussion about it -- if for no<br>
> other reason than to decide whether I should implement it as a library, or<br>
> (to attempt to implement it) as a core feature.<br>
><br>
> For those of you who don't know, recent work by Might and Darais indicates<br>
> that parsing CFGs can be done better (i.e., significantly faster) than more<br>
> "traditional" approaches. Might's presenting at ICFP later in September<br>
> about it.<br>
><br>
> I guess the first thing I should ask is, which mailing list is actually the<br>
> right place to field this inquiry. I considered dropping it in the main<br>
> haskell list, but wasn't sure how people would respond.<br>
><br>
<br>
</div></div>This is probably the right list to ask.<br>
<br>
I don't know much about the topic, a a quick Google search turned up:<br>
<br>
<a href="http://hackage.haskell.org/package/regex-pderiv" target="_blank">http://hackage.haskell.org/package/regex-pderiv</a><br>
<br>
which has the right keywords.<br>
<br>
More discussion on related (or not!) here:<br>
<br>
<a href="http://www.google.com/search?q=Regular+Expression+derivative+haskell&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:unofficial&client=firefox-a" target="_blank">http://www.google.com/search?q=Regular+Expression+derivative+haskell&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:unofficial&client=firefox-a</a><br>
<br>
Antoine<br>
<br>
> --<br>
> Alex<br>
><br>
><br>
> _______________________________________________<br>
> Haskell-Cafe mailing list<br>
> <a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
> <a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
><br>
><br>
</blockquote></div><br><br clear="all"><br></div></div>-- <br><font color="#888888">Alex<br><br>
</font><br>_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
<br></blockquote></div><br></div>