On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer <[email protected]> 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 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 > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe > > _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
