Darren New <dne### [at] sanrrcom> wrote:
> Darren New wrote:
> > http://swtch.com/~rsc/regexp/regexp1.html

> Oh, and given that .NET compiles regular expression matches down to machine 
> code, I was really rather surprised to discover that it too exhibits 
> exponential runtime for the shown test expressions, even tho it doesn't need 
> to. I can't imagine why you'd go to the effort of having an option to 
> compile the thing to machine code if you're going to be too lazy to do the 
> trivial check it takes to determine whether you need a linear or exponential 
> algorithm.

  Well, consider who developed .NET.

  These are the same people who will not bother fixing their broken
C preprocessor even though they know it's broken (they have officially
stated that they won't fix it anytime soon).

-- 
                                                          - Warp

Post a reply to this message