RE: ZDNet Schema article,and hiding complexity within user-friendlyproducts

["Bullard, Claude L (Len)" <clbullar@ingr.com>]

Or that stuff like this is scary reading on the face of it...

"A precise formulation of this constraint can also be offered in terms of
operations on finite-state automaton: transcribe the content model into an
automaton in the usual way using epsilon transitions for optionality and
unbounded maxOccurs, unfolding other numeric occurrence ranges and treating
the heads of substitution groups as if they were choices over all elements
in the group, but using not element QNames as transition labels, but rather
pairs of element QNames and positions in the model. Determinise this
automaton, treating wildcard transitions as opaque. Now replace all
QName+position transition labels with the element QNames alone. If the
result has any states with two or more identical-QName-labelled transitions
from it, or a QName-labelled transition and a wildcard transition which
subsumes it, or two wildcard transitions whose intentional intersection is
non-empty, the model does not satisfy the Unique Attribution constraint."

More money for Simon StL in his next book if he can condense that 
down to something understandable.  That really will be hiding the 
complexity.

Len 
http://www.mp3.com/LenBullard

Ekam sat.h, Vipraah bahudhaa vadanti.
Daamyata. Datta. Dayadhvam.h


-----Original Message-----
From: Gavin Thomas Nicol [mailto:gtn@ebt.com]

XML's success is at least partly due to it making things easier
for people... including those people with SGML systems. We should
remember that. This is what Len is reminding us of.