W3C home > Mailing lists > Public > xml-dist-app@w3.org > October 2002

Re: Issue 389 proposal

From: Jacek Kopecky <jacek@systinet.com>
Date: 18 Oct 2002 10:17:16 +0200
To: Herve Ruellan <ruellan@crf.canon.fr>
Cc: XMLP Dist App <xml-dist-app@w3.org>
Message-Id: <1034929036.4748.4.camel@krava>

Herve,

I agree with the spirit of your first amendment, but I would rather say
"with optional lexical value" rather than saying the same indirectly.

The second amendment is IMHO wrong because that's exactly where the use
of 'non-terminal' was wrong - an array, for example, can be empty and
still be an array, in this case it would have zero outbound edges.

Best regards,

                   Jacek Kopecky

                   Senior Architect, Systinet Corporation
                   http://www.systinet.com/


On Fri, 2002-10-18 at 10:10, Herve Ruellan wrote:
[snip]
> > 
> > Section 2.3:
> > 
> > <original> 
> > A simple value is represented as a terminal graph node.
> > 
> > A compound value is represented as a non-terminal graph node as follows:
> > 
> >         1. A non-terminal graph node whose outbound edges are
> >            distinguished solely by their labels is known as a "struct".
> >            The outbound edges of a struct MUST be labeled with distinct
> >            names (see 2.1.1 Edge labels).
> >         2. A non-terminal graph node whose outbound edges are
> >            distinguished solely by position is known as an "array". The
> >            outbound edges of an array MUST NOT be labeled.
> > </original>
> > 
> > <proposed>
> > A simple value is represented as a graph node with a lexical value.
> 
> As in original a terminal graph node has an *optional* lexical value, I 
> would propose:
> <friendlyAmendment>
> A simple value is represented as a graph node with no outbound edges.
> </friendlyAmendment>
> 
> > A compound value is represented as a graph node with zero or more
> > outbound edges as follows:
> 
> The definition of non-terminal graph node says *one* or more outbound 
> edges, so I propose:
> <friendlyAmendment>
> A compound value is represented as a graph node with one or more 
> outbound edges as follows:
> </friendlyAmendment>
> 
> >         1. A graph node whose outbound edges are distinguished solely by
> >            their labels is known as a "struct". The outbound edges of a
> >            struct MUST be labeled with distinct names (see 2.1.1 Edge
> >            labels).
> >         2. A graph node whose outbound edges are distinguished solely by
> >            position is known as an "array". The outbound edges of an
> >            array MUST NOT be labeled.
> > </proposed>
> > 
> [ snip ]
Received on Friday, 18 October 2002 04:17:23 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:59:11 GMT