[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Type-assignment

• From: "K.Kawaguchi" <k-kawa@b...>
• To: Murata Makoto <mura034@a...>
• Date: Fri, 02 Feb 2001 10:08:27 -0800

> Well, this is a subjective issue.  You modified my algorithm so 

Right. My whole point is type assignment can be done on top of the
validator.


> Any ambiguous RELAX module can be disambiguated, I guess.  At least, 
> any tree regular language can be captured by an unambiguous tree regular 
> grammar.  (Hmm, subset construction certainly creates deterministic 

I think this may be a bit confusing.

You can "disambiguate" a grammar, only if you are allowed to alter
labels and roles. However, to alter them may change the entire label and
role of the schema, which is probably unacceptable.


> There are many ambiguity in computer science.  For example, a regular 

Ambiguity is defined in terms of interpretation. If you have two
interpretation, it's ambiguous. So you have as many ambiguities as the
definition of interpretation.


> I could not find it.  Which message are you talking about?  But we have 
> common understanding.


I think so too. But just in case you (or someone else reading this) need
it, it can be found at the following URL.

http://lists.xml.org/archives/xml-dev/200102/msg00036.html


regards,
----------------------
K.Kawaguchi
E-Mail: k-kawa@b...

• Follow-Ups:
  • Re: Type-assignment
    • From: Murata Makoto <mura034@a...>

• References:
  • Re: Type-assignment
    • From: "K.Kawaguchi" <k-kawa@b...>
  • Re: Type-assignment
    • From: Murata Makoto <mura034@a...>

• Prev by Date: Re: Type-assignment (was Re: Are we losing out because of grammars?)
• Next by Date: Re: XML versus Relational Database
• Previous by thread: Re: Type-assignment
• Next by thread: Re: Type-assignment
• Index(es):
  • Date
  • Thread