[Regexp] Performance problem

[J Juan]

Hi:

I have not resolved following performance problem, I am posting this 
again to see if anyone may have solutions. Or if anyone can point me to 
the area in the source code that I can take a look at. Thanks.

Jay
============
I am using following pattern to match a string that is 3-63 characters 
long:
"^[A-Za-z0-9][A-Za-z0-9-]{1,61}[A-Za-z0-9]$"

If the test string is more than 18 characters long, the execution seems 
to run forever. It seems that the repetition
operator {1,61} is the problem. Is there any way to improve the 
performance? Thanks.