On 27 jul 2010, at 09:30, Eugene Kirpichov wrote: > Perhaps this might mean that we can get incremental and parallel > regexp matching by associating each character with a linear operator
This is exactly what is happening in the uu-parsinglib. Doaitse > (matrix) over this or related semiring, or something, and mixing that > with two sigfpe's articles: > http://blog.sigfpe.com/2008/11/approach-to-algorithm-parallelisation.html > http://blog.sigfpe.com/2009/01/fast-incremental-regular-expression.html > > 2010/7/27 Sjoerd Visscher <sjo...@w3future.com>: >> >> On Jul 27, 2010, at 7:09 AM, Sebastian Fischer wrote: >> >>> I'll add >>> >>> noMatch :: RegExp c >>> noMatch = psym "[]" (const False) >> >> Oh, by the way, with noMatch, eps, alt and seq_ RegExp is itself a Semiring, >> but I'm not sure what that would do. >> -- >> Sjoerd Visscher >> http://w3future.com >> >> >> >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe@haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> > > > > -- > Eugene Kirpichov > Senior Software Engineer, > Grid Dynamics http://www.griddynamics.com/ > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe