[Mono-bugs] [Bug 72989][Blo] Changed - Stack overflw in RegularExpression parsing

[bugzilla-daemon@bugzilla.ximian.com]

Please do not reply to this email- if you want to comment on the bug, go to the
URL shown below and enter your comments there.

Changed by eyala@mainsoft.com.

http://bugzilla.ximian.com/show_bug.cgi?id=72989

--- shadow/72989	2005-02-24 18:51:23.000000000 -0500
+++ shadow/72989.tmp.29382	2005-02-25 07:18:55.000000000 -0500
@@ -102,6 +102,18 @@
         }
     }
 }
 
 ------- Additional Comments From gonzalo@ximian.com  2005-02-24 18:51 -------
 Probably a duplicate of bug #60550
+
+------- Additional Comments From eyala@mainsoft.com  2005-02-25 07:18 -------
+This indeed the same as bug #60550. The attached sample should be 
+more consistent in reproduction since you can easily configure the 
+size of the matched string.
+The problem comes from the nature of the implementation which is VERY 
+recursive and creates a stack of hundreds of calls for simple cases 
+and in the atached case with a param of "100" the stack depth 
+necessary is probably 10K calls.
+A modification of the implementation to use a loop instead of 
+recursion in several key places will probably prevent the stack 
+overflow.