Re: Slow regular-expression engine

On Fri, Jul 31, 2009 at 9:50 AM, w_a_x_man<w_a_x_man@xxxxxxxxx> wrote:
> Quoting the article:
>
>  ... it is possible to write so-called "pathological" regular
>  expressions that Perl matches very very slowly. In contrast,
>  there are no regular expressions that are pathological for
>  the Thompson NFA implementation. Seeing the two graphs side
>  by side prompts the question, "why doesn't Perl use the
>  Thompson NFA approach?" It can, it should ...

So what?  I'm sure Ruby core would be happy to consider a patch.

Ben