recursion in XML parser

[xml]

By XML-recommendations in non-validating mode are you talking about
the section on conformance in the XML spec (page 24)?

I assume not... where would I find this?                

I can see that on a Pentium 300 you wouldn't notice the function call
overhead/stack framing for recursive processing.  Thanks.  My own
experience using the Java XML frameworks is that they are slow.  There
may be some that aren't.  I'm [for now] living under the assumption that
for a large dataset, Java will be slow because of all of the string
handling and internal pointer frenzy that the VM is handling for you.

Then again, it's entirely possible that for instance if you use the
new collection classes, that the underlying implementation is written
in C and there would be a limit to the performance tradeoffs.

One nice feature that using JDBC and related technologies for data 
handling in Java is that Java itself doesn't have to manipulate the
[possibly large] datasets.  For a given XML "pure Java" implementation
of an XML parser it seems that there are going to be problems manipulating
datasets of epic proportions.

I noticed delays when processing the Richard II xml document [famous]
in Java frameworks.  That document is around 300kb of XML.

It's interesting to know that you've done both a recursive and non-
recursive XML parser.  Thanks for your response,

Thomas

xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo at ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)