Home. 
.

transparent

transparent

transparent

Altova Mailing List Archives


Re: the UPA-constraint and danish word division

From: C.M.Sperberg-McQueen <cmsmcq@---.--->
To: noah_mendelsohn@--.---.---
Date: 9/20/2006 3:25:00 AM

On 20 Sep 2006, at 06:21 , noah_mendelsohn@u... wrote:


>
> So I think the right question isn't:  would there be useful  
> grammars you
> can't write today that you could write if UPA were eliminated.  The  
> answer
> is clearly yes.  I think it's also clearly useful at times to build
> schema-driven or certainly schema-aware editing systems.  The  
> question is
> whether the advantages of expressing your application constraints  
> exactly
> in the schema language outweigh the advantages that some (though  
> not all)
> users of schema and implementors of validators derive from the strict
> particle to instance matching that's given by UPA.

That would be a more persuasive argument if, at some point over
the past twenty years, anyone had actually identified any advantages.
So far, I haven't  heard anything that I believe actually counts as an
advantage, still less an advantage strong enough to outweigh the
disadvantage of not being able to express regular languages in
a content model.

Your quotation from the spec seems to me to apply with even more
force to those people who wish to preserve UPA for the sake of
applications they believe that someone, someday, might write, that
could surely, surely derive benefit from UPA.  The schema language
doesn't need to be all things to all people.  But it could do with  
dropping
a constraint which has no demonstrated benefit but plenty of
demonstrated problems:  the absence of closure properties, the
well known difficulty in maintaining or revising schemas, difficulty in
adding wildcards where one wants them, and the divergence from well
known automata theory, so that instead of looking up algorithms and
theorems and properties in textbooks, implementers get to play
computer scientist and derive them from scratch for a language which
is similar to, but not quite, the same as, regular expressions.

The fact that other schema languages manage perfectly well without
requiring deterministic content models seems to me to show pretty
clearly that the determinism rules are not actually necessary in  
practice,
any more than they are in theory.

--CMSMcQ


From debora.vanni@t... Thu Sep 21 14:29:45 2006
Received: from aji.w3.org ([


transparent
Print
Mail
Digg
delicious
Disclaimer
.

These Archives are provided for informational purposes only and have been generated directly from the Altova mailing list archive system and are comprised of the lists set forth on www.altova.com/list/index.html. Therefore, Altova does not warrant or guarantee the accuracy, reliability, completeness, usefulness, non-infringement of intellectual property rights, or quality of any content on the Altova Mailing List Archive(s), regardless of who originates that content. You expressly understand and agree that you bear all risks associated with using or relying on that content. Altova will not be liable or responsible in any way for any content posted including, but not limited to, any errors or omissions in content, or for any losses or damage of any kind incurred as a result of the use of or reliance on any content. This disclaimer and limitation on liability is in addition to the disclaimers and limitations contained in the Website Terms of Use and elsewhere on the site.

.
.

transparent

transparent