Boris Kolpackov <[EMAIL PROTECTED]> wrote on 05/21/2007 03:35:21 PM: > Michael Glavassevich <[EMAIL PROTECTED]> writes: > > > Looks like the same problem [1] Xerces-J has where the number of recursive > > calls to match() is proportional to the length of the input. If the string > > is too long the stack overflows. > > > > [1] https://issues.apache.org/jira/browse/XERCESJ-589 > > Wow, that bug was opened in Jan 2003 and it is still not fixed. Anyway, > I've created a Xerces-C++ equivalent and captured all the information > there: > > https://issues.apache.org/jira/browse/XERCESC-1708
The regex bug reports (at least in Xerces-J) tend to sit around for years because none of the current developers know this part of the code very well. Not that many of the former developers did either. I'd say this one is most likely to get fixed in the foreseeable future if someone from the community contributes a patch with some unit tests to help verify it. > thanks, > -boris > > > -- > Boris Kolpackov > Code Synthesis Tools CC > http://www.codesynthesis.com > Open-Source, Cross-Platform C++ XML Data Binding Michael Glavassevich XML Parser Development IBM Toronto Lab E-mail: [EMAIL PROTECTED] E-mail: [EMAIL PROTECTED]
