Wolfgang N?dasi-Donner wrote:

>When I look at this parts of your Regex,  I see constructs like (a*|b*)* - These constructs consume some
>billion of years if applied to a string where no match is possible. Take a closer look to "the Friedl" for
>avoiding situations like this.
>  
>
Hello,

I am sure this regex is far from being optimized as I am really no
expert in regular expressions. It is also more like the kind of script
that only gets executed once.

But I do pass the regex onto thousands of lines and many of those do not
match. The not-matching happens very fast (hundreds of phrases treated
per second) - until that specific one.

Best regards,
Adrian.