From: Urabe Shyouhei <shyouhei@...>
Date: 2009-08-01T14:49:11+09:00
Subject: Re: Slow regular-expression engine

--------------enig1CB15FC0861873FE7214C94D
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

Ben Bleything wrote:
> On Fri, Jul 31, 2009 at 9:50 AM, w_a_x_man<w_a_x_man@yahoo.com> 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 ...
>=20
> So what?  I'm sure Ruby core would be happy to consider a patch.

Yes we do.  And if you could write a time-efficient NFA engine with back
references implemented, please also send that to some scientific journal,=

because that should solve the P=3DNP problem.


--------------enig1CB15FC0861873FE7214C94D
Content-Type: application/pgp-signature; name="signature.asc"
Content-Description: OpenPGP digital signature
Content-Disposition: attachment; filename="signature.asc"

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAkpz10oACgkQuTXPUnA5eMJBWwCeOi4lMNxxGgTDxCl7OtXQ+ola
84gAnj6ubP72ahmhVkwtDP0l8ohc0fMT
=RtmJ
-----END PGP SIGNATURE-----

--------------enig1CB15FC0861873FE7214C94D--