recursion in XML parser

[David Brownell]

Didier PH Martin wrote:
> 
> David Megginson wrote:
>
> > Let's assume, then, that XML parsing occupies 10% of your
> > application's overhead.  Even if you could build a parser that is
> > 1000% faster, you'd still gain only 9% in actual execution speed.

Which, by the by, is a fairly common tradeoff in distributed
systems ... except that parsing data generally takes a lot LESS
than 10% of the application overhead.  I can't see XML changing
that equation a heck of a lot.

Also, in the big picture, execution speed is not the only important
factor in system development.  It's often important to have the system
done twice as fast (a number of studies have shown that Java programmers
are twice as productive as C/C++ ones), or be more stable when it's been
declared "feature complete" (e.g. no pointer smashes).


> 	 The state of the art for
> Java may change in the future as soon as other players like HP, Novell and
> IBM bring to the table their own technology and that Java would finally have
> the same competitive environment as other languages have.

And Sun, too.  One should also keep in mind that C based systems have been
evolving for 20+ years at this point, vs a lot less for Java.

- Dave

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)