[Python-Dev] SRE 0.9.8 benchmarks (original) (raw)
Andrew Kuchling akuchlin@mems-exchange.org
Thu, 3 Aug 2000 08:22:44 -0400
- Previous message: [Python-Dev] SRE 0.9.8 benchmarks
- Next message: [Python-Dev] New SRE core dump (was: SRE 0.9.8 benchmarks)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Thu, Aug 03, 2000 at 10:27:39AM +0200, Fredrik Lundh wrote:
if it will ever be translated, that is...
I'll agree to take a shot at it (which carries no implication of actually finisihing :) ) post-2.0. It's silly for all of Tcl, Python, Perl to grow their own implementations, when a common implementation could benefit from having 3x the number of eyes looking at it and optimizing it.
fwiw, that pattern isn't portable:
No, it isn't; the straightforward implementation of repeated groups is recursive, and fixing this requires jumping through hoops to make it nonrecursive (or adopting Python's solution and only recursing up to some upper limit). re had to get this right because regex didn't crash on this pattern, and neither do recent Perls. The vast bulk of my patches to PCRE were to fix this problem.
--amk
- Previous message: [Python-Dev] SRE 0.9.8 benchmarks
- Next message: [Python-Dev] New SRE core dump (was: SRE 0.9.8 benchmarks)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]