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 Michael Glavassevich XML Parser Development IBM Toronto Lab E-mail: [EMAIL PROTECTED] E-mail: [EMAIL PROTECTED] news <[EMAIL PROTECTED]> wrote on 05/18/2007 02:03:50 PM: > Hi Russell, > > "Russell Gulli" <[EMAIL PROTECTED]> writes: > > > Thanks for the quick reply. Xerces 2.7.0 exhibits the same behavior. > > > > One interesting point is that the Windows version of Xerces-C++ Version > > 2.3.0 does not crash when given the same document. It throws a parse > > exception instead of overflowing the stack (Note: same schema for > > Solaris and Windows)? > > Hm, that's strange. Can you provide a test case and file a bug report > (with the information above) so that this won't get missed: > > https://issues.apache.org/jira/secure/Dashboard.jspa > > Thanks! > > -boris > -- > Boris Kolpackov > Code Synthesis Tools CC > http://www.codesynthesis.com > Open-Source, Cross-Platform C++ XML Data Binding
