From: Alun ap Rhisiart <lists@...>
Date: 2002-03-03T21:30:08+09:00
Subject: Re: Ruby Regular Expression problem

I think he just means that this is a classical problem for a regex 
engine, and takes a _very_ long time
to complete, or not, depending on the architecture of the engine. It is 
given in 'Mastering Regular Expressions' as
a test of what kind of engine is in use. It is some time since I read 
it, but if the regex doesn't complete fairly quickly, then
it is a 'POSIX-compliant Traditional' engine (NPL), am I remembering 
that right? Anyway, I think Sergei's point is a valid one:
given that there are regex engines out there that find the result 
reliably and quickly, perhaps Ruby's might use such an architecture
for v2? (Easy for me to say, as I dare say I won't be writing it). I 
don't remember all the argument for-and-against the different engine 
types
though.

Alun

On Sunday, March 3, 2002, at 10:38  am, Olonichev Sergei wrote:

> ...
>> Any other NP-complete problems Ruby should solve while it's at it?
> ...
>> [snip]
>
> Don't understand what are these messages have to do with the problem.
> I also love Ruby very much and appreciate Matz's work as well.
>
> But I think it is ALWAYS better to report the problem than avoid it.
>
> BR,
> Sergei