Re: deterministic content model

[Kohsuke KAWAGUCHI <kohsuke.kawaguchi@eng.sun.com>]

> 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