Michael Glavassevich <mrglavas@xxxxxxxxxx> 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
thanks,
-boris
--
Boris Kolpackov
Code Synthesis Tools CC
http://www.codesynthesis.com
Open-Source, Cross-Platform C++ XML Data Binding
|
