Re: deterministic content model

[Murali Mani <mani@CS.UCLA.EDU>]

I think there is a *very* obvious solution for keys if you have
unambiguous grammars. But there very well could be a *very* clean solution
for keys even if we allow ambiguous grammars.

This I think is very important to study -- I think we cannot get much
further in defining operations for document processing if we base the
operations on XML Schema.

<warning>speaking for himself only</warning>

cheers - murali.

On Tue, 17 Apr 2001, Kohsuke KAWAGUCHI wrote:

>
> > I think what we need for handling key constraints easily is non-ambiguous
> > regular tree grammars,
>
> Agreed in the sense that key/keyref constraint is enforceable only under
> non-ambiguous grammars.
>
>
> > I think we should get around this a little bit -- there could be multiple
> > solutions -- first check whether we can ensure that when we have to
> > specify key constraints (I think results of document processing do not
> > need to specify key constraints), therefore I tentatively believe that we
> > need key constraints only for the initial data modeling part, then there
>
> Ummm. I can't get this...
>
> Are you saying that deterministic grammar makes enforcement of
> key/keyref constraint easy because it is guaranteed to be unambiguous?
>
> Or is there something more?
>
>
> --
> Kohsuke KAWAGUCHI                          +1 650 786 0721
> Sun Microsystems                   kohsuke.kawaguchi@eng.sun.com
>
>