Regular Expression Parsing via derivatives

Hi Haskell people, I've been snooping through various mailing lists and the current Haskell implementation of regular expressions and I was wondering if there has been a discussion about implementing regex parsing with derivatives. If so, I haven't seen it. If not, I'd like to have a discussion about it -- if for no other reason than to decide whether I should implement it as a library, or (to attempt to implement it) as a core feature. For those of you who don't know, recent work by Might and Daraishttp://arxiv.org/abs/1010.5023indicates that parsing CFGs can be done better ( *i.e.*, significantly faster) than more "traditional" approacheshttp://swtch.com/%7Ersc/regexp/regexp1.html. Might's presenting at ICFP later in September about it. I guess the first thing I should ask is, which mailing list is actually the right place to field this inquiry. I considered dropping it in the main haskell list, but wasn't sure how people would respond. -- Alex

On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer
Hi Haskell people,
I've been snooping through various mailing lists and the current Haskell implementation of regular expressions and I was wondering if there has been a discussion about implementing regex parsing with derivatives. If so, I haven't seen it. If not, I'd like to have a discussion about it -- if for no other reason than to decide whether I should implement it as a library, or (to attempt to implement it) as a core feature.
For those of you who don't know, recent work by Might and Darais indicates that parsing CFGs can be done better (i.e., significantly faster) than more "traditional" approaches. Might's presenting at ICFP later in September about it.
I guess the first thing I should ask is, which mailing list is actually the right place to field this inquiry. I considered dropping it in the main haskell list, but wasn't sure how people would respond.
This is probably the right list to ask. I don't know much about the topic, a a quick Google search turned up: http://hackage.haskell.org/package/regex-pderiv which has the right keywords. More discussion on related (or not!) here: 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 Antoine
-- Alex
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

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.
That's too bad, but thanks for the helpful response!
On Mon, Aug 1, 2011 at 12:26 PM, Antoine Latter
Hi Haskell people,
I've been snooping through various mailing lists and the current Haskell implementation of regular expressions and I was wondering if there has been a discussion about implementing regex parsing with derivatives. If so, I haven't seen it. If not, I'd like to have a discussion about it -- if for no other reason than to decide whether I should implement it as a library, or (to attempt to implement it) as a core feature.
For those of you who don't know, recent work by Might and Darais indicates that parsing CFGs can be done better (i.e., significantly faster) than more "traditional" approaches. Might's presenting at ICFP later in September about it.
I guess the first thing I should ask is, which mailing list is actually
On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer
wrote: the right place to field this inquiry. I considered dropping it in the main haskell list, but wasn't sure how people would respond.
This is probably the right list to ask.
I don't know much about the topic, a a quick Google search turned up:
http://hackage.haskell.org/package/regex-pderiv
which has the right keywords.
More discussion on related (or not!) here:
Antoine
-- Alex
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Alex

On Mon, 2011-08-01 at 12:38 -0400, Alex Clemmer wrote:
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.
Right... the only regular expression support for Haskell at all comes in the form of libraries. One of the nice things about Haskell is how little has to be built in to the language. -- Chris Smith

Hi,
In regex-pderiv, we gave a practical implementation of regex matching using
partial derivative.
But of course we could easy write one which using brzozoski's derivative,
but some simplification is required other wise
there are infinitely many states. Probably Martin has an implementation
somewhere.
Regards,
Kenny
On Tue, Aug 2, 2011 at 12:38 AM, Alex Clemmer
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.
That's too bad, but thanks for the helpful response!
On Mon, Aug 1, 2011 at 12:26 PM, Antoine Latter
wrote: Hi Haskell people,
I've been snooping through various mailing lists and the current Haskell implementation of regular expressions and I was wondering if there has been a discussion about implementing regex parsing with derivatives. If so, I haven't seen it. If not, I'd like to have a discussion about it -- if for no other reason than to decide whether I should implement it as a library, or (to attempt to implement it) as a core feature.
For those of you who don't know, recent work by Might and Darais indicates that parsing CFGs can be done better (i.e., significantly faster) than more "traditional" approaches. Might's presenting at ICFP later in September about it.
I guess the first thing I should ask is, which mailing list is actually
On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer
wrote: the right place to field this inquiry. I considered dropping it in the main haskell list, but wasn't sure how people would respond.
This is probably the right list to ask.
I don't know much about the topic, a a quick Google search turned up:
http://hackage.haskell.org/package/regex-pderiv
which has the right keywords.
More discussion on related (or not!) here:
Antoine
-- Alex
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Alex
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Am 01.08.2011 17:51, schrieb Alex Clemmer:
Hi Haskell people,
I've been snooping through various mailing lists and the current Haskell implementation of regular expressions and I was wondering if there has been a discussion about implementing regex parsing with derivatives. If so, I haven't seen it. If not, I'd like to have a discussion about it -- if for no other reason than to decide whether I should implement it as a library, or (to attempt to implement it) as a core feature.
For those of you who don't know, recent work by Might and Darais http://arxiv.org/abs/1010.5023 indicates that parsing CFGs can be done
The paper refers to http://hackage.haskell.org/package/derp C.
better (/i.e./, significantly faster) than more "traditional" approaches http://swtch.com/%7Ersc/regexp/regexp1.html. Might's presenting at ICFP later in September about it.
I guess the first thing I should ask is, which mailing list is actually the right place to field this inquiry. I considered dropping it in the main haskell list, but wasn't sure how people would respond.
-- Alex
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
participants (5)
-
Alex Clemmer
-
Antoine Latter
-
Chris Smith
-
Christian Maeder
-
kenny lu