You were there in Prague, weren't you Michael?
Anyway, it should work with several caveats; I looked into it at that
time and found it useful for a restricted set of XML schema files.
Main purpose was schema differencing, though.
-W
On 06/12/2011, Michael Kay <mike(_at_)saxonica(_dot_)com> wrote:
On 06/12/2011 15:38, Wolfgang Laun wrote:
Anthony B. Coates presented "'Full Impact' Schema differencing" at XML
Prague 2010. It uses a thing called XML Zebra, available from
http://www.xmlzebra.com, to generate all XPaths from an XML Schema.
The number of paths that can find a non-empty result is of course
infinite. Even if you confine yourself to paths using the child and
attribute axes, the number of possible paths is infinite if the schema
is recursive. That doesn't mean that you can't represent this infinite
set in some way, or compute it in a finite time; just don't expect the
answer to be a simple list of permitted path expressions.
Michael Kay
Saxonica
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail:
<mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--