To All, I have a question whether I can use PSVI for an algorithm I have in mind...
My goal is to take the content model from XSD schema documents and transform it into an ordered graph/tree that can be used to serialize application data in the order corresponding to the content model. If the schema's content model changes then the algorithm automatically rebuilds the graph/tree to for serialization. I understand what to do in general if I already have an in memory graph/tree structure of the schema content model: rely on the ordering of the graph/tree nodes in a depth first search to write out application data that corresponds to each node in the graph/tree. I may need to do a topological sort first on the graph, but that is really just a detail. What I don't understand is how to transform an XSD schema document, with all its verbose structures, into a simple directed acyclic graph (or tree) of element identifiers that mimics the content model. Basically I would build something that looks like an instance document and not an XSD document, or I would build an in memory graph of the same purpose. Can the PSVI interfaces/classes be used to just parse an XSD schema without having to parse an instance document? And if so, somehow, can the PSVI classes then be used to create a simple mirror of the content model? I have a feeling that I may need to do a two step process here: use XSLT to transform the XSD to a simple model, then build the in memory representation from the simplified model. If someone can opine here I will appreciate it greatly. Yours, Elisha Berns [EMAIL PROTECTED] tel. (310) 556 - 8332 fax (310) 556 - 2839 --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
