RE: "Binary XML" proposals

[Danny Ayers <danny@panlanka.net>]

<- 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.

So don't be so hard on your /dev/hands, Oleg!