Re: TREX TC minutes from 2001-04-19

> If two non-terminals compete and cannot be distinguished from the 
> context, we can use their union for specifying key/keyref constraints.  

Yes, that would be another option.


> Does your algorithm (posted to xml-dev) detect such non-terminal pairs?  

No. To apply to the new language, my algorithm needs more work. It will
be more complex due to the way TREX handles attributes.

If asked, I would like to check this by first converting it to
tree regular language and then apply my algorithm --- this would be much
simpler and at least this would be sound.


--
Kohsuke KAWAGUCHI                          +1 650 786 0721
Sun Microsystems