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

Issue 389 proposal

From: Jacek Kopecky <jacek@systinet.com>
Date: 17 Oct 2002 19:43:44 +0200
To: XMLP Dist App <xml-dist-app@w3.org>
Message-Id: <1034876624.4094.33.camel@krava>

Hi all, 8-)

this message aims to identify the places in the spec about which the
issue is concerned and it also contains the proposed replacement text.

Shortly, the issue is that the distinction between terminal and
non-terminal nodes in SOAP Data Model is unnecessary.

The original text is taken from the current editor's copy at 
http://www.w3.org/2000/xp/Group/2/06/LC/soap12-part2.html


Section 2.2:

<original>
A graph node is either a terminal graph node or a non-terminal graph
node. A non-terminal graph node has one or more outbound edges. A
terminal graph node has no outbound edges and an optional lexical value.
Both types of graph node have an optional type name of type xs:QName
(see [XML Schema Part2]). 
</original>

<proposed>
A graph node has zero or more outbound edges. A graph node that has no
outbound edges has an optional lexical value. All graph nodes have an
optional type name of type xs:QName (see [XML Schema Part2]). 
</proposed>


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.

A compound value is represented as a graph node with zero or more
outbound edges as follows:

        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>


Section 3.1.2:

<original>
The lexical value of a terminal graph node (simple value) is the
sequence of Unicode characters identified by the character information
item children of the element information item representing that node.

Note that certain Unicode characters cannot be represented in XML (see
[XML 1.0]). 
</original>

<proposed>
The lexical value of a graph node representing a simple value is the
sequence of Unicode characters identified by the character information
item children of the element information item representing that node.

Note that certain Unicode characters cannot be represented in XML (see
[XML 1.0]). 
</proposed>


That's all folks. 8-)

Best regards,

                   Jacek Kopecky

                   Senior Architect, Systinet Corporation
                   http://www.systinet.com/
Received on Thursday, 17 October 2002 13:43:46 GMT

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