[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: "Binary XML" proposals
- From: Christian Nentwich <email@example.com>
- To: Danny Ayers <firstname.lastname@example.org>
- Date: Tue, 10 Apr 2001 17:13:43 +0100
> <- It escapes me how code that has to eliminate whitespace, find element
> <- boundaries, match closing elements, etc. can be faster than your code.
> Put this way XML parsing does sound complex - but all you're really doing is
> matching a series of single characters and changing the state of some
> variables accordingly, storing some of the characters as needed. When a
> certain state is reached you call a handler. In processing terms it don't
> really have to do that much - certainly in the same league as Oleg's parser.
But isn't also true that you do not have to do this with a proper binary
format, and are therefore accessing fewer characters, in which case your
code will be faster? Probably not by a huge amount but it should be