[
Lists Home |
Date Index |
Thread Index
]
Michael Champion wrote:
> I think the argument is that -- unlike Binary XML -- VTD *is* XML,
> plus a little hint to a downstream parser on where the markup
> boundaries are. Those downstream processes (on the same machine or
> different, whatever can be made to work) can use the hint or ignore
> it, whatever suits their needs.
I'm not willing to give up well-formedness checking at application
boundaries, and I'm afraid a lot of the Eviscerated XML Interchange
proposals do exactly that.
What would be interesting is if it were possible to conclusively verify
the well-formedness of an XML document using its VTD in a much faster
way than just parsing the XML itself. That is, could one verify that the
VTD could only match a well-formed XML document, and then verify that
the VTD indeed does match the XML document it's bundled with? and could
one do this more quickly than one could parse the XML document itself?
i.e. could the VTD hint the verification process enough that checking
well-formed documents becomes noticeably faster while malformed
documents are still detected? I don't know the answer to that question;
but if it were answered in the affirmative that might be really useful.
--
Elliotte Rusty Harold elharo@metalab.unc.edu
XML in a Nutshell 3rd Edition Just Published!
http://www.cafeconleche.org/books/xian3/
http://www.amazon.com/exec/obidos/ISBN=0596007647/cafeaulaitA/ref=nosim
|
