Copyright © 2002 W3C® (MIT, INRIA, Keio), All Rights Reserved. W3C liability, trademark, document use, and software licensing rules apply.
XPath is a language for addressing parts of an XML document.
This is a public W3C Working Draft for review by W3C Members and other interested parties. This section describes the status of this document at the time of its publication. It is a draft document and may be updated, replaced, or made obsolete by other documents at any time. It is inappropriate to use W3C Working Drafts as reference material or to cite them as other than "work in progress." A list of current public W3C technical reports can be found at http://www.w3.org/TR/.
This document is the result of joint work by the XSL and XML Query Working Groups, which are jointly responsible for XPath 2.0, a language derived from both XPath 1.0 and XQuery. The XPath 2.0 and XQuery 1.0 Working Drafts are generated from a common source. These languages are closely related, sharing much of the same expression syntax and semantics, and much of the text found in the two Working Drafts is identical.
This version of the document contains new details about the type system of XPath, including a syntax for declaring types in function signatures and other expressions. It describes the semantics of several expressions that operate on types, including treat
, assert
, and validate
expressions. It also describes in greater detail the semantics of element and attribute constructors and how they operate on the underlying data model.
This document is a work in progress. It contains many open issues, and should not be considered to be fully stable. Vendors who wish to create preview implementations based on this document do so at their own risk. While this document reflects the general consensus of the working groups, there are still controversial areas that may be subject to change.
Public comments on this document and its open issues are welcome. Of particular interest are comments on error handling (see issues 97 and 98.) Comments should be sent to the W3C XPath/XQuery mailing list, public-qt-comments@w3.org (archived at http://lists.w3.org/Archives/Public/public-qt-comments/).
XPath 2.0 has been defined jointly by the XML Query Working Group (part of the XML Activity) and the XSL Working Group (part of the Style Activity).
1 Introduction
2 Expressions
2.1 Basics
2.1.1 Expression Context
2.1.1.1 Static Context
2.1.1.2 Evaluation Context
2.1.1.3 Input Functions
2.1.2 Expression Processing
2.1.2.1 Document Order
2.1.2.2 Typed Value
2.1.3 Types
2.1.3.1 Type Checking
2.1.3.2 SequenceType
2.1.3.3 Type Conversions
2.1.3.4 Fallbacks
2.2 Primary Expressions
2.2.1 Literals
2.2.2 Variables
2.2.3 Parenthesized Expressions
2.2.4 Function Calls
2.2.5 Comments
2.3 Path Expressions
2.3.1 Steps
2.3.1.1 Axes
2.3.1.2 Node Tests
2.3.2 Qualifiers
2.3.2.1 Predicates
2.3.2.2 Dereferences
2.3.3 Unabbreviated Syntax
2.3.4 Abbreviated Syntax
2.4 Sequence Expressions
2.4.1 Constructing Sequences
2.4.2 Combining Sequences
2.5 Arithmetic Expressions
2.6 Comparison Expressions
2.6.1 Value Comparisons
2.6.2 General Comparisons
2.6.3 Node Comparisons
2.6.4 Order Comparisons
2.7 Logical Expressions
2.8 For Expressions
2.9 Conditional Expressions
2.10 Quantified Expressions
2.11 Expressions on Datatypes
2.12 Validate Expressions
A Complete BNF
A.1 Grammar
A.2 Precedence Order
A.3 Lexical structure
A.3.1 Lexical States
B Type Promotion and Operator Mapping
B.1 Type Promotion
B.2 Operator Mapping
C References
C.1 Normative References
C.2 Non-normative References
C.3 Background References
C.4 Informative Material
D Glossary
E Conformance
F Backwards Compatibility with
XPath 1.0 (Non-Normative)
G XPath 2.0 and XQuery 1.0
Issues (Non-Normative)
H Revision
Log (Non-Normative)
H.1 10 Apr 2002
H.2 20 Dec
2001
The primary purpose of XPath is to address parts of an [XML] document. XPath uses a compact, non-XML syntax to facilitate use of XPath within URIs and XML attribute values. XPath operates on the abstract, logical structure of an XML document, rather than its surface syntax. This logical structure is known as the data model, and is described in the [XQuery 1.0 and XPath 2.0 Data Model] document. XPath gets its name from its use of a path notation as in URLs for navigating through the hierarchical structure of an XML document.
XPath is designed to be embedded in a host language such as [XSLT 2.0] or [XQuery]. XPath has a natural subset that can be used for matching (testing whether or not a node matches a pattern); this use of XPath is described in [XSLT 2.0].
XQuery Version 1.0 contains XPath Version 2.0 as a subset. Any expression that is syntactically valid and executes successfully in both XPath 2.0 and XQuery 1.0 will return the same result in both languages. Since these languages are so closely related, their grammars and language descriptions are generated from a common source to ensure consistency, and the editors of these specifications work together closely.
XPath also depends on and is closely related to the following specifications:
The XPath data model defines the information in an XML document that is available to an XPath processor. The data model is defined in [XQuery 1.0 and XPath 2.0 Data Model].
The static and dynamic semantics of XPath are formally defined in [XQuery 1.0 Formal Semantics]. This is done by mapping the full XPath language into a "core" subset for which the semantics is defined. This document is useful for implementors and others who require a rigorous definition of XPath. [Ed. Note: The current edition of [XQuery 1.0 Formal Semantics] has not incorporated recent language changes; it will be made consistent with this document in its next edition.]
The library of functions and operators supported by XPath is defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].
[Ed. Note: A future version of this document will include links between terms (in bold font) and their definitions.]
The basic building block of XPath is the expression. The language provides several kinds of expressions which may be constructed from keywords, symbols, and operands. In general, the operands of an expression are other expressions. XPath is a functional language which allows various kinds of expressions to be nested with full generality. It is also a strongly-typed language in which the operands of various expressions, operators, and functions must conform to designated types.
Like XML, XPath is a case-sensitive language. All keywords in XPath use lower-case characters.
[2] | Expr | ::= | OrExpr
| AndExpr | ForExpr | QuantifiedExpr | IfExpr | GeneralComp | ValueComp | NodeComp | OrderComp | InstanceofExpr | RangeExpr | AdditiveExpr | MultiplicativeExpr | UnionExpr | IntersectExceptExpr | UnaryExpr | ValidateExpr | CastExpr | RootedPathExpr | RelativePathExpr | PrimaryExpr | StepExpr |
Note:
For the grammar productions in the main body of this document, the same Basic EBNF notation is used as in [XML], except that grammar symbols always have initial capital letters. The EBNF contains only non-terminals, and all terminal tokens are expanded for readability. Whitespace is not represented. A normative version of the EBNF that includes tokens and token states is presented in the appendix [A Complete BNF].
Note:
The use of a prefix token ":" is allowed on unprefixed QNames to
visually distinguish tokens that are spelled the same as keywords. For
instance, the following is a path expression containing the element names
"for", "if", and "return": :for/:if/:return
.
The value of an expression is either a sequence or the error value. A
sequence is an ordered collection of zero or more items. An
item is either an atomic value or a node. An atomic
value is a value in the value space of an XML Schema atomic
type, as defined in [XML Schema] (that is, a simple type that is
not a list type or a union type). A node conforms to one of the
seven node kinds described in [XQuery 1.0 and XPath 2.0 Data Model]. Some
kinds of nodes have typed values, string values, and names, which can be
extracted from the node. The typed value of a node is a sequence
of zero or more atomic values. The string value of a node is a
value of type xs:string
. The name of a node is a value of type xs:QName
.
Error is a special value indicating that an error has been encountered during the evaluation of an expression. Except as noted in this document, if any operand of an expression is the error value, the value of the expression is also the error value.
A sequence containing exactly one item is called a singleton sequence. An item is identical to a singleton sequence containing that item. Sequences are never nested--for example, combining the values 1, (2, 3), and ( ) into a single sequence results in the sequence (1, 2, 3). A sequence containing zero items is called an empty sequence.
In this document, the namespace prefixes xs:
and xsi:
are considered to be bound to the XML Schema namespaces http://www.w3.org/2001/XMLSchema
and http://www.w3.org/2001/XMLSchema-instance
, respectively (as described in [XML Schema]), and the prefix xf:
is considered to be bound to the namespace of XPath/XQuery functions
and operators, http://www.w3.org/2002/04/xquery-operators
(described in [XQuery 1.0 and XPath 2.0 Functions and Operators]). In some cases, where the meaning is clear and namespaces are not important to the discussion, built-in XML Schema typenames such as integer
and string
will be used without a namespace prefix.
The expression context for a given expression consists of all the information that can affect the result of the expression. This information is organized into two categories called the static context and the evaluation context.
This section describes the context information used by XPath expressions, including the functions in the core function library. Other functions, outside the core function library, may require additional context information.
The static context of an expression is defined as all information that is available during static analysis of the expression, prior to its evaluation. This information can be used to decide whether the expression contains a static error.
XPath requires the information in the static context to be provided by the language environment in which the expression is being processed. Static context consists of the following components:
Type exception policy. This is one of the values strict
or flexible
. The value indicates the action that should be taken when a type
exception is raised. If the policy is strict
, the error value will be returned. If the policy is flexible
, then a fallback conversion will be invoked; the error value will be returned only if the fallback conversion fails.
In-scope namespaces. This is a set of (prefix, URI) pairs. The in-scope namespaces are used for resolving prefixes used in QNames within the expression.
Default namespace for element and type names. This is a namespace URI. This namespace is used for any unprefixed QName appearing in a position where an element or type name is expected.
Default namespace for function names. This is a namespace URI. This namespace is used for any unprefixed QName appearing as the function name in a function call.
In-scope schema definitions. This is a set of (QName, type definition) pairs. It defines the set of types that are available for reference within the expression. It includes the built-in schema types and all globally-declared types in imported schemas.
In-scope variables. This is a set of (QName, type) pairs. It defines the set of variables that have been declared and are available for reference within the XPath expression. The QName represents the name of the variable, and the type represents its static data type.
In-scope functions. This is a set of (QName, function signature) pairs. It defines the set of functions that are available to be called from within the expression. The QName represents the name of the function, and the function signature specifies the static types of the function parameters and function result.
In-scope collations. This is a set of (URI, collation) pairs. It defines the names of the collations that are available for use in function calls that take a collation name as an argument. A collation may be regarded as an object that supports two functions: a function that given a set of strings, returns a sequence containing those strings in sorted order; and a function that given two strings, returns true if they are considered equal, and false if not.
Default collation. This is a collation. This collation is used by string comparison functions when no explicit collation is specified.
Base URI. This is an absolute URI, used by the xf:document
function when resolving the relative URI of a document to be loaded, if
no explicit base URI is supplied in the function call.
The evaluation context of an expression is defined as information that is available at the time the expression is evaluated. The evaluation context consists of all the components of the static context, and the additional components listed below.
The first four components of the dynamic context (context item, context position, context size, and context document) are called the focus of the expression. The focus enables the processor to keep track of which nodes are being processed by the expression.
The focus for the outermost expression is supplied by the
environment in which the expression is evaluated. Certain language constructs,
notably the path expression E1/E2
, the filter expression E1[E2]
, and the ordering expression E1 sortby E2
, create a new focus for the evaluation of a sub-expression. In these constructs, E2
is evaluated once for each item in the sequence that results from
evaluating E1
. Each time E2
is evaluated, it is evaluated with a different focus. The focus for
evaluating E2
is referred to below as the inner focus, while the focus
for evaluating E1
is referred to as the outer focus. The inner focus exists
only while E2
is being evaluated. When this evaluation is complete, evaluation of the
containing expression continues with its original focus unchanged.
[Ed. Note: See issue 216.]
The context item is the item currently being
processed. An item is either an atomic value or a node. When the context item
is a node, it can also be referred to as the context node. The
context item is returned by the expression ".
". When an expression E1/E2
, E1[E2]
or E2 sortby E2
is evaluated, each item in the sequence obtained by evaluating E1
becomes the context item in the inner focus for an evaluation of E2
.
The context position is the position of the context
item within the sequence of items currently being processed. It changes
whenever the context item changes. Its value is always an integer greater than
zero. The context position is returned by the expression position()
. When an expression E1/E2
, E1[E2]
, or E1 sortby E2
is evaluated, the context position in the inner focus for an
evaluation of E2
is the position of the context item in the sequence obtained by
evaluating E1
. The position of the first item in a sequence is always 1 (one). The
context position is always less than or equal to the context size.
The context size is the number of items in the
sequence of items currently being processed. Its value is always an integer
greater than zero. The context size is returned by the expression last()
. When an expression E1/E2
, E1[E2]
, or E1 sortby E2
is evaluated, the context size in the inner focus for an
evaluation of E2
is the number of items in the sequence obtained by evaluating E1
.
The context document is the document currently
being processed. Its value is a node, which is always a document node. If there
is a context node, and if the tree containing the context node has a document
node as its root, then this document node will be the context document. When an
inner focus is created and the context item in the inner focus is not a node,
or is a node belonging to a tree whose root is not a document node, then the
context document in this inner focus will be the same as the context document
in the outer focus. The context document is returned by the XPath expression "/
", and is used as the base for any rooted path expression,
as well being used implicitly by certain functions such as xf:id
.
[Ed. Note: See Issue
217.]
Dynamic variables. This is a set of (QName, type, value) triples. It contains the same QNames as the in-scope variables in the static context for the expression. Each QName is associated with the dynamic type and value of the corresponding variable. The dynamic type associated with a variable may be more specific than the static type associated with the same variable. The value of a variable is, in general, a sequence.
The dynamic types and values of variables are provided by the host language environment in which an XPath expression is being evaluated.
Current date and time. This information represents
a point in time during processing of a query. It can be retrieved by the xf:current-dateTime
function. If invoked multiple times during the execution of a query,
this function always returns the same result.
Input sequence. The input sequence is sequence of nodes that can be accessed by the input
function. It might be thought of as an "implicit input". The content of the input sequence is determined in an implementation-dependent way.
XPath has three functions that provide access to input data. These functions are of particular importance because they provide the only way in which an expression can reference a document or a collection of documents. The three input functions are described informally here, and in more detail in [XQuery 1.0 and XPath 2.0 Functions and Operators].
The input sequence is a part of the evaluation context for an expression. The way in which nodes are assigned to the input sequence is implementation-dependent. For instance, one implementation might provide a fixed mapping from a directory system to the input sequence, another implementation might provide a graphical user interface that allows users to choose a data source for the input sequence, and a third implementation might support UNIX-style pipes, allowing the output of one query to become the input sequence for another query.
The input
function returns the input
sequence. For example, the expression
input()//customer
returns
all the customer
elements that are descendants of
nodes in the input sequence. If no input sequence has been bound,
the input
function returns the error value.
The collection
function returns the nodes
found in a collection. A collection may be any sequence of nodes. A collection is identified by a
string, which must be a valid URI. For example, the expression
collection("www.example.com/invoices")//customer
identifies all the customer
elements that are
descendants of nodes found in the collection whose URI is
www.example.com/invoices
.
The document
function, when its first argument
is a string containing a single URI that refers to an
XML document, returns the root of that document. The
document
function can also be used to address
multiple documents or document fragments; see
[XQuery 1.0 and XPath 2.0 Functions and Operators] for details.
XPath is defined in terms of the [XQuery 1.0 and XPath 2.0 Data Model] (referred to in this document simply as the Data Model), which represents information in the form of nodes, atomic values, and the error value. Before an XPath expression can be processed, the input documents to be operated on by the expression must be represented in the Data Model. For example, an XML document can be converted to the Data Model by the following steps:
The document can be parsed using an XML parser.
The parsed document can be validated against one or more schemas. This process, which is described in [XML Schema], results in an abstract information structure called the Post-Schema Validation Infoset (PSVI). If a document has no associated schema, it can be validated against a permissive default schema that accepts any well-formed document.
The PSVI can be transformed into the Data Model by a process described in [XQuery 1.0 and XPath 2.0 Data Model].
The above steps provide an example of how a Data Model instance might be constructed. A Data Model instance might also be synthesized directly from a relational database, or constructed in some other way. XPath is defined in terms of operations on the Data Model, but it does not place any constraints on how the input Data Model instance is constructed.
Each element or attribute node in the Data Model can be annotated with a dynamic type. If the Data Model was derived from an input XML document, the types of the elements and attributes are derived from schema validation. A newly constructed element or attribute node has no type annotation, but can be given one by a validate
expression. The type of an element or attribute indicates its range of values--for example, an attribute named version
might have the type xs:decimal
, indicating that it contains a decimal value.
The value of an attribute is represented directly within the attribute node. An attribute node whose type is unknown (such as might occur in a schemaless document) is annotated with the type xs:anySimpleType
.
The value of an element is represented by the children of the element node, which may include text nodes and other element nodes. The type annotation of an element node indicates how the values in its child text nodes are to be interpreted. An element containing text of unknown type, possibly interleaved with comments and/or processing instructions (such as might occur in a schemaless document), is annotated with the type xs:anySimpleType
. However, if an element of unknown type contains subelements, it is annotated with the type xs:anyType
.
Atomic values in the Data Model also carry type annotations. An atomic value of unknown type is annotated with the type xs:anySimpleType
. Under certain circumstances (such as during processing of an arithmetic operator), an atomic value of xs:anySimpleType
may be cast into a more specific type (such as xs:double
).
This document provides a user-oriented description of how various kinds of expressions are processed. For each expression, the operands and result are instances of the Data Model. The details of transforming XML documents into the Data Model are described in [XQuery 1.0 and XPath 2.0 Data Model]. Transformation of a Data Model instance into an XML document is currently an open issue.
Two Data Model terms are described here briefly because they are of particular importance for the processing of expressions: document order and typed value. For a more detailed explanation of these terms, see [XQuery 1.0 and XPath 2.0 Data Model].
Document order defines a total ordering among all the nodes seen by the language processor. Within a given source document, the document node is the first node, followed by element nodes, text nodes, comment nodes, and processing instruction nodes in the order of their representation in the XML document (after expansion of entities). Element nodes occur before their children. The namespace nodes of an element immediately follow the element node, in implementation-defined order. The attribute nodes of an element immediately follow its namespace nodes, and are also in implementation-defined order.
Each input document, and each node or node hierarchy constructed during expression processing, is a separate data model fragment. Document order among data model fragments is implementation-defined but stable within a query.
Every node has a typed value, which is a sequence of atomic values. The typed value of any node can be extracted by calling the data
function with the node as argument. The typed value for the various kinds of nodes is defined as follows:
The typed value of a document, namespace, comment, or processing instruction node is the error value.
The typed value of a text node is the string content of the node, as an instance of xs:anySimpleType
.
The typed value of an element or attribute node that has no type annotation is a sequence of atomic values that is stored in the Data Model.
The typed value of an element or attribute node whose type annotation denotes either a simple type or a complex type with simple content is a sequence of atomic values that is obtained by applying the type annotation to the content of the node, as in the following examples:
Example: N is an element node of type hatsizelist
, which is a complex type that includes a country
attribute. The content of the type hatsizelist
is a sequence of items of type hatsize
, which is derived from xs:decimal
. In XML Schema, this content is considered to have a simple type. The typed value of N is a sequence of values of type hatsize
.
Example: A is an attribute of type IDREFS
, a list type derived from IDREF
, and its value is "bar baz faz
". The typed value of A is a sequence of three atomic values of type IDREF
.
The typed value of an element node whose type annotation denotes a complex type with complex content is the error value.
XPath is a strongly typed language with a type system based on
[XML Schema]. The built-in types of XPath include the node kinds
of XML (such as element, attribute, and text nodes), the built-in atomic types of [XML Schema] (such as xs:integer
and xs:string
), and the following special derived types: xs:dayTimeDuration
and xs:yearMonthDuration
(described in [XQuery 1.0 and XPath 2.0 Functions and Operators]).
When the type of a value is not appropriate for the context in which it is used, a type exception is raised. Languages that are based on XPath 2.0 may handle type exceptions with either a strict
or a flexible
policy, as described in 2.1.3.4 Fallbacks.
Like XML Schema, XPath distinguishes named types from anonymous types. The set of named types includes all the built-in types and all user-defined simple or complex types for which the type declaration contains a name. Named types are associated with values in one of the following ways:
A literal value has a named type; for example, the type of the value 47
is xs:integer
.
The constructor functions described in [XQuery 1.0 and XPath 2.0 Functions and Operators] return values with named types; for example, xf:date("2002-5-31")
returns a value of type xs:date
.
When an instance of the Data Model is constructed from a validated document, type names assigned by a schema processor are preserved in the Data Model.
The validate
expression invokes schema validation within a query, assigning type
names in the same way that a schema processor would.
The cast
expression creates an atomic value with a specific named type.
Some functions, such as data()
, extract typed values from the nodes of a document, preserving the named types of these values.
The XPath type system is formally defined in [XQuery 1.0 Formal Semantics]. This section presents a summary of types from a user's perspective.
XPath provides two kinds of type checking, called static type checking and dynamic type checking.
Static type checking is performed during the query analysis phase (also known as "compile time.") Static type checking of an expression is based on the expression itself and on the in-scope schema definitions. Static type checking does not depend on the actual values found in any input document. The purpose of static type checking is to provide early detection of type errors and to compute the type of a query result.
During static type checking, each expression is assigned a static type. In some cases, the static type is derived from the lexical form of the expression; for example, the static type of the literal 5
is xs:integer
. In other cases, the static type of an expression is inferred according to rules based on the static types of its operands; for example, the static type of the expression size < 5
is xs:boolean
. The static type of an expression may be either a named type or a structural description--for example, xs:boolean?
denotes an optional occurrence of the xs:boolean
type. The rules for inferring the static types of various expressions are described in [XQuery 1.0 Formal Semantics]. During the analysis phase, if an operand of an expression is found to have a static type that is not appropriate for that operand, a static error is raised. If static type checking raises no errors and assigns a static type T to an expression, then execution of the expression on valid input data is guaranteed to produce either a value of type T or the error value.
Dynamic type checking is performed during the query execution phase (also known as "run time.") Dynamic checking depends on the actual values found in input documents. At run time, a dynamic type is associated with each value as it is computed. The dynamic type of a value may be more specific than the static type of the expression that computed it (for example, the static type of an expression might be "zero or more integers or strings," but at run time its value may have the dynamic type "integer.") If an operand of an expression is found to have a dynamic type that is not appropriate for that operand, a type exception is raised.
The dynamic type of a value may be either a structural type (such as "sequence of integers") or a named type. In many cases, a value that has a structural type can be given a named type by means of a validate
expression, which matches the value against known types in the in-scope schema definitions.
It is possible for static type checking of an expression to raise a static type error, even though the expression might evaluate successfully on some valid input data. For example, an expression might contain a function that requires an element as its parameter, and static type checking might infer the static type of the function parameter to be an optional element. In this case, a static type error would result, even though the function call would be successful for input data in which the optional element is present.
It is also possible for an expression to return the error value, even though static type checking of the expression raised no error. For example, an expression may contain a cast of a string into an integer, which is statically valid. However, if the actual value of the string at run time cannot be cast into an integer, the error value will result. Similarly, an expression may apply an arithmetic operator to a value extracted from a schemaless document. This is not a static error, but at run time, if the value cannot be successfully cast to a numeric type, the error value will result.
If an implementation can determine by static analysis that an expression will necessarily return the error value (for example, because it contains a division by the constant zero), the implementation is allowed to report this error at query analysis time (as well as at query execution time).
At user option, static type checking can be disabled. Also, a conformance level may be defined for which implementions need not provide static type checking.
When it is necessary to refer to a type in an XPath expression, the syntax shown below is used. This syntax production is called "SequenceType", since it describes the type of an XPath value, which is a sequence.
[48] | SequenceType | ::= | (ItemType OccurrenceIndicator) | "empty" |
[49] | ItemType | ::= | (("element" | "attribute") ElemOrAttrType?) | "node" | "processing-instruction" | "comment" | "text" | "document" | "item" | AtomicType | "unknown" | "atomic" "value" |
[50] | ElemOrAttrType | ::= | SchemaType | (QName SchemaContext?) |
[51] | SchemaType | ::= | QName? "of" "type" QName |
[45] | SchemaContext | ::= | "in" SchemaGlobalContext ("/" SchemaContextStep)* |
[46] | SchemaGlobalContext | ::= | QName | ("type" QName) |
[47] | SchemaContextStep | ::= | QName |
[52] | AtomicType | ::= | QName |
[53] | OccurrenceIndicator | ::= | ("*" | "+" | "?")? |
Here are some examples of SequenceTypes that might be used in XPath expressions:
xs:date
refers to the built-in Schema type date
attribute?
refers to an optional attribute
element
refers to any element
element office:letter
refers to an element with a specific name
element of type
po:address+
refers to one or more elements of the given type
node*
refers to a sequence of zero or more nodes of any type
item*
refers to a sequence of zero or more nodes or atomic values
During processing of a query, it is sometimes necessary to determine whether a given value matches a type that was declared using the SequenceType syntax. This process is known as SequenceType matching. For example, an instance of
expression returns true
if a given value matches a given type, or false
if
it does not.
SequenceType matching between a given value and a given SequenceType is performed as follows:
If the SequenceType is empty
, the match succeeds only if the value is an empty sequence. If the
SequenceType is an ItemType with no OccurrenceIndicator, the match succeeds only if the value contains precisely one item and that item matches the ItemType (see below).
If the SequenceType contains an ItemType and an OccurrenceIndicator, the match succeeds only if the number of items in the value matches the OccurrenceIndicator and each
of these items matches the ItemType. As a consequence of these rules, a value that is an empty sequence matches any SequenceType whose occurrence indicator is *
or ?
.
An OccurrenceIndicator indicates the number of items in a sequence, as follows:
?
indicates zero or one items
*
indicates zero or more items
+
indicates one or more items
The process of matching a given item against a given ItemType is performed as follows (remember that an item may be a node or an atomic value):
The ItemType item
matches any item. For example, item
matches the value 1
or the value <a/>
.
The following ItemTypes match atomic values:
atomic value
matches any atomic value.
A named atomic type matches a value if the dynamic type of the value is the same as the named atomic type or is derived from the named atomic type by restriction. For example, the ItemType xs:decimal
matches the value 12.34
(a decimal literal); it also matches a value whose dynamic type is shoesize
, if shoesize
is a user-defined atomic type derived from xs:decimal
.
unknown
matches an atomic value whose
most specific type is xs:anySimpleType
.
The following ItemTypes match nodes:
node
matches any node.
text
matches any text node.
processing-instruction
matches any processing instruction node.
comment
matches any comment node.
document
matches any document node.
element
matches an element node. Optionally, element
may be followed by ElemOrAttrType,which places further constraints on the node (see below).
attribute
matches an attribute node. Optionally, attribute
may be followed by ElemOrAttrType,which places further constraints on the node (see below).
An ElemOrAttrType may be used to place a constraint on the name or type of an element or attribute, as follows:
One form of ElemOrAttrType, denoted by the phrase "of type
", specifies the required type of the element or attribute node. The required type must be the QName of a simple or complex type that is found in the in-scope schema definitions. The match is successful only if the given element or attribute has a type annotation that is the same as the required type or is known (in the in-scope schema definitions) to be derived from the required type. For example, element of type Employee
matches an element node that has been validated and has received the type annotation Employee
. Similarly, attribute of type xs:integer
matches an attribute node that has been validated and has received the type annotation xs:integer
.
Another form of ElemOrAttrType is simply a QName, which is interpreted as the required name of the element or attribute. The QName must be an element or attribute name that is found in the in-scope schema definitions. The match is successful only if the given element or attribute has the required name and also conforms to the schema definition for the required name. This can be verified in either of the following ways:
If the schema definition for the required name has a named type, the given element or attribute must have a type annotation that is the same as that named type or is known (in the in-scope schema definitions) to be derived from that named type. For example, suppose that a schema declares the element named location
to have the type State
. Then the SequenceType element location
will match a given element only if its name is location
and its type annotation is State
or some named type that is derived from State
.
If the schema definition for the required name has an anonymous (unnamed) type definition, the actual content of the given element or attribute must structurally comply with this type definition. For example, suppose that a schema declares the element named shippingAddress
to have an anonymous complex type consisting of a street
element followed by a city
element. Then the SequenceType element shippingAddress
will match a given element only if its name is shippingAddress
and its content is a street
element followed by a city
element.
The above two forms of ElemOrAttrType may be combined to specify both the required name and the required type of an element or attribute node, as in element person of type Employee
or attribute color of type xs:integer
.
In some cases, the required name of an element or attribute node may be locally declared (that is, declared inside a complex type in some schema.) In this case, the ElemOrAttrType may specify the SchemaContext in which the required name is to be interpreted. For example, element shippingAddress in invoice/customer
matches an element node that conforms to the schema definition of the element name shippingAddress
, as it would be interpreted inside a customer
element that is inside an invoice
element. The first QName in the SchemaContext must be found in the in-scope schema definitions.
[Ed. Note: The effect of substitution groups on SequenceType matching is an open issue.]
Some expressions do not require their operands to exactly match the expected type. For example, function parameters and returns expect a value of a particular type, but allow some basic conversions to be performed, such as extraction of atomic values from nodes, promotion of numeric values, and implicit casting of untyped values. The conversion rules for function parameters and returns are discussed in 2.2.4 Function Calls. Other operators that provide special conversion rules include arithmetic operators, which are discussed in 2.5 Arithmetic Expressions, and value comparisons, which are discussed in 2.6.1 Value Comparisons.
Type conversions sometimes depend on a process called atomization, which is used when an optional atomic value is expected. When atomization is applied to a given value, the result is either a single atomic value, an empty sequence, or a type exception. Atomization is defined as follows:
If the value is a single atomic value or an empty sequence, atomization simply returns the value.
If the value is a single node, the typed value of the node is extracted and returned; however, if the typed value is a sequence containing more than one item, a type exception is raised.
In any other case, atomization raises a type exception.
The action taken when a type exception is
raised depends on the language environment in which the XPath expression is
being evaluated. A language environment may choose either a strict
or a flexible
type exception policy. If the policy is strict
, a type exception is treated as
an error. If the policy is flexible
, the language environment must handle type exceptions by applying a fixed set of
rules called fallback conversions. The purpose of fallback conversions is to provide backward compatibility with the behavior of XPath Version 1.0.
This means that some language environments may be more permissive than others about type conversions. In general, XPath expressions will be portable from one language environment to another only if they make no reliance on fallback conversions. However, if an expression evaluates without raising an error in two different language environments, it will always return the same result.
A type exception is raised when a given value does not conform to its required type. A language environment that implements fallback conversions must resolve this conflict by applying the following rules, in order:
If the required type is anything other than an atomic type or a single node, the error value is returned.
If the required type is boolean
, and the given value is an empty
sequence, the given value is converted to boolean false
.
If the required type is boolean
, and the given value is a
sequence containing at least one node, the given value is converted to boolean true
.
If the required type is a node, and the first item in the sequence is a node, only the first item is retained. If the required type is a node, and the first item in the sequence is not a node, the error value is returned.
Otherwise if the given value is a sequence containing more than one item, only the first item is retained. If this item is a node, its typed value is extracted. If the typed value of the node is a sequence of more than one atomic value, only the first of these atomic values is retained. The resulting (supplied or extracted) atomic value is converted to the required type according to the rules in the following table:
boolean type | string type | number type | other atomic type | |
---|---|---|---|---|
boolean value | N/A | Boolean false value is converted to the string false . The boolean true value is converted to the string true . | Boolean true is converted to 1 ; boolean false is converted to 0 . | Return the error value |
string value | 'true' or '1' goes to true, 'false' or '0' goes to false. Otherwise, if the string is empty, return false; otherwise, return true. | N/A | Use the numeric constructor for the specific number type, passing in the string value. | Use the appropriate string constructor for the specific type as defined in the [XQuery 1.0 and XPath 2.0 Functions and Operators] document. |
number value | 0, +0, -0, and NaN, is converted to boolean false, anything else is converted to boolean true. | Use the string value of the atomic value, as defined in the data model. | N/A | Attempt to cast the value to the given atomic type, using the tables defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If a cast cannot be done, return the error value; otherwise a warning should be given. |
other atomic value | Attempt to cast the value to a boolean, using the tables defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If a cast can not be done, return the error value. If precision is lost, a warning should be given. | Attempt to cast the value to a string, using the tables defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If a cast can not be done, return the error value. If precision is lost, a warning should be given. | Attempt to cast the value to a number, using the tables defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If a cast can not be done, return the error value. If precision is lost, a warning should be given. | Attempt to cast the value to the given atomic type, using the tables defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If a cast cannot be done, return the error value; otherwise a warning should be given. |
Ed. Note: The entries in this table should always match the casts in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If there is disagreement, [XQuery 1.0 and XPath 2.0 Functions and Operators] should take precedence.
Primary expressions are the basic primitives of the language. They include literals, variables, function calls, and the use of parentheses to control precedence of operators. The use of qualifiers in primary expressions is discussed in 2.3.2 Qualifiers.
[23] | PrimaryExpr | ::= | (Literal | FunctionCall | Variable | ParenthesizedExpr) Qualifiers |
A literal is a direct syntactic representation of an atomic value. XPath supports two kinds of literals: string literals and numeric literals.
[42] | Literal | ::= | NumericLiteral | StringLiteral |
[41] | NumericLiteral | ::= | IntegerLiteral | DecimalLiteral | DoubleLiteral |
[141] | IntegerLiteral | ::= | [0-9]+ |
[142] | DecimalLiteral | ::= | ("." [0-9]+) | ([0-9]+ "." [0-9]*) |
[143] | DoubleLiteral | ::= | (("." [0-9]+) | ([0-9]+ ("." [0-9]*)?)) ([e] | [E]) ([+] | [-])? [0-9]+ |
[155] | StringLiteral | ::= | (["] ((" ") | [^"])* ["]) | (['] ((' ') | [^'])* [']) |
The value of a string literal is a singleton sequence
containing an item whose primitive type is xs:string
and whose value is the string denoted by the characters between the
delimiting quotation marks.
The value of a numeric literal containing no ".
" and no e
or E
character is a singleton sequence containing an item whose type is xs:integer
and whose value is obtained by parsing the numeric literal according to
the rules of the xs:integer
datatype. The value of a numeric literal containing ".
" but no e
or E
character is a singleton sequence containing an item whose primitive
type is xs:decimal
and whose value is obtained by parsing the numeric literal according to
the rules of the xs:decimal
datatype. The value of a numeric literal containing an e
or E
character is a singleton sequence containing an item whose primitive
type is xs:double
and whose value is obtained by parsing the numeric literal according to
the rules of the xs:double
datatype.
Here are some examples of literal expressions:
"12.5"
denotes the string containing the characters '1', '2', '.', and
'5'.
12
denotes the integer value twelve.
12.5
denotes the decimal value twelve and one half.
125E2
denotes the double value twelve thousand, five hundred.
Values of other XML Schema built-in types can be constructed by calling the constructor for the given type. The constructors for XML Schema built-in types are defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. For example:
xf:true()
and xf:false()
return the boolean values true
and false
, respectively.
xf:integer("12")
returns the integer value twelve.
xf:date("2001-08-25")
returns an item whose type is xs:date
and whose value represents the date 25th August 2001.
It is also possible to construct values of other built-in types using
the cast
expression. For example:
cast as
xs:positiveInteger(12)
returns an item whose primitive value is the decimal value 12.0 and
whose type is the built-in derived type xs:positiveInteger
.
A variable evaluates to the value to which the variable's QName is bound in the evaluation context. If the variable's QName is not bound, the value of the variable is the error value. Variables can be bound by clauses in for expressions and quantified expressions, and by function calls, which bind values to the formal parameters of functions before executing the function body.
XPath also allows variables to be bound in the host language environment.
[132] | Variable | ::= | "$" QName |
Parentheses may be used to enforce a particular evaluation order in
expressions that contain multiple operators. For example, the expression (2 + 4)
* 5
evaluates to thirty, since the parenthesized expression (2 + 4)
is evaluated first and its result is multiplied by five. Without
parentheses, the expression 2 + 4 * 5
evaluates to twenty-two, because the multiplication operator has higher
precedence than the addition operator.
Parentheses are also used as delimiters in constructing a sequence, as described in 2.4.1 Constructing Sequences.
A function call consists of a QName followed by a parenthesized list of zero or more expressions. The QName must match the name of an in-scope function in the static context (see 2.1.1 Expression Context). The expressions inside the parentheses provide the arguments of the function call. The number of arguments must equal the number of formal parameters in the function's signature; otherwise a static error is raised.
[44] | FunctionCall | ::= | QName "(" (Expr ("," Expr)*)? ")" |
A function call expression is evaluated as follows:
Each argument expression is evaluated, producing an argument value.
Each argument value is converted to the declared type of the corresponding function parameter, using the function conversion rules listed below.
The function is executed using the converted argument values. The result is a value of the function's declared return type.
The function conversion rules are used to convert an argument value to its required type; that is, to the declared type of the function parameter. The required type is expressed as a SequenceType. The function conversion rules are as follows:
If the required type is an AtomicType:
Atomization is applied to the given value. If the resulting atomic value is
of type xs:anySimpleType
, an attempt is made to cast it to the required type; if the cast fails,
the function call returns the error value. If the atomic value has a type that can be promoted
to the required type using the promotion rules in B.1 Type Promotion,
the promotion is done. After applying the above rules, if the resulting value
does not conform to the required type, the function call returns the error value.
If the required type is a sequence or optional occurrence of AtomicType:
If the given value contains any nodes, these nodes are replaced by their typed values. If the cardinality of the resulting sequence does not match the cardinality of the required type, a type exception is raised. Otherwise, each item is converted to the required AtomicType using the conversion rule for AtomicType.
If the required type is any other SequenceType:
SequenceType Matching is used to determine if the type of the given value matches the required type. If not, the function call returns the error value.
A core library of functions is defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. Functions in this library may be invoked without a namespace prefix by assigning the default function namespace to the namespace of the function library.
The comma operator in XPath serves two purposes: it separates the arguments in a function call, and it separates items in an expression that constructs a sequence (see 2.4.1 Constructing Sequences). To distinguish these two uses, parentheses can be used to delimit the individual arguments of a function call. Here are some examples of function calls in which arguments that are literal sequences are delimited with parentheses:
three-argument-function(1,
2, 3)
denotes a function call with three arguments.
two-argument-function((1,
2), 3)
denotes a function call with two arguments, the first of which is a
sequence of two values.
two-argument-function(1,
())
denotes a function call with two arguments, the second of which is an
empty sequence.
one-argument-function((1, 2,
3))
denotes a function call with one argument that is a sequence of three
values.
XPath comments can be used to provide informative annotation. These comments are lexical constructs only, and do not affect the processing of an expression.
[56] | ExprComment | ::= | "{--" [^}]* "--}" |
Comments may be used before and after major tokens within expressions . See A.3 Lexical structure for the exact lexical states where comments are recognized.
Ed. Note: The EBNF here should disallow "--}" within the comment, rather than "}".
A path expression locates nodes within a tree, and returns a sequence of distinct nodes in document order. A path expression is always evaluated with respect to an evaluation context. There are two kinds of path expressions: relative path expressions and rooted path expressions.
[22] | RelativePathExpr | ::= | Expr ("/" | "//") Expr |
[21] | RootedPathExpr | ::= | ("/" Expr?) | ("//" Expr) |
A relative path expression consists of two expressions, separated by
/
or //
. This section describes the meaning of /
; the use of //
is described in 2.3.4 Abbreviated Syntax.
We will refer to the expression on the left side of /
as E1 and the expression on the right side of /
as E2. The expression E1 is evaluated, and if the result is not a sequence of nodes, the error value is returned. Each node resulting from the evaluation of E1 then serves in turn to provide an inner focus for an evaluation of E2, as described in 2.1.1.2 Evaluation Context. Each evaluation of E2 must result in a sequence of nodes; otherwise, the error value is returned. The sequences of nodes resulting from all the evaluations of E2 are merged, eliminating duplicate node identities and sorting the results in document
order.
As an example of a relative path expression, child::div1/child::para
selects the para
element children of the div1
element children of the context node, or, in other words, the para
element grandchildren of the context node that have div1
parents.
A rooted path expression consists of /
or //
, followed by an expression. If the rooted path expression begins with /
, the following expression is optional. This section describes the meaning of /
; the use of //
is described in 2.3.4 Abbreviated Syntax.
A /
by itself selects the context document. A /
followed by an expression E1 establishes an inner focus in which the context node is set equal to the context document, and the context position and context length are set to 1. The expression E1 is then evaluated. If the value of E1 is a sequence of nodes, the result of the rooted path expression is this sequence of nodes, in document order, after elimination of duplicates based on nodeid. If the value of E1 is not a sequence of nodes, the error value is returned.
[24] | StepExpr | ::= | (ForwardStep | ReverseStep) Qualifiers |
[36] | ForwardStep | ::= | (ForwardAxis NodeTest) | AbbreviatedForwardStep |
[37] | ReverseStep | ::= | (ReverseAxis NodeTest) | AbbreviatedReverseStep |
A step is an expression that returns a sequence of nodes, in document order and without duplicates. Steps are often used inside path expressions. A step might be thought of as beginning at the context node, navigating to those nodes that are reachable from the context node via a predefined axis, and selecting some subset of the reachable nodes. A step has three parts:
an axis, which specifies the relationship between the nodes selected by the step and the context node. The axis might be thought of as the "direction of movement" of the step.
a node test, which specifies the node kind and/or name of the nodes selected by the step.
zero or more qualifiers, which further modify the sequence of nodes selected by the step.
In the abbreviated syntax for a step, the axis can be omitted and other shorthand notations can be used as described in 2.3.4 Abbreviated Syntax.
The unabbreviated syntax for an step consists of the axis name
and node test separated by a double colon, followed by zero or more qualifiers. For example, in child::para[position()=1]
, child
is the name of the axis, para
is the node test and [position()=1]
is a qualifier.
The node sequence selected by a step is found by generating an
initial node sequence from the axis and node test, and then applying each of
the qualifiers in turn. The initial node sequence consists of the nodes
reachable from the context node via the specified axis that have the node kind
and/or name specified by the node test. For example, the
step descendant::para
selects the para
element descendants of the context node: descendant
specifies that each node in the initial node sequence must be a
descendant of the context node, and para
specifies that each node in the initial node sequence must be an
element named para
. The available axes are described in 2.3.1.1 Axes. The
available node tests are described in 2.3.1.2 Node Tests. Qualifiers are described in 2.3.2 Qualifiers. Examples of
steps are provided in 2.3.3 Unabbreviated Syntax and 2.3.4 Abbreviated Syntax.
[26] | ForwardAxis | ::= | "child" "::" | "descendant" "::" | "attribute" "::" | "self" "::" | "descendant-or-self" "::" | "following-sibling" "::" | "following" "::" | "namespace" "::" |
[27] | ReverseAxis | ::= | "parent" "::" | "ancestor" "::" | "preceding-sibling" "::" | "preceding" "::" | "ancestor-or-self" "::" |
XPath defines a set of full set of axes for traversing documents, but a host language may define a subset of these axes. The following axes are defined:
the child
axis contains the children of the context node
the descendant
axis contains the descendants of the context node; a descendant is a
child or a child of a child and so on; thus the descendant axis never contains
attribute or namespace nodes
the parent
axis contains the parent of the context node, if there is one
the ancestor
axis contains the ancestors of the context node; the ancestors of the
context node consist of the parent of context node and the parent's parent and
so on; thus, the ancestor axis will always include the root node, unless the
context node is the root node
the following-sibling
axis contains all the following siblings of the context node; if the
context node is an attribute node or namespace node, the following-sibling
axis is empty
the preceding-sibling
axis contains all the preceding siblings of the context node; if the
context node is an attribute node or namespace node, the preceding-sibling
axis is empty
the following
axis contains all nodes in the same document as the context node that
are after the context node in document order, excluding any descendants and
excluding attribute nodes and namespace nodes
the preceding
axis contains all nodes in the same document as the context node that
are before the context node in document order, excluding any ancestors and
excluding attribute nodes and namespace nodes
the attribute
axis contains the attributes of the context node; the axis will be
empty unless the context node is an element
the namespace
axis contains the namespace nodes of the context node; the axis will be
empty unless the context node is an element
the self
axis contains just the context node itself
the descendant-or-self
axis contains the context node and the descendants of the context
node
the ancestor-or-self
axis contains the context node and the ancestors of the context node;
thus, the ancestor-or-self axis will always include the root node
Axes can be categorized as forward axes and reverse axes. An axis that only ever contains the context node or nodes that are after the context node in document order is a forward axis. An axis that only ever contains the context node or nodes that are before the context node in document order is a reverse axis.
In XPath, the parent
, ancestor
, ancestor-or-self
, preceding
, and preceding-sibling
axes are reverse axes; all other axes are forward axes. Since the self
axis always contains at most one node, it makes no difference whether
it is a forward or reverse axis. The ancestor
, descendant
, following
, preceding
and self
axes partition a document (ignoring attribute and namespace nodes):
they do not overlap and together they contain all the nodes in the
document.
In a sequence of nodes selected by a step, the context positions of the nodes are determined in a way that depends on the axis. If the axis is a forward axis, context positions are assigned to the nodes in document order. If the axis is a reverse axis, context positions are assigned to the nodes in reverse document order. In either case, the first context position is 1.
A node test is a condition that must be true for each node selected by a step. The condition may be based on the kind of the node (element, attribute, text, document, comment, processing instruction, or namespace) or on the name of the node.
[28] | NodeTest | ::= | KindTest | NameTest |
[29] | NameTest | ::= | QName | Wildcard |
[30] | Wildcard | ::= | "*" | ":"? NCName ":" "*" | "*" ":" NCName |
[31] | KindTest | ::= | ProcessingInstructionTest
| CommentTest | TextTest | AnyKindTest |
[32] | ProcessingInstructionTest | ::= | "processing-instruction" "(" StringLiteral? ")" |
[33] | CommentTest | ::= | "comment" "(" ")" |
[34] | TextTest | ::= | "text" "(" ")" |
[35] | AnyKindTest | ::= | "node" "(" ")" |
Every axis has a principal node kind. If an axis can contain elements, then the principal node kind is element; otherwise, it is the kind of nodes that the axis can contain. Thus:
For the attribute axis, the principal node kind is attribute.
For the namespace axis, the principal node kind is namespace.
For all other axes, the principal node kind is element.
A node test that is a QName is true if and only if the
kind of the node is the principal
node kind and the expanded-name of the node is equal to the expanded-name
specified by the QName. For example, child::para
selects the para
element children of the context node; if the context node has no para
children, it selects an empty set of nodes. attribute::href
selects the href
attribute of the context node; if the context node has no href
attribute, it selects an empty set of nodes.
A QName in a node test is expanded into an expanded-name using the in-scope namespaces in the expression context. An unprefixed QName used as a nametest has the namespaceURI associated with the default element namespace in the expression context. It is an error if the QName has a prefix that does not correspond to any in-scope namespace.
A node test *
is true for any node of the principal node kind. For example, child::*
will select all element children of the context node, and attribute::*
will select all attributes of the context node.
A node test can have the form NCName:*
. In this case, the prefix is expanded in the same way as with a QName,
using the context namespace declarations. It is an error if there is no
namespace declaration for the prefix in the expression context. The node test
will be true for any node of the principal node kind whose expanded-name has the
namespace URI to which the prefix expands, regardless of the local part of the
name.
A node test can also have the form *:NCName
. In this case, the node test is true for any node of the principal node
kind whose local name matches the given NCName, regardless of its
namespace.
The node test text()
is true for any text node. For example, child::text()
will select the text node children of the context node. Similarly, the
node test comment()
is true for any comment node, and the node test processing-instruction()
is true for any processing instruction. The processing-instruction()
test may have an argument that is a StringLiteral; in this
case, it is true for any processing instruction whose target application is equal to the
value of the StringLiteral.
A node test node()
is true for any node whatsoever.
Qualifiers are of two general forms: predicates, which are used to filter a node sequence by applying some test, and dereferences, which are used to map reference-type nodes into the nodes that they reference.
[40] | Qualifiers | ::= | (("[" Expr "]") | ("=>" NameTest))* |
A predicate consists of an expression, called a predicate
expression, enclosed in square brackets. A predicate serves to filter a
node sequence, retaining some nodes and discarding others. For each node in the
node sequence to be filtered, the predicate expression is evaluated using an
inner focus derived from that node, as described in
2.1.1.2 Evaluation Context. The result of the predicate expression is
coerced to a Boolean value, called the predicate truth value, as
described below. Those nodes for which the predicate truth value is true
are retained, and those for which the predicate truth value is false
are discarded.
The predicate truth value is derived by applying the following rules, in order:
If the value of the predicate expression is an empty sequence, the
predicate truth value is false
.
If the value of the predicate expression is an atomic value of a
numeric type, the predicate truth value is true
if and only if the value of the predicate expression is equal to the context position.
If the value of the predicate expression is an atomic value of type Boolean, the predicate truth value is equal to the value of the predicate expression.
If the value of the predicate expression is a sequence that contains
at least one node and does not contain any item that is not a node, the predicate truth value is true
. The predicate truth value in this case does not depend on
the content of the node(s). [Ed. Note: This rule is pending approval by the XSLT Working Group.]
In any other case, a type exception is raised.
Here are some examples of steps that contain predicates:
This example selects the second "chapter" element that is a child of the context node:
child::chapter[2]
This example selects all the descendants of the context node whose name is "toy" and whose "color" attribute has the value "red":
descendant::toy[attribute::color = "red"]
This example selects all the "employee" children of the context node that have a "secretary" subelement:
child::employee[secretary]
As noted in 2.2 Primary Expressions, a predicate can also be used with a primary expression that is not a step, as illustrated in the following example:
List all the integers from 1 to 100 that are divisible by 5.
(1 to 100)[. mod 5 eq 0]
A dereference operates on a node sequence, mapping element
and/or attribute nodes into the nodes that they reference. Every node in the
input sequence of the dereference must be an element or attribute node
whose typed value is of type IDREF
or IDREFS
; otherwise the error value is returned. The dereference generates a new sequence
consisting of the element nodes that are referenced by the IDREF
values in the input sequence. An element node is referenced by an IDREF
value if it has an ID-type attribute whose value matches the IDREF
value, and it is in the same document as the node containing the IDREF
value. The referenced nodes are filtered by the NameTest that follows the
dereference operator, retaining only nodes whose expanded-names match the
expanded-name specified in the NameTest. The filtered sequence of element nodes
is then sorted into document order and duplicate node-ids are eliminated.
Here are some examples of steps that contain dereferences:
This example selects the figure that is referenced by the first figure reference that is a child of the context node:
child::figref[1]/attribute::refid=>figure
This example selects the manager of the manager of the context node,
assuming that the context node is an emp
node and that each emp
node has a manager
attribute that references the emp
node of the employee's manager:
attribute::manager=>emp/attribute::manager=>emp
This section provides a number of examples of path expressions in which the axis is explicitly specified in each step. The syntax used in these examples is called the unabbreviated syntax. In many common cases, it is possible to write path expressions more concisely using an abbreviated syntax, as explained in 2.3.4 Abbreviated Syntax.
child::para
selects
the para
element children of the context node
child::*
selects all element children of the context node
child::text()
selects all text node children of the context node
child::node()
selects all the children of the context node, whatever their node
type
attribute::name
selects the name
attribute of the context node
attribute::*
selects all the attributes of the context node
descendant::para
selects the para
element descendants of the context node
ancestor::div
selects all div
ancestors of the context node
ancestor-or-self::div
selects the div
ancestors of the context node and, if the context node is a div
element, the context node as well
descendant-or-self::para
selects the para
element descendants of the context node and, if the context node is a para
element, the context node as well
self::para
selects the context node if it is a para
element, and otherwise selects nothing
child::chapter/descendant::para
selects the para
element
descendants of the chapter
element children of the context node
child::*/child::para
selects all para
grandchildren of the context node
/
selects the context document (the document node that is an ancestor of the context node)
/descendant::para
selects all the para
elements in the same document as the context node
/descendant::list/child::member
selects all
the member
elements that have an list
parent and that are in the same document as the context node
child::para[position()=1]
selects the first para
child of the context node
child::para[position()=last()]
selects the last para
child of the context node
child::para[position()=last()-1]
selects the last but one para
child of the context node
child::para[position()>1]
selects all the para
children of the context node other than the first para
child of the context node
following-sibling::chapter[position()=1]
selects the next chapter
sibling of the context node
preceding-sibling::chapter[position()=1]
selects the previous chapter
sibling of the context node
/descendant::figure[position()=42]
selects the forty-second figure
element in the document
/child::doc/child::chapter[position()=5]/child::section[position()=2]
selects the
second section
of the fifth chapter
of the doc
document element
child::para[attribute::type="warning"]
selects
all para
children of the context node that have a type
attribute with value warning
child::para[attribute::type='warning'][position()=5]
selects the fifth para
child of the context node that has a type
attribute with value warning
child::para[position()=5][attribute::type="warning"]
selects the fifth para
child of the context node if that child has a type
attribute with value warning
child::chapter[child::title='Introduction']
selects the chapter
children of the context node that have one or more title
children with string-value equal to Introduction
child::chapter[child::title]
selects the chapter
children of the context node that have one or more title
children
child::*[self::chapter or self::appendix]
selects the chapter
and appendix
children of the context node
child::*[self::chapter or
self::appendix][position()=last()]
selects the
last chapter
or appendix
child of the context node
[38] | AbbreviatedForwardStep | ::= | "." | ("@" NameTest) | NodeTest |
[39] | AbbreviatedReverseStep | ::= | ".." |
The abbreviated syntax permits the following abbreviations:
The most important abbreviation is that child::
can be omitted from a step. In effect, child
is the default axis. For example, a path expression section/para
is short for child::section/child::para
.
There is also an abbreviation for
attributes: attribute::
can be
abbreviated by @
. For example, a path expression para[@type="warning"]
is short
for child::para[attribute::type="warning"]
and
so selects para
children with a type
attribute with value
equal to warning
.
//
is short
for /descendant-or-self::node()/
. For example, //para
is short for /descendant-or-self::node()/child::para
and so will select any para
element in the document (even a para
element that is a document element will be selected
by //para
since
the document element node is a child of the root node); div1//para
is
short for div1/descendant-or-self::node()/child::para
and so will select all para
descendants of div1
children.
Note that the path expression //para[1]
does not mean the same as the path
expression /descendant::para[1]
. The latter selects the first descendant para
element; the former
selects all descendant para
elements that are the first para
children of their parents.
A step consisting
of .
is short
for self::node()
. This is particularly useful in conjunction with //
. For example, the path
expression .//para
is short for
self::node()/descendant-or-self::node()/child::para
and so will select all para
descendant elements of the context node.
A step consisting
of ..
is short
for parent::node()
. For example, ../title
is short for parent::node()/child::title
and so will select the title
children of the parent of the context node.
Here are some examples of path expressions that use the abbreviated syntax:
para
selects the para
element children of the context node
*
selects all element children of the context node
text()
selects all text node children of the context node
@name
selects
the name
attribute of the context node
@*
selects all the attributes of the context node
para[1]
selects the first para
child of the context node
para[last()]
selects the last para
child of the context node
*/para
selects
all para
grandchildren of the context node
/doc/chapter[5]/section[2]
selects the second section
of the fifth chapter
of the doc
chapter//para
selects the para
element descendants of the chapter
element children of the context node
//para
selects all
the para
descendants of the document root and thus selects all para
elements in the same document as the context node
//list/member
selects all the member
elements in the same document as the context node that have an list
parent
.
selects the context node
.//para
selects
the para
element descendants of the context node
..
selects the parent of the context node
../@lang
selects
the lang
attribute of the parent of the context node
para[@type="warning"]
selects all para
children of the context node that have a type
attribute with value warning
para[@type="warning"][5]
selects the fifth para
child of the context node that has a type
attribute with value warning
para[5][@type="warning"]
selects the fifth para
child of the context node if that child has a type
attribute with value warning
chapter[title="Introduction"]
selects the chapter
children of the context node that have one
or more title
children with string-value equal to Introduction
chapter[title]
selects the chapter
children of the context node that have one or more title
children
employee[@secretary and @assistant]
selects all
the employee
children of the context node that have both a secretary
attribute and
an assistant
attribute
book/(chapter|appendix)/section
selects
every section
element that has a parent that is either a chapter
or an appendix
element, that in turn is a child of a section
element that is a child of the context node.
book/xf:ID(publisher)/name
returns the same result as xf:ID(book/publisher)/name
.
XPath supports operators to construct and combine sequences. A sequence is an ordered collection of zero or more items. An item may be an atomic value or a node. An item is identical to a sequence of length one containing that item. Sequences are never nested--for example, combining the values 1, (2, 3), and ( ) into a single sequence results in the sequence (1, 2, 3).
[43] | ParenthesizedExpr | ::= | "(" ExprSequence? ")" |
[1] | ExprSequence | ::= | Expr ("," Expr)* |
[13] | RangeExpr | ::= | Expr "to" Expr |
One way to construct a sequence is with a ParenthesizedExpr, which is zero or more expressions separated by the comma (",") operator and delimited by parentheses. A parenthesized expression is evaluated by evaluating each of its constituent expressions and concatenating the resulting sequences, in order, into a single result sequence. A sequence may contain duplicate values or nodes, but a sequence is never an item in another sequence. When a new sequence is created by concatenating two or more input sequences, the new sequence contains all the items of the input sequences and its length is the sum of the lengths of the input sequences.
Here are some examples of expressions that construct sequences:
This expression is a sequence of five integers:
(10, 1, 2, 3, 4)
This expression constructs one sequence from the sequences 10, (1, 2), the empty sequence (), and (3, 4):
(10, (1, 2), (), (3, 4))
It evaluates to the sequence:
(10, 1, 2, 3, 4)
This expression contains
all salary
children of the context node followed by all bonus
children:
(salary, bonus)
Assuming that $price
is bound to
the value 10.50
, this expression:
($price, $price)
evaluates to the sequence
(10.50, 10.50)
A RangeExpr can be used to construct a sequence of consecutive
integers. The to
operator takes two operands, both of which have a required type of
integer. A sequence is constructed containing the two integer operands and
every integer between the two operands. If the first operand is less than the
second, the sequence is in increasing order, otherwise it is in decreasing
order.
This example uses a range expression inside a sequence expression:
(10, 1 to 4)
It evaluates to the sequence:
(10, 1, 2, 3, 4)
[16] | UnionExpr | ::= | Expr ("union" | "|") Expr |
[17] | IntersectExceptExpr | ::= | Expr ("intersect" | "except") Expr |
XPath provides several operators for combining sequences of
nodes. The union
and |
operators are equivalent. They take two node sequences as operands and
return a sequence containing all the nodes that occur in either of the
operands. The intersect
operator takes two node sequences as operands and returns a sequence
containing all the nodes that occur in both operands.
The except
operator takes two node sequences as operands and returns a sequence
containing all the nodes that occur in the first operand but not in the second
operand. All of these operators return their result sequences in document order
without duplicates based based on nodeid. If an operand
of union
, intersect
, or except
contains an item that is not a node, the error value is returned.
Here are some examples of expressions that combine sequences. Assume the existence of three element nodes that we will refer to by symbolic names A, B, and C. Assume that $seq1
is bound to a sequence containing A and B, $seq2
is also bound to a sequence containing A and B, and $seq3
is bound to a sequence containing B and C. Then:
$seq1 union $seq1
evaluates to a sequence containing A and B.
$seq2 union $seq3
evaluates to a sequence containing A, B, and C.
$seq1 intersect $seq1
evaluates to a sequence containing A and B.
$seq2 intersect $seq3
evaluates to a sequence containing B only.
$seq1 except $seq2
evaluates to the empty sequence.
$seq2 except $seq3
evaluates to a sequence containing A only.
In addition to the sequence operators described here,[XQuery 1.0 and XPath 2.0 Functions and Operators] includes functions for indexed access to items or sub-sequences of a sequence, for indexed insertion or removal of items in a sequence, and for removing duplicate values or nodes from a sequence.
XPath provides arithmetic operators for addition, subtraction, multiplication, division, and modulus, in their usual binary and unary forms.
[14] | AdditiveExpr | ::= | Expr ("+" | "-") Expr |
[15] | MultiplicativeExpr | ::= | Expr ("*" | "div" | "mod") Expr |
[18] | UnaryExpr | ::= | ("-" | "+") Expr |
The binary subtraction operator must be preceded by white space if it
follows an NCName, in order to distinguish it from a hyphen, which is a valid
name character. For example, a-b
will be interpreted as a single token.
An arithmetic expression is evaluated by applying the following rules, in order, until an error is encountered or a value is computed:
Atomization is applied to each operand, resulting in a single atomic value or an empty sequence for each operand.
If either operand is an empty sequence, the result of the operation is an empty sequence.
If an operand has the type xs:anySimpleType
, it is cast to xs:double
. If the cast fails, the error value is returned.
If the two operands have different types, and these types can be promoted to
a common type using the promotion rules in B.1 Type Promotion, the
operands are both promoted to their least common type. For example, if the first operand is of type hatsize
which is derived from xs:decimal
, and the second operand is of type shoesize
which is derived from xs:integer
, then both operands are promoted to the type xs:decimal
.
If the operand type(s) are valid for the given operator, the operator is applied to the operand(s), resulting in an atomic value or an error (for example, an error might result from dividing by zero.) The combinations of atomic types that are accepted by the various arithmetic operators, and their respective result types, are listed in B.2 Operator Mapping. If the operand type(s) are not valid for the given operator, a type exception is raised.
Here are some examples of arithmetic expressions:
In general, arithmetic operations on numeric values result in numeric values:
($salary + $bonus) div 12
Subtraction of two date values results in a value of type xs:dayTimeDuration
:
$emp/hiredate - $emp/birthdate
This example illustrates the difference between a subtraction operator and a hyphen:
$unit-price - $unit-discount
Unary operators have higher precedence than binary operators, subject of course to the use of parentheses:
-($bellcost + $whistlecost)
Comparison expressions allow two values to be compared. XPath provides four kinds of comparison expressions, called value comparisons, general comparisons, node comparisons, and order comparisons.
[9] | ValueComp | ::= | Expr ("eq" | "ne" | "lt" | "le" | "gt" | "ge") Expr |
[8] | GeneralComp | ::= | Expr ("=" | "!=" | "<" | "<=" | ">" | ">=") Expr |
[10] | NodeComp | ::= | Expr ("is" | "isnot") Expr |
[11] | OrderComp | ::= | Expr ("<<" | ">>" | "precedes" | "follows") Expr |
Value comparisons are intended for comparing single values. The result of a value comparison is defined by applying the following rules, in order:
Atomization is applied to each operand, resulting in a single atomic value or an empty sequence for each operand.
If either operand is an empty sequence, the result is an empty sequence.
If either operand has the type xs:anySimpleType
, that operand is cast to a required type,
which is determined as follows:
If the type of the other operand is numeric, the required type is
xs:double
.
If the type of the other operand is xs:anySimpleType
, the required type is xs:string
.
Otherwise, the required type is the type of the other operand.
If the cast fails, the error value is returned.
If the value comparison has two numeric operands of different types, one of
the operands is promoted to the type of the other operand, following the
promotion rules in B.1 Type Promotion. For example, a value of type xs:integer
can be promoted to xs:decimal
, and a value of
type xs:decimal
can be promoted to xs:double
.
The result of the comparison is true
if the value of the first operand is (equal, not equal, less than, less
than or equal, greater than, greater than or equal) to the value of the second
operand; otherwise the result of the comparison is false
. B.2 Operator Mapping describes which combinations of atomic types
are comparable, and how comparisons are performed on values of various types.
If the value of the first operand is not comparable with the value of the
second operand, a type exception is raised.
Here are some examples of value comparisons:
The following comparison is true only if $book1
has a single author
subelement and its value is "Kennedy":
$book1/author eq "Kennedy"
General comparisons are defined by adding existential semantics to value
comparisons. The operands of a general comparison may be sequences of any
length. The result of a general comparison is
always true
or false
.
The general comparison A = B
is true
for sequences A
and B
if the value comparison a eq b
is true
for some item a
in A
and some item b
in B
. Otherwise, A = B
is false
.
Similarly:
A != B
is true
if and only if a ne b
is true
for some a
in A
and some b
in B
.
A < B
is true
if and only if a lt b
is true
for
some a
in A
and some b
in B
.
A <= B
is true
if and only if a le b
is true
for some a
in A
and some b
in B
.
A > B
is true
if and only if a gt b
is true
for some a
in A
and some b
in B
.
A >= B
is true
if and only if a ge b
is true
for some a
in A
and some b
in B
.
Here is an example of a general comparison:
The following comparison is true if the value of any author
subelement of $book1
is "Kennedy":
$book1/author = "Kennedy"
The result of a node comparison is defined by applying the following rules, in order:
Both operands must be either a single node or an empty sequence; otherwise the error value is returned.
If either operand is an empty sequence, the result of the comparison is an empty sequence.
A comparison with the is
operator is true
if the two operands are nodes that have the same identity; otherwise it
is false
. A comparison with the isnot
operator is true
if the two operands are nodes that have different identities; otherwise
it is false
. See [XQuery 1.0 and XPath 2.0 Data Model] for a discussion of node identity.
Use of the is
operator is illustrated below.
The following comparison is true only if the left and right sides each evaluate to exactly the same single node:
//book[isbn="1558604820"] is //book[call="QA76.9 C3845"]
The result of an order comparison is defined by applying the following rules, in order:
Both operands must be either a single node or an empty sequence; otherwise the error value is returned.
If either operand is an empty sequence, the result of the comparison is an empty sequence.
A comparison with the <<
operator returns true
if the first operand node is earlier than the second operand node in
document order, or false
if the first operand node is later than the second operand node in
document order.
A comparison with the >>
operator returns true
if the first operand node is later than the second operand node in
document order, or false
if the first operand node is earlier than the second operand node in
document order.
A comparison with the precedes
operator returns true
if the first operand node is earlier than the second operand node in
document order and is not an ancestor of the second node;
otherwise it returns false
.
A comparison with the follows
operator returns true
if the first operand node is later than the second operand node in
document order and is not an descendant of the second node;
otherwise it returns false
.
Here is an example of an order comparison:
The following comparison is true only if the node identified by the left side occurs before the node identified by the right side in document order:
//purchase[parcel="28-451"] << //sale[parcel="33-870"]
A logical expression is either an and-expression or
an or-expression. In the absence of errors, the value of a logical expression is always one
of the boolean values true
or false
.
[3] | OrExpr | ::= | Expr "or" Expr |
[4] | AndExpr | ::= | Expr "and" Expr |
The first step in evaluating a logical expression is to reduce each of its
operands to an effective boolean value, which is true
, false
, or the error value. The effective boolean value of an operand is defined as follows:
If the operand is an empty sequence, its effective boolean value is false
.
If the operand is an atomic value of type xs:boolean
, the operand serves as its own effective boolean value.
If the operand is a sequence that contains at least one node and does not contain any item that is not a node, its effective
boolean value is true
. [Ed. Note: This rule is pending approval by the XSLT Working Group.]
In any other case, a type exception is raised.
The value of an and-expression is determined by the effective boolean values (EBV's) of its operands, according to the following table:
EBV2 = true | EBV2 = false | EBV2 = error | |
EBV1 = true | true | false | error |
EBV1 = false | false | false | false or error |
EBV1 = error | error | false or error | error |
The value of an or-expression is determined by the effective boolean values (EBV's) of its operands, according to the following table:
EBV2 = true | EBV2 = false | EBV2 = error | |
EBV1 = true | true | true | true or error |
EBV1 = false | true | false | false |
EBV1 = error | true or error | false | error |
The order in which the operands of a logical expression are evaluated is implementation-dependent. The tables above are defined in such a way that an or-expression can return true
if the first expression evaluated is true, and it can return the error value if the first expression evaluated contains an error. Similarly, an and-expression can return false
if the first expression evaluated is false, and it can return the error value if the first expression evaluated contains an error. As a result of these rules, the value of a logical expression is not deterministic in the presence of errors, as illustrated in the examples below.
Here are some examples of logical expressions:
The following expressions return true
:
1 = 1 and 2 = 2
1 = 1 or 2 = 3
The following expression may return either false
or the error value:
1 = 2 and 3 div 0 = 47
The following expression may return either true
or the error value:
1 = 1 or 3 div 0 = 47
The following expression returns the error value:
1 = 1 and 3 div 0 = 47
In addition to and- and or-expressions, XPath provides a function named not
that takes a general sequence as parameter and returns a boolean value.
The not
function reduces its parameter to an effective boolean value using the
same rules that are used for the operands of logical expressions. It then
returns true
if the effective boolean value of its parameter is false
, and false
if the effective boolean value of its parameter
is true
. If the effective boolean value of its operand is the error value, not
returns the error value. The not
function is described in [XQuery 1.0 and XPath 2.0 Functions and Operators].
Ed. Note: Functions named
and3
,or3
, andnot3
may be provided to implement three-valued logic. See Issue 28.
XPath provides a For expression for iteration. This kind of expression is often useful for computing joins between two or more documents and for restructuring data.
[5] | ForExpr | ::= | ForClause "return" Expr |
[25] | ForClause | ::= | "for" "$" QName "in" Expr ("," Variable "in" Expr)* |
The clauses of a For Expression are interpreted as follows:
A for
clause associates one or more variables with expressions, creating
tuples of variable bindings drawn from the Cartesian product of the sequences
of values to which the expressions evaluate. The variable binding tuples are
generated as an ordered sequence as described below.
The return
clause contains an expression that is used to construct the result of
the For expression. The return
clause is invoked once for every tuple generated by the for
clause. The expression in the return
clause is evaluated once for every invocation, and the result of the
For expression is an ordered sequence containing the results of these
invocations.
A variable name may not be used before it is bound, nor may it be used in
the expression to which it is bound. Any variable bound in a for
clause is in scope until the end of the For expression
in which it is bound. If the variable name used in the binding was already
bound in the current scope, the variable name refers to the newly bound
variable until that variable goes out of scope. At this point, the variable
name again refers to the variable of the prior binding.
If a for
clause contains multiple expressions, the tuples of variable bindings
are drawn from the Cartesian product of the sequences returned by the
expressions. The ordering of the tuples is governed by the ordering of the
sequences from which they were formed, working from left to right.
The following expression illustrates how tuples are generated from the
Cartesian product of expressions in a for
clause:
for $i in (1, 2), $j in (3, 4) return ($i, $j)
Here is the result of the above expression (the order is significant).Note that the result is presented as a sequence of numbers.
(1, 3, 1, 4, 2, 3, 2, 4)
The unordered
function indicates that the order of a sequence is not significant and
can be changed during processing of an expression. Using this function in the
expressions of a for
clause allows an implementation more freedom in optimization, and the
resulting queries may be faster. The following query returns the same results
as above, but the tuples may occur in any order.
for $i in unordered((1, 2)), $j in unordered((3, 4)) return ($i, $j)
The following example evaluates a bibliography document to create a sequence that contains each author's first and last name, followed by the titles of the books with that author. The example is based on the following input:
<bib> <book> <title>TCP/IP Illustrated</title> <author> W. Stevens </author> <publisher>Addison-Wesley</publisher> </book> <book> <title>Advanced Programming in the Unix environment</title> <author> W. Stevens </author> <publisher>Addison-Wesley</publisher> </book> </bib>
The author list is a list of authors, where each author element contains the
name of the author and a list of books written by that author. If an author has
written more than one book, that author's name will occur more than once in the
bibliography, but we want each author's name to occur only once in the author
list. We will remove duplicates using the distinct-values
function.
The distinct-values
function takes a sequence of nodes or values as input, and returns a
sequence in which duplicates have been removed by value. The order of this
sequence is not significant. Two elements are considered to have duplicate
values if their names, attributes, and normalized content are equal.
The following expression is used to transform the input bibliography into an author list:
for $a in distinct-values(//author) return ($a, for $b in //book[$b/author = $a] return $b/title)
Here is the result of the above expression. The result is presented as a sequence of elements.
(<author>W. Stevens</author>, <title>TCP/IP Illustrated</title>, <title>Advanced Programming in the Unix environment</title>)
Note:
Query writers should use caution when combining For expressions with
path expressions. It is important to remember that path expressions always
return their results in document order, whereas the order of the results of a
For expression are determined by the orderings of the sequences in the for
clause.
XPath supports a conditional expression based on the keywords if
, then
, and else
.
[7] | IfExpr | ::= | "if" "(" Expr ")" "then" Expr "else" Expr |
The expression following the if
keyword is called the test expression, and the expressions
following the then
and else
keywords are called result expressions.
The first step in processing a conditional expression is to find the effective boolean value of the test expression, as defined in 2.7 Logical Expressions.
The value of a conditional expression is defined as follows: If the
effective boolean value of the test expression is true
, the value of the first ("then") result expression is returned. If the
effective boolean value of the test expression is false
, the value of the second ("else") result expression is returned.
Here are some examples of conditional expressions:
In this example, the test expression is a comparison expression:
if ($widget1/unit-cost < $widget2/unit-cost) then $widget1 else $widget2
In this example, the test expression tests for the existence of an attribute
named discounted
, independently of its value:
if ($part/@discounted) then $part/wholesale else $part/retail
Quantified expressions support existential and universal quantification. The
value of a quantified expression is always true
or false
.
[6] | QuantifiedExpr | ::= | ("some" "$" | "every" "$") QName "in" Expr ("," Variable "in" Expr)* "satisfies" Expr |
A quantified expression begins with
a quantifier, which is the keyword some
or every
, followed by one or more in-clauses that are used to bind variables,
followed by the keyword satisfies
and a test expression. Each in-clause associates a variable with an
expression that returns a sequence of values. As in the case of a for-clause in
a FLWR-expression, the in-clauses generate tuples of variable bindings, using
values drawn from the Cartesian product of the sequences returned by the
binding expressions. Conceptually, the test expression is evaluated for each
tuple of variable bindings. Results depend on the effective boolean values of the test expressions, as defined in 2.7 Logical Expressions. The value of the quantified expression is defined
by the following rules:
If the quantifier is some
, the quantified expression is true
if at least one evaluation of the test expression has the effective
boolean value true
; otherwise the quantified expression is false
. This rule implies that, if the in-clauses generate zero binding
tuples, the value of the quantified expression is false
.
If the quantifier is every
, the quantified expression is true
if every evaluation of the test expression has the effective
boolean value true
; otherwise the quantified expression is false
. This rule implies that, if the in-clauses generate zero binding
tuples, the value of the quantified
expression is true
.
The order in which test expressions are evaluated for the various binding
tuples is implementation-defined. If the quantifier
is some
, an implementation may
return true
as soon as it finds one binding tuple for which the test expression has
an effective Boolean value of true
, and it may return an error as soon as it finds one binding tuple for
which the test expression returns an error. Similarly, if the quantifier is every
, an implementation may return false
as soon as it finds one binding tuple for which the test expression has
an effective Boolean value of false
, and it may return an error as soon as it finds one binding tuple for
which the test expression returns an error. As a result of these rules, the
value of a quantified expression is not deterministic in the presence of
errors, as illustrated in the examples below.
Here are some examples of quantified expressions:
This expression is true
if every part
element has a discounted
attribute (regardless of the values of these attributes):
every $part in //part satisfies $part/@discounted
This expression is true
if at least
one employee
element satisfies the given comparison expression:
some $emp in //employee satisfies ($emp/bonus > 0.25 * $emp/salary)
In the following examples, each quantified expression evaluates its test
expression over nine tuples of variable bindings, formed from the Cartesian
product of the sequences (1, 2, 3)
and (2, 3, 4)
. The expression beginning with some
evaluates to true
, and the expression beginning with every
evaluates to false
.
some $x in (1, 2, 3), $y in (2, 3, 4) satisfies $x + $y = 4 every $x in (1, 2, 3), $y in (2, 3, 4) satisfies $x + $y = 4
This quantified expression may return either true
or the error value, since its test expression returns true
for one variable binding
and the error value for another:
some $x in (1, 2, "cat") satisfies $x * 2 = 4
This quantified expression may return either false
or the error value, since its test expression returns false
for one variable binding and the error value for another:
every $x in (1, 2, "cat") satisfies $x * 2 = 4
SequenceTypes occur explicitly in several kinds of XPath expressions.
[12] | InstanceofExpr | ::= | Expr "instance" "of" SequenceType |
[20] | CastExpr | ::= | ("cast" "as" | "treat" "as" | "assert" "as") SequenceType ParenthesizedExpr |
The boolean
operator instance of
returns true
if the value of its first operand matches the type named in its second
operand, according to the rules for SequenceType Matching; otherwise it returns false
. Examples:
$x instance of element of type animal
This example returns true
if the value associated with variable $x
is an element whose content is a value of the type animal
.
<a>5</a> instance of xs:integer
This example returns false
because the given value is not an integer; instead, it is an element whose value is an integer.
<a>5</a> instance of element of type xs:integer
This example returns true
because the given value matches the given type according to the rules for SequenceType Matching.
Occasionally it is necessary to convert a value to a specific datatype. For this purpose, XPath provides a cast
expression that creates a new value of a specific type based on an existing value. A cast
expression takes two operands: an input expression and a SequenceType, called the target type. The cast
expression first performs atomization on its input expression, resulting in a single atomic input value or the empty sequence. If the input value is the empty sequence, the cast
expression returns an empty sequence. Otherwise, the cast
expression creates a new instance of the target type that is equal to the input value. The type of the input value is called the input type. cast
is supported only for certain combinations of input type and target type, as listed below:
cast
is supported for the combinations of input type and target type listed in [XQuery 1.0 and XPath 2.0 Functions and Operators]. For each of these combinations, both the input type and the target type are primitive schema types. For example, a value of type xs:string
can be cast into the type xs:decimal
.
A value of a derived atomic type can always be cast into its base type. For example, if the type shoesize
is derived by restriction from the type xs:integer
, a value of type shoesize
can always be cast into the type xs:integer
.
For any combination of input type and target type that is not in the above list, a cast
expression returns the error value.
If the input value is not in the value space of the target type, the error value is returned. A cast
expression also returns the error value if any facet of the target type is not satisfied. For example, cast as xs:integer($x)
returns the error value if the value of $x
is 4.99
because this value cannot be represented with zero fractional digits.
Note:
The working group has declared an intention to support casts to user-defined target types, subject to certain restrictions. Work is in progress to define the semantics of these casts.
In addition to cast
, XPath provides type-checking expressions called treat
and assert
. Each of these expressions takes two operands: an expression and a SequenceType. Unlike cast
, however, treat
and assert
do not change the type or value of their operands. Instead, the purpose of a treat
or assert
expression is to ensure that its operand has an expected type. Each of these expressions has semantics that are applied during static type-checking, and additional semantics that are applied during expression evaluation. If static type checking is disabled or not supported, only the run-time semantics of treat
and assert
apply. The semantics of the two expressions are as follows:
Semantics of treat as type1 (expr2)
:
During static type checking:
type1
must be a subtype of the static type of expr2
, using the definition of subtype in [XQuery 1.0 Formal Semantics]--otherwise, a static error is raised. The static type of the treat
expression is type1
. This enables the expression to be used as an argument of a function that
requires a parameter of type1
.
During expression evaluation (at "run-time"):
If expr2
matches type1
, using the SequenceType Matching rules in [id-sequencetype], the treat
expression returns the value of expr2
; otherwise, it returns the error value. If the value of expr2
is returned, its identity is preserved. The treat
expression ensures that the value of its expression operand conforms to the expected type at run-time.
Example:
treat as element of type USAddress ($myaddress)
The static type of $myaddress
may be element of type Address
, a less specific type than element of type USAddress
. However, at run-time, the value of $myaddress
must match the type element of type USAddress
using SequenceType Matching rules; otherwise the error value is returned.
Semantics of assert as type1 (expr2)
:
During static type checking:
The static type of expr2
must be a subtype of type1
, using the definition of subtype in [XQuery 1.0 Formal Semantics]--otherwise, a static error is raised. The static type of the assert
expression is type1
. assert
provides a stronger static type guarantee than treat
.
During expression evaluation (at "run-time"):
If expr2
matches type1
, using the SequenceType Matching rules in [id-sequencetype], the assert
expression returns the value of expr2
; otherwise, it returns the error value. If the value of expr2
is returned, its identity is preserved. If the assert
expression has passed static type checking without an error, and expr2
does not return an error, then the assert
expression will never return the error value at run-time.
Example:
assert as element of type USAddress ($myaddress)
The static type of $myaddress
must be element of type USAddress
or one of its proper subtypes, and at run-time, the value of $myaddress
must match the type element of type USAddress
using SequenceType Matching rules; otherwise the error value is returned.
[19] | ValidateExpr | ::= | "validate" SchemaContext? "{" Expr "}" |
Ed. Note: Curly braces in this syntax may cause problems if this expression is embedded in XSLT--see Issue 267.)
A validate
expression validates its argument with respect to the in-scope schema definitions, using the schema validation process described in [XML Schema]. The argument of a validate expression may be any sequence of elements. Validation replaces element and attribute nodes with new nodes that have their own identity and that contain type
annotations and defaults created by the validation process. If a node that has a parent is validated, the parent of the original node will not be the parent of the validated node.
To allow locally declared elements and attributes to be validated, a schema context may optionally be specified. If no context is specified, all top-level names in the material to be validated are treated as global names.
The following example validates the value that is bound to a variable:
validate { $x }
The validate
expression invokes the full schema validation process, except that identity
constraints, as defined in section 3.11.4 of [XML Schema]
Part 1, are not applied. All facets of simple types are checked, and
default values are supplied as defined in the XML Schema
specification.
Validating an expression is equivalent to the following series of steps:
Serialize the value of the expression, using xsi:type
attributes to indicate the types of elements that have type annotations or that contain a single atomic value of a known type (however, do not generate an xsi:type
attribute for any element that already has such an attribute).
Invoke schema validation on the resulting serialized expression, using the in-scope schema definitions.
Remove any xsi:type
attributes that were generated in Step 1.
A validate expression may contain a SchemaContext that is used in validating locally declared elements and attributes. When
a schema context is supplied, all element QNames are interpreted as they
would be if found in that context in an XML document. If the schema context begins with a QName, the QName is interpreted as the name of a globally
declared element; however, if the schema context begins with the keyword type
, the first QName is interpreted as the name of a globally declared type. The steps inside the schema context trace a path relative to the globally declared element or type, as illustrated in the following examples, which are based on schemas defined in [XML Schema], Part 0:
Suppose that $x
is bound to a shipTo
element. Then validate in po:purchaseOrder {$x}
validates the value of $x
in the context of the global element declaration po:purchaseOrder
.
Suppose that $y
is bound to an productName
element. Then validate in po:purchaseOrder/items/item {$y}
validates the value of $y
in the context of an item
element, inside an items
element, inside the global element declaration po:purchaseOrder
.
Suppose that $z
is bound to a zip
element. Then validate in type po:USAddress {$z}
validates the value of $z
in the context of the global type declaration po:USAddress
.
Under certain circumstances, validation of an element or attribute may result in the loss of some type information. The following examples illustrate some of these circumstances:
validate { <sizes>{1, 2, 3}</sizes> }
The constructed <sizes>
element node has no type annotation. Its value is a sequence of integers, but "sequence of integers" is not a built-in type that can be represented by an xsi:type
attribute.
The effective serialized value to be validated is <sizes>1 2 3</sizes>
. After validation, if no more specific type is found, the value of the <sizes>
element will be "1 2 3
", an instance of xs:anySimpleType
.
validate { <animal>{ "A cat", "named Oscar" }</animal> }
The constructed animal
element node has no type annotation. Its value was derived from two strings, but the boundaries between the strings will be lost during validation.
The effective serialized value to be validated is <animal>A cat named Oscar</animal>
. If animal
is a global element declared to have xs:string
as its type, the validated value of the element will consist of a single string. On the other hand, if the declared type of animal
is xs:string*
, the validated value of the element will consist of the following four strings: "A
", "cat
", "named
", and "Oscar
".
validate { <mixture>{ 1, "2", "three" }</mixture> }
The constructed <mixture>
element node has no type annotation. Its typed value consists of an integer and two strings, but there is no possible schema type that can be assigned to the element node that will preserve this type information.
The effective serialized value to be validated is <mixture>1 2 three</mixture>
. After validation, the value of the <mixture>
element might be two integers and a string, or three strings, or one string.
validate { <shoe size="{7}"/> }
The constructed size
attribute node has no type annotation. Its value is an integer, but there is no way to represent the type of a serialized attribute.
The effective serialized value to be validated is <shoe size="7"/>
. After validation, if no more specific type is found, the value of the size
attribute will be "7
", an instance of xs:anySimpleType
.
The following grammar uses the same Basic EBNF notation as [XML], except that grammar symbols always have initial capital letters. The EBNF contains only non-terminals, and all terminals are presented in a separate table.
Note:
Note that the Semicolon character is reserved for future use.
Ed. Note: It is likely that the Working Groups will specify a system of built-in precedence in future drafts, at least for the normative BNF in this appendix. It is recognized that the current table-driven approach contains some bugs.
In the following table, operators with a higher precedence number are more tightly bound than operators with a lower precedence number. Operators listed at the same level are evaluated from left to right.
Precedence# | Productions |
---|---|
1 | OrExpr |
2 | AndExpr |
3 | ForExpr, QuantifiedExpr, IfExpr |
4 | GeneralComp, ValueComp, NodeComp, OrderComp |
5 | InstanceofExpr |
6 | RangeExpr |
7 | AdditiveExpr |
8 | MultiplicativeExpr |
9 | UnionExpr |
10 | IntersectExceptExpr |
11 | UnaryExpr |
12 | ValidateExpr |
13 | CastExpr |
14 | RootedPathExpr |
15 | RelativePathExpr |
16 | PrimaryExpr |
17 | StepExpr |
A token as defined by this specification is a lexical unit specified by the TERMINALS section. A token symbol is the symbolic name given to that token. A token part is the most atomic part of a token. For instance, AxisDescendantOrSelf has two token parts, "descendant-or-self" and "::".
For readability, Whitespace may be used in expressions even though not explicitly allowed by the grammar: Whitespace may be freely added between tokens and token parts, except in a few cases where whitespace is needed to disambiguate the token:
A < symbol, when used as a less-than sign in comparisons, must always be followed by whitespace to distinguish it from the opening character in a tag. In tags, whitespace may not occur after the < symbol.
In XML, "-" is a valid character in an element or attribute name. When used as an operator after the characters of a name, it must be separated from the name, eg by using whitespace or parentheses.
A lexical state is a condition that is created by a previous token, or else is the starting state of the lexer. Tokens are often only recognized in a specific lexical state, and a token in turn may cause the lexer to transition to a different state. The details of these state transitions are given in the section on Lexical States.
When tokenizing, the longest possible token is always returned that would be valid in the current syntactic context.. If there is an ambiguity between two tokens that isn't resolved by the longest match rule, the token that has a lower grammar number is more overrides a token with a higher grammar number.
All keywords and tokens are case sensitive.
ExprComment tokens should be ignored by the parser.
[55] | ExprComment | ::= | "{--" [^}]* "--}" |
[56] | S | ::= | WhitespaceChar+ |
[57] | AxisChild | ::= | "child" "::" |
[58] | AxisDescendant | ::= | "descendant" "::" |
[59] | AxisParent | ::= | "parent" "::" |
[60] | AxisAttribute | ::= | "attribute" "::" |
[61] | AxisSelf | ::= | "self" "::" |
[62] | AxisDescendantOrSelf | ::= | "descendant-or-self" "::" |
[63] | AxisAncestor | ::= | "ancestor" "::" |
[64] | AxisFollowingSibling | ::= | "following-sibling" "::" |
[65] | AxisPrecedingSibling | ::= | "preceding-sibling" "::" |
[66] | AxisFollowing | ::= | "following" "::" |
[67] | AxisPreceding | ::= | "preceding" "::" |
[68] | AxisNamespace | ::= | "namespace" "::" |
[69] | AxisAncestorOrSelf | ::= | "ancestor-or-self" "::" |
[70] | Or | ::= | "or" |
[71] | And | ::= | "and" |
[72] | AtKeyword | ::= | "at" |
[73] | Div | ::= | "div" |
[74] | Mod | ::= | "mod" |
[75] | Multiply | ::= | "*" |
[76] | In | ::= | "in" |
[77] | Satisfies | ::= | "satisfies" |
[78] | Return | ::= | "return" |
[79] | Then | ::= | "then" |
[80] | Else | ::= | "else" |
[81] | To | ::= | "to" |
[82] | Intersect | ::= | "intersect" |
[83] | Union | ::= | "union" |
[84] | Except | ::= | "except" |
[85] | Precedes | ::= | "precedes" |
[86] | Follows | ::= | "follows" |
[87] | Instanceof | ::= | "instance" "of" |
[88] | Element | ::= | "element" |
[89] | Item | ::= | "item" |
[90] | Attribute | ::= | "attribute" |
[91] | OfType | ::= | "of" "type" |
[92] | AtomicValue | ::= | "atomic" "value" |
[93] | Type | ::= | "type" |
[94] | Node | ::= | "node" |
[95] | Empty | ::= | "empty" |
[96] | Nmstart | ::= | Letter | "_" |
[97] | Nmchar | ::= | Letter | CombiningChar | Extender | Digit | "." | "-" | "_" |
[98] | Star | ::= | "*" |
[99] | NCNameColonStar | ::= | ":"? NCName ":" "*" |
[100] | StarColonNCName | ::= | "*" ":" NCName |
[101] | Root | ::= | "/" |
[102] | RootDescendants | ::= | "//" |
[103] | Slash | ::= | "/" |
[104] | SlashSlash | ::= | "//" |
[105] | Equals | ::= | "=" |
[106] | Is | ::= | "is" |
[107] | NotEquals | ::= | "!=" |
[108] | IsNot | ::= | "isnot" |
[109] | LtEquals | ::= | "<=" |
[110] | LtLt | ::= | "<<" |
[111] | GtEquals | ::= | ">=" |
[112] | GtGt | ::= | ">>" |
[113] | FortranEq | ::= | "eq" |
[114] | FortranNe | ::= | "ne" |
[115] | FortranGt | ::= | "gt" |
[116] | FortranGe | ::= | "ge" |
[117] | FortranLt | ::= | "lt" |
[118] | FortranLe | ::= | "le" |
[119] | Lt | ::= | "<" |
[120] | Gt | ::= | ">" |
[121] | Minus | ::= | "-" |
[122] | Plus | ::= | "+" |
[123] | QMark | ::= | "?" |
[124] | Arrow | ::= | "=>" |
[125] | Vbar | ::= | "|" |
[126] | Lpar | ::= | "(" |
[127] | At | ::= | "@" |
[128] | Lbrack | ::= | "[" |
[129] | Rpar | ::= | ")" |
[130] | Rbrack | ::= | "]" |
[131] | Variable | ::= | "$" QName |
[132] | Some | ::= | "some" "$" |
[133] | Every | ::= | "every" "$" |
[134] | ForVariable | ::= | "for" "$" |
[135] | CastAs | ::= | "cast" "as" |
[136] | AssertAs | ::= | "assert" "as" |
[137] | TreatAs | ::= | "treat" "as" |
[138] | Validate | ::= | "validate" |
[139] | Digits | ::= | [0-9]+ |
[140] | IntegerLiteral | ::= | Digits |
[141] | DecimalLiteral | ::= | ("." Digits) | (Digits "." [0-9]*) |
[142] | DoubleLiteral | ::= | (("." Digits) | (Digits ("." [0-9]*)?)) ([e] | [E]) ([+] | [-])? Digits |
[143] | Comment | ::= | "comment" |
[144] | Document | ::= | "document" |
[145] | Text | ::= | "text" |
[146] | Unknown | ::= | "unknown" |
[147] | ProcessingInstruction | ::= | "processing-instruction" |
[148] | NodeLpar | ::= | "node" "(" |
[149] | CommentLpar | ::= | "comment" "(" |
[150] | TextLpar | ::= | "text" "(" |
[151] | ProcessingInstructionLpar | ::= | "processing-instruction" "(" |
[152] | IfLpar | ::= | "if" "(" |
[153] | Comma | ::= | "," |
[154] | StringLiteral | ::= | (["] ((" ") | [^"])* ["]) | (['] ((' ') | [^'])* [']) |
[155] | Dot | ::= | "." |
[156] | DotDot | ::= | ".." |
[157] | NCName | ::= | Nmstart Nmchar* |
[158] | QName | ::= | ":"? NCName (":" NCName)? |
[159] | QNameLpar | ::= | QName "(" |
[160] | Lbrace | ::= | "{" |
[161] | Rbrace | ::= | "}" |
[162] | Char | ::= | ([#x0009] | [#x000D] | [#x000A] | [#x0020-#xFFFD]) |
[163] | WhitespaceChar | ::= | ([#x0009] | [#x000D] | [#x000A] | [#x0020]) |
[164] | Letter | ::= | BaseChar | Ideographic |
[165] | BaseChar | ::= | ([#x0041-#x005A] | [#x0061-#x007A] | [#x00C0-#x00D6] | [#x00D8-#x00F6] | [#x00F8-#x00FF] | [#x0100-#x0131] | [#x0134-#x013E] | [#x0141-#x0148] | [#x014A-#x017E] | [#x0180-#x01C3] | [#x01CD-#x01F0] | [#x01F4-#x01F5] | [#x01FA-#x0217] | [#x0250-#x02A8] | [#x02BB-#x02C1] | [#x0386] | [#x0388-#x038A] | [#x038C] | [#x038E-#x03A1] | [#x03A3-#x03CE] | [#x03D0-#x03D6] | [#x03DA] | [#x03DC] | [#x03DE] | [#x03E0] | [#x03E2-#x03F3] | [#x0401-#x040C] | [#x040E-#x044F] | [#x0451-#x045C] | [#x045E-#x0481] | [#x0490-#x04C4] | [#x04C7-#x04C8] | [#x04CB-#x04CC] | [#x04D0-#x04EB] | [#x04EE-#x04F5] | [#x04F8-#x04F9] | [#x0531-#x0556] | [#x0559] | [#x0561-#x0586] | [#x05D0-#x05EA] | [#x05F0-#x05F2] | [#x0621-#x063A] | [#x0641-#x064A] | [#x0671-#x06B7] | [#x06BA-#x06BE] | [#x06C0-#x06CE] | [#x06D0-#x06D3] | [#x06D5] | [#x06E5-#x06E6] | [#x0905-#x0939] | [#x093D] | [#x0958-#x0961] | [#x0985-#x098C] | [#x098F-#x0990] | [#x0993-#x09A8] | [#x09AA-#x09B0] | [#x09B2] | [#x09B6-#x09B9] | [#x09DC-#x09DD] | [#x09DF-#x09E1] | [#x09F0-#x09F1] | [#x0A05-#x0A0A] | [#x0A0F-#x0A10] | [#x0A13-#x0A28] | [#x0A2A-#x0A30] | [#x0A32-#x0A33] | [#x0A35-#x0A36] | [#x0A38-#x0A39] | [#x0A59-#x0A5C] | [#x0A5E] | [#x0A72-#x0A74] | [#x0A85-#x0A8B] | [#x0A8D] | [#x0A8F-#x0A91] | [#x0A93-#x0AA8] | [#x0AAA-#x0AB0] | [#x0AB2-#x0AB3] | [#x0AB5-#x0AB9] | [#x0ABD] | [#x0AE0] | [#x0B05-#x0B0C] | [#x0B0F-#x0B10] | [#x0B13-#x0B28] | [#x0B2A-#x0B30] | [#x0B32-#x0B33] | [#x0B36-#x0B39] | [#x0B3D] | [#x0B5C-#x0B5D] | [#x0B5F-#x0B61] | [#x0B85-#x0B8A] | [#x0B8E-#x0B90] | [#x0B92-#x0B95] | [#x0B99-#x0B9A] | [#x0B9C] | [#x0B9E-#x0B9F] | [#x0BA3-#x0BA4] | [#x0BA8-#x0BAA] | [#x0BAE-#x0BB5] | [#x0BB7-#x0BB9] | [#x0C05-#x0C0C] | [#x0C0E-#x0C10] | [#x0C12-#x0C28] | [#x0C2A-#x0C33] | [#x0C35-#x0C39] | [#x0C60-#x0C61] | [#x0C85-#x0C8C] | [#x0C8E-#x0C90] | [#x0C92-#x0CA8] | [#x0CAA-#x0CB3] | [#x0CB5-#x0CB9] | [#x0CDE] | [#x0CE0-#x0CE1] | [#x0D05-#x0D0C] | [#x0D0E-#x0D10] | [#x0D12-#x0D28] | [#x0D2A-#x0D39] | [#x0D60-#x0D61] | [#x0E01-#x0E2E] | [#x0E30] | [#x0E32-#x0E33] | [#x0E40-#x0E45] | [#x0E81-#x0E82] | [#x0E84] | [#x0E87-#x0E88] | [#x0E8A] | [#x0E8D] | [#x0E94-#x0E97] | [#x0E99-#x0E9F] | [#x0EA1-#x0EA3] | [#x0EA5] | [#x0EA7] | [#x0EAA-#x0EAB] | [#x0EAD-#x0EAE] | [#x0EB0] | [#x0EB2-#x0EB3] | [#x0EBD] | [#x0EC0-#x0EC4] | [#x0F40-#x0F47] | [#x0F49-#x0F69] | [#x10A0-#x10C5] | [#x10D0-#x10F6] | [#x1100] | [#x1102-#x1103] | [#x1105-#x1107] | [#x1109] | [#x110B-#x110C] | [#x110E-#x1112] | [#x113C] | [#x113E] | [#x1140] | [#x114C] | [#x114E] | [#x1150] | [#x1154-#x1155] | [#x1159] | [#x115F-#x1161] | [#x1163] | [#x1165] | [#x1167] | [#x1169] | [#x116D-#x116E] | [#x1172-#x1173] | [#x1175] | [#x119E] | [#x11A8] | [#x11AB] | [#x11AE-#x11AF] | [#x11B7-#x11B8] | [#x11BA] | [#x11BC-#x11C2] | [#x11EB] | [#x11F0] | [#x11F9] | [#x1E00-#x1E9B] | [#x1EA0-#x1EF9] | [#x1F00-#x1F15] | [#x1F18-#x1F1D] | [#x1F20-#x1F45] | [#x1F48-#x1F4D] | [#x1F50-#x1F57] | [#x1F59] | [#x1F5B] | [#x1F5D] | [#x1F5F-#x1F7D] | [#x1F80-#x1FB4] | [#x1FB6-#x1FBC] | [#x1FBE] | [#x1FC2-#x1FC4] | [#x1FC6-#x1FCC] | [#x1FD0-#x1FD3] | [#x1FD6-#x1FDB] | [#x1FE0-#x1FEC] | [#x1FF2-#x1FF4] | [#x1FF6-#x1FFC] | [#x2126] | [#x212A-#x212B] | [#x212E] | [#x2180-#x2182] | [#x3041-#x3094] | [#x30A1-#x30FA] | [#x3105-#x312C] | [#xAC00-#xD7A3]) |
[166] | Ideographic | ::= | ([#x4E00-#x9FA5] | [#x3007] | [#x3021-#x3029]) |
[167] | CombiningChar | ::= | ([#x0300-#x0345] | [#x0360-#x0361] | [#x0483-#x0486] | [#x0591-#x05A1] | [#x05A3-#x05B9] | [#x05BB-#x05BD] | [#x05BF] | [#x05C1-#x05C2] | [#x05C4] | [#x064B-#x0652] | [#x0670] | [#x06D6-#x06DC] | [#x06DD-#x06DF] | [#x06E0-#x06E4] | [#x06E7-#x06E8] | [#x06EA-#x06ED] | [#x0901-#x0903] | [#x093C] | [#x093E-#x094C] | [#x094D] | [#x0951-#x0954] | [#x0962-#x0963] | [#x0981-#x0983] | [#x09BC] | [#x09BE] | [#x09BF] | [#x09C0-#x09C4] | [#x09C7-#x09C8] | [#x09CB-#x09CD] | [#x09D7] | [#x09E2-#x09E3] | [#x0A02] | [#x0A3C] | [#x0A3E] | [#x0A3F] | [#x0A40-#x0A42] | [#x0A47-#x0A48] | [#x0A4B-#x0A4D] | [#x0A70-#x0A71] | [#x0A81-#x0A83] | [#x0ABC] | [#x0ABE-#x0AC5] | [#x0AC7-#x0AC9] | [#x0ACB-#x0ACD] | [#x0B01-#x0B03] | [#x0B3C] | [#x0B3E-#x0B43] | [#x0B47-#x0B48] | [#x0B4B-#x0B4D] | [#x0B56-#x0B57] | [#x0B82-#x0B83] | [#x0BBE-#x0BC2] | [#x0BC6-#x0BC8] | [#x0BCA-#x0BCD] | [#x0BD7] | [#x0C01-#x0C03] | [#x0C3E-#x0C44] | [#x0C46-#x0C48] | [#x0C4A-#x0C4D] | [#x0C55-#x0C56] | [#x0C82-#x0C83] | [#x0CBE-#x0CC4] | [#x0CC6-#x0CC8] | [#x0CCA-#x0CCD] | [#x0CD5-#x0CD6] | [#x0D02-#x0D03] | [#x0D3E-#x0D43] | [#x0D46-#x0D48] | [#x0D4A-#x0D4D] | [#x0D57] | [#x0E31] | [#x0E34-#x0E3A] | [#x0E47-#x0E4E] | [#x0EB1] | [#x0EB4-#x0EB9] | [#x0EBB-#x0EBC] | [#x0EC8-#x0ECD] | [#x0F18-#x0F19] | [#x0F35] | [#x0F37] | [#x0F39] | [#x0F3E] | [#x0F3F] | [#x0F71-#x0F84] | [#x0F86-#x0F8B] | [#x0F90-#x0F95] | [#x0F97] | [#x0F99-#x0FAD] | [#x0FB1-#x0FB7] | [#x0FB9] | [#x20D0-#x20DC] | [#x20E1] | [#x302A-#x302F] | [#x3099] | [#x309A]) |
[168] | Digit | ::= | ([#x0030-#x0039] | [#x0660-#x0669] | [#x06F0-#x06F9] | [#x0966-#x096F] | [#x09E6-#x09EF] | [#x0A66-#x0A6F] | [#x0AE6-#x0AEF] | [#x0B66-#x0B6F] | [#x0BE7-#x0BEF] | [#x0C66-#x0C6F] | [#x0CE6-#x0CEF] | [#x0D66-#x0D6F] | [#x0E50-#x0E59] | [#x0ED0-#x0ED9] | [#x0F20-#x0F29]) |
[169] | Extender | ::= | ([#x00B7] | [#x02D0] | [#x02D1] | [#x0387] | [#x0640] | [#x0E46] | [#x0EC6] | [#x3005] | [#x3031-#x3035] | [#x309D-#x309E] | [#x30FC-#x30FE]) |
Some tokens are ambiguous unless disambiguated by state. For example:
In order to disambiguate such tokens, we define OPERATOR and DEFAULT lexical states. The DEFAULT state applies to noun-like tokens, and the OPERATOR state applies to verb-like tokens. In addition, some basic tokens such as Whitespace, will be recognized in any state. The start state of an expression is DEFAULT. Each token causes a defined state change. All such transitions are defined in the table below for each token. There are five specific transitions, and a default transition:
This transition is defined for tokens that must only be recognized when in the DEFAULT state (an example is Star), as opposed to being recognized when in the OPERATOR state (an example is Multiply). This transition itself is the same as the default transition, but the recognition criteria is tightened up to remove ambiguity.
This transition is defined for most operator tokens. Operators occur after a noun-like token.
This transition generally occurs for tokens that start compound enclosures, such as a function start or a left grouping parenthesis. The closing of such a grouping will transition to an OPERATOR state.
This transition is defined for those tokens that act as a modifier to the previous noun-like token, and can occur in both the DEFAULT and OPERATOR states. Examples of these are Plus and Minus, which can be either a unary operator or a binary mathematical operator, and Lbrack, which can occur after a node test in when the state is either OPERATOR or DEFAULT.
This transition is the default for primitive tokens that may be used to construct other tokens or will not have an effect on the expression.
This transition is the default for all tokens not specified in the table below, and specifies that these tokens are noun-like, and may operated upon by a verb.
Any lexical pattern that is not recognized under a given state will be an unrecognized token, and thus an error.
An operator that immediately follows a "/" or "//" when used as a root symbol, should not parse. For example, the following expression, which the expression writer may intend to parse as (/) * foo
(value of the root element multiplied by the value of the foo element) would parse as (/*) foo
, and thus would be an error:
/ * foo
This must instead be written as:
(/) * foo
Ed. Note: Compound tokens are sometimes used in this grammar. For instance,
QNameLpar
is used to disambiguate a function name from a node name. In the long run, we will probably deal with these by specifying lexical look-ahead rather than compound tokens.
tokens | recognize state | next state | action |
---|---|---|---|
Star | DEFAULT | OPERATOR | |
Slash SlashSlash Comma Div Mod And Or Multiply In Return Then Else To Instanceof Union Intersect Except Equals Is NotEquals IsNot LtEquals GtEquals Lt Gt Vbar Precedes Follows LtLt GtGt FortranEq FortranNe FortranGt FortranGe FortranLt FortranLe Arrow Item Attribute Element Node QMark Document Comment Text Type | OPERATOR | DEFAULT | |
Root RootDescendants QNameLpar NodeLpar CommentLpar TextLpar ProcessingInstructionLpar At IfLpar AxisChild AxisDescendant AxisParent AxisAttribute AxisSelf AxisDescendantOrSelf AxisAncestor AxisFollowingSibling AxisPrecedingSibling AxisFollowing AxisPreceding AxisNamespace AxisAncestorOrSelf | DEFAULT | DEFAULT | |
Lbrack Plus Minus Lpar | DEFAULT OPERATOR | DEFAULT | |
WhitespaceChar Nmstart Nmchar Digits NCName Letter BaseChar Ideographic CombiningChar Digit Extender S ExprComment |
Under certain circumstances, an atomic value can be promoted from
one type to another. The promotion rules listed below are used in
basic type conversions (see 2.1.3.3 Type Conversions) and
during processing of arithmetic expressions (see 2.5 Arithmetic Expressions) and value comparisons (see 2.6.1 Value Comparisons). The rules may be applied transitively. For example, since xs:integer
is promotable to
xs:decimal
and xs:decimal
is promotable to
xs:float
, it follows that xs:integer
is
promotable to xs:float
, without necessarily passing
through the intermediate xs:decimal
type.
The following type promotions are permitted:
A value of type xs:decimal
can be
promoted to the type xs:float
.
A value of type xs:float
can be promoted to the
type xs:double
.
A value of a derived
type can be promoted to its base type. As an example of this rule, a
value of the derived type xs:integer
can be promoted to
its base type xs:decimal
.
The tables in this section list the combinations of datatypes for which the various operators of XPath are defined. For each valid combination of datatypes, the table indicates the function(s) that are used to implement the operator and the datatype of the result. Definitions of the functions can be found in [XQuery 1.0 and XPath 2.0 Functions and Operators]. Note that in some cases the function does not implement the full semantics of the given operator. For a complete description of each operator (including its behavior for empty sequences or sequences of length greater than one), see the descriptive material in the main part of this document.
In the following tables, the term numeric refers to
the types xs:integer
, xs:decimal
,
xs:float
, and xs:double
. When the result
type of an operator is listed as numeric, it means "same as the
highest type of any input operand, in promotion order." For example,
when invoked with operands of type xs:integer
and
xs:float
, the binary +
operator returns a
result of type xs:float
.
In the following tables,
the term Gregorian refers to the types
xs:gYearMonth
, xs:gYear
,
xs:gMonthDay
, xs:gDay
, and
xs:gMonth
. For binary operators that accept two
Gregorian-type operands, both operands must have the same type (for
example, if one operand is of type xs:gDay
, the other
operand must be of type xs:gDay
.)
Operator | Type(A) | Type(B) | Function | Result type |
---|---|---|---|---|
A + B | numeric | numeric | op:numeric-add(A, B) | numeric |
A + B | xs:date | xs:yearMonthDuration | op:add-yearMonthDuration-to-date(A, B) | xs:date |
A + B | xs:yearMonthDuration | xs:date | op:add-yearMonthDuration-to-date(B, A) | xs:date |
A + B | xs:date | xs:dayTimeDuration | op:add-dayTimeDuration-to-date(A, B) | xs:date |
A + B | xs:dayTimeDuration | xs:date | op:add-dayTimeDuration-to-date(B, A) | xs:date |
A + B | xs:time | xs:dayTimeDuration | op:add-dayTimeDuration-to-time(A, B) | xs:time |
A + B | xs:dayTimeDuration | xs:time | op:add-dayTimeDuration-to-time(B, A) | xs:time |
A + B | xs:datetime | xs:yearMonthDuration | op:add-yearMonthDuration-to-dateTime(A, B) | xs:dateTime |
A + B | xs:yearMonthDuration | xs:datetime | op:add-yearMonthDuration-to-dateTime(B, A) | xs:dateTime |
A + B | xs:datetime | xs:dayTimeDuration | op:add-dayTimeDuration-to-dateTime(A, B) | xs:dateTime |
A + B | xs:dayTimeDuration | xs:datetime | op:add-dayTimeDuration-to-dateTime(B, A) | xs:dateTime |
A + B | xs:yearMonthDuration | xs:yearMonthDuration | op:add-yearMonthDurations(A, B) | xs:yearMonthDuration |
A + B | xs:dayTimeDuration | xs:dayTimeDuration | op:add-dayTimeDurations(A, B) | xs:dayTimeDuration |
A - B | numeric | numeric | op:numeric-subtract(A, B) | numeric |
A - B | xs:date | xs:date | (missing) | xs:dayTimeDuration |
A - B | xs:date | xs:yearMonthDuration | op:subtract-yearMonthDuration-from-date(A, B) | xs:date |
A - B | xs:date | xs:dayTimeDuration | op:subtract-dayTimeDuration-from-date(A, B) | xs:date |
A - B | xs:time | xs:time | (missing) | xs:dayTimeDuration |
A - B | xs:time | xs:dayTimeDuration | op:subtract-dayTimeDuration-from-time(A, B) | xs:time |
A - B | xs:datetime | xs:datetime | (missing) | xs:dayTimeDuration |
A - B | xs:datetime | xs:yearMonthDuration | op:subtract-yearMonthDuration-from-dateTime(A, B) | xs:dateTime |
A - B | xs:datetime | xs:dayTimeDuration | op:subtract-dayTimeDuration-from-dateTime(A, B) | xs:dateTime |
A - B | xs:yearMonthDuration | xs:yearMonthDuration | op:subtract-yearMonthDurations(A, B) | xs:yearMonthDuration |
A - B | xs:dayTimeDuration | xs:dayTimeDuration | op:subtract-dayTimeDurations(A, B) | xs:dayTimeDuration |
A * B | numeric | numeric | op:numeric-multiply(A, B) | numeric |
A * B | xs:yearMonthDuration | xs:decimal | op:multiply-yearMonthDurations(A, B) | xs:yearMonthDuration |
A * B | xs:decimal | xs:yearMonthDuration | op:multiply-yearMonthDurations(B, A) | xs:yearMonthDuration |
A * B | xs:dayTimeDuration | xs:decimal | op:multiply-dayTimeDurations(A, B) | xs:dayTimeDuration |
A * B | xs:decimal | xs:dayTimeDuration | op:multiply-dayTimeDurations(B, A) | xs:dayTimeDuration |
A div B | numeric | numeric | op:numeric-divide(A, B) | numeric |
A div B | xs:yearMonthDuration | xs:decimal | op:divide-yearMonthDurations(A, B) | xs:yearMonthDuration |
A div B | xs:dayTimeDuration | xs:decimal | op:divide-dayTimeDurations(A, B) | xs:dayTimeDuration |
A mod B | numeric | numeric | op:numeric-mod(A, B) | numeric |
A eq B | numeric | numeric | op:numeric-equal(A, B) | xs:boolean |
A eq B | xs:boolean | xs:boolean | op:boolean-equal(A, B) | xs:boolean |
A eq B | xs:string | xs:string | op:numeric-equal(xf:compare(A, B), 1) | xs:boolean |
A eq B | xs:date | xs:date | (missing) | xs:boolean? |
A eq B | xs:time | xs:time | (missing) | xs:boolean? |
A eq B | xs:dateTime | xs:dateTime | op:datetime-equal(A, B) | xs:boolean? |
A eq B | xs:yearMonthDuration | xs:yearMonthDuration | op:yearMonthDuration-equal(A, B) | xs:boolean |
A eq B | xs:dayTimeDuration | xs:dayTimeDuration | op:dayTimeDuration-equal(A, B) | xs:boolean |
A eq B | Gregorian | Gregorian | (missing) | xs:boolean |
A eq B | xs:hexBinary | xs:hexBinary | op:hex-binary-equal(A, B) | xs:boolean |
A eq B | xs:base64Binary | xs:base64Binary | op:base64-binary-equal(A, B) | xs:boolean |
A eq B | xs:anyURI | xs:anyURI | op:anyURI-equal(A, B) | xs:boolean |
A eq B | xs:QName | xs:QName | op:QName-equal(A, B) | xs:boolean |
A eq B | xs:NOTATION | xs:NOTATION | op:NOTATION-equal(A, B) | xs:boolean |
A ne B | numeric | numeric | xf:not(op:numeric-equal(A, B)) | xs:boolean |
A ne B | xs:boolean | xs:boolean | xf:not(op:boolean-equal(A, B)) | xs:boolean |
A ne B | xs:string | xs:string | xf:not(op:numeric-equal(xf:compare(A, B), 1)) | xs:boolean |
A ne B | xs:date | xs:date | (missing) | xs:boolean? |
A ne B | xs:time | xs:time | (missing) | xs:boolean? |
A ne B | xs:dateTime | xs:dateTime | xf:not3(op:datetime-equal(A, B)) | xs:boolean? |
A ne B | xs:yearMonthDuration | xs:yearMonthDuration | xf:not(op:yearMonthDuration-equal(A, B)) | xs:boolean |
A ne B | xs:dayTimeDuration | xs:dayTimeDuration | xf:not(op:dayTimeDuration-equal(A, B) | xs:boolean |
A ne B | Gregorian | Gregorian | (missing) | xs:boolean |
A ne B | xs:hexBinary | xs:hexBinary | xf:not(op:hex-binary-equal(A, B)) | xs:boolean |
A ne B | xs:base64Binary | xs:base64Binary | xf:not(op:base64-binary-equal(A, B)) | xs:boolean |
A ne B | xs:anyURI | xs:anyURI | xf:not(op:anyURI-equal(A, B)) | xs:boolean |
A ne B | xs:QName | xs:QName | xf:not(op:QName-equal(A, B)) | xs:boolean |
A ne B | xs:NOTATION | xs:NOTATION | xs:not(op:NOTATION-equal(A, B)) | xs:boolean |
A gt B | numeric | numeric | op:numeric-greater-than(A, B) | xs:boolean |
A gt B | xs:boolean | xs:boolean | op:boolean-greater-than(A, B) | xs:boolean |
A gt B | xs:string | xs:string | op:numeric-greater-than(xf:compare(A, B), 0) | xs:boolean |
A gt B | xs:date | xs:date | (missing) | xs:boolean? |
A gt B | xs:time | xs:time | (missing) | xs:boolean? |
A gt B | xs:dateTime | xs:dateTime | op:datetime-greater-than(A, B) | xs:boolean? |
A gt B | xs:yearMonthDuration | xs:yearMonthDuration | op:yearMonthDuration-greater-than(A, B) | xs:boolean |
A gt B | xs:dayTimeDuration | xs:dayTimeDuration | op:dayTimeDuration-greater-than(A, B) | xs:boolean |
A lt B | numeric | numeric | op:numeric-less-than(A, B) | xs:boolean |
A lt B | xs:boolean | xs:boolean | op:boolean-less-then(A, B) | xs:boolean |
A lt B | xs:string | xs:string | op:numeric-less-than(xf:compare(A, B), 0) | xs:boolean |
A lt B | xs:date | xs:date | (missing) | xs:boolean? |
A lt B | xs:time | xs:time | (missing) | xs:boolean? |
A lt B | xs:dateTime | xs:dateTime | op:datetime-less-than(A, B) | xs:boolean? |
A lt B | xs:yearMonthDuration | xs:yearMonthDuration | op:yearMonthDuration-less-than(A, B) | xs:boolean |
A lt B | xs:dayTimeDuration | xs:dayTimeDuration | op:dayTimeDuration-less-than(A, B) | xs:boolean |
A ge B | numeric | numeric | op:numeric-less-than(B, A) | xs:boolean |
A ge B | xs:string | xs:string | op:numeric-greater-than(xf:compare(A, B), -1) | xs:boolean |
A ge B | xs:date | xs:date | (missing) | xs:boolean? |
A ge B | xs:time | xs:time | (missing) | xs:boolean? |
A ge B | xs:dateTime | xs:dateTime | op:datetime-less-than(B, A) | xs:boolean? |
A ge B | xs:yearMonthDuration | xs:yearMonthDuration | op:yearMonthDuration-less-than(B, A) | xs:boolean |
A ge B | xs:dayTimeDuration | xs:dayTimeDuration | op:dayTimeDuration-less-than(B, A) | xs:boolean |
A le B | numeric | numeric | op:numeric-greater-than(B, A) | xs:boolean |
A le B | xs:string | xs:string | op:numeric-less-than(xf:compare(A, B), 1) | xs:boolean |
A le B | xs:date | xs:date | (missing) | xs:boolean? |
A le B | xs:time | xs:time | (missing) | xs:boolean? |
A le B | xs:dateTime | xs:dateTime | op:datetime-greater-than(B, A) | xs:boolean? |
A le B | xs:yearMonthDuration | xs:yearMonthDuration | op:yearMonthDuration-greater-than(B, A) | xs:boolean |
A le B | xs:dayTimeDuration | xs:dayTimeDuration | op:dayTimeDuration-greater-than(B, A) | xs:boolean |
A is B | node | node | op:node-equal(A, B) | xs:boolean |
A isnot B | node | node | xf:not(op:node-equal(A, B)) | xs:boolean |
A << B | node | node | op:node-before(A, B) | xs:boolean |
A >> B | node | node | op:node-after(A, B) | xs:boolean |
A precedes B | node | node | op:node-precedes(A, B) | xs:boolean |
A follows B | node | node | op:node-follows(A, B) | xs:boolean |
A union B | node* | node* | op:union(A, B) | node* |
A | B | node* | node* | op:union(A, B) | node* |
A intersect B | node* | node* | op:intersect(A, B) | node* |
A except B | node* | node* | op:except(A, B) | node* |
A to B | xs:decimal | xs:decimal | op:to(A, B) | xs:integer+ |
A , B | item* | item* | op:concatenate(A, B) | item* |
Operator | Operand type | Function | Result type |
---|---|---|---|
+ A | numeric | op:numeric-unary-plus(A) | numeric |
- A | numeric | op:numeric-unary-minus(A) | numeric |
XPath is intended primarily as a component that can be used by other specifications. Therefore, XPath relies on specifications that use it (such as [XPointer] and [XSLT 2.0]) to specify conformance criteria for XPath in their respective environments. Specifications that set conformance criteria for their use of XPath must not change the syntactic or semantic definitions of XPath as given in this specification, except by subsetting and/or compatible extensions.
This section provides a summary of the main areas of incompatibility between XPath 2.0 and [XPath 1.0]. Many of these are areas where the specification still has open issues outstanding, so this list should not be taken as final. It is the intention of the working group to review all known incompatibilities before final publication.
The list given here assumes (a) that the source document is processed
in the absence of a schema, and (b) that the policy for handling type exceptions
is flexible
: that is, that the software attempts wherever possible
to perform conversions from the supplied type of a value to the type required
by the operation or function where it is used.
In the description below, the terms node-set and number are used with their XPath 1.0 meanings, that is, to describe expressions which according to the rules of XPath 1.0 would have generated a node-set or a number respecively.
The rules for comparing a node-set to a boolean have changed. In XPath 1.0,
an expression such as $nodeset=true()
was evaluated by converting the
node-set to a boolean and comparing the result: so this expression would return true
if $nodeset
was non-empty. In XPath 2.0, this expression is handled in
the same way as other comparisons between a sequence and a singleton: it is true if
$nodeset
contains at least one node whose typed value is true
.
The rules for converting a string to a boolean have changed, so they are now aligned with XML Schema. In XPath 2.0, the rules depend on the context. In a function call, or as an operand of the and
and or
operators (assuming fallback conversions are used) the strings "0"
and "false"
are treated as false, while in XPath 1.0, they were treated as true. All other strings are converted in the same way as XPath 1.0. In a predicate, however, a string is not currently allowed, and will cause an error.
Additional numeric types have been introduced, with the effect that arithmetic
may now be done as an integer, decimal, or single-precision floating point calculation
where previously it was always performed as double-precision floating point. The result of the div
operator is now a decimal, so 10 div 4
returns 2.5
(this is a change from the December 2001 working draft). Operations that previously returned positive or negative infinity, such as 10 div 0
, will now return the error value. In XPath 1.0, such expressions were sometimes used as arguments to the substring() function.
The rules for converting numbers to strings have changed. These will affect the
way numbers are displayed in the output of a stylesheet. The output format depends on
the data type of the result: floating point values, for example, will be displayed using
scientific notation. The result of a decimal calculation such as 1.5 + 3.5
will be displayed as 5.0
, not 5
as previously. The general
rule is that the resulting string uses the canonical lexical representation for the
data type as defined in XML Schema.
The rules for converting strings to numbers have changed. A string that cannot
be interpreted as a number now (subject to resolution of an open issue) produces an
error, whereas in XPath 1.0 it produced the value NaN
(not a number).
The representation of special values such as Infinity has been aligned with XML Schema.
Strings containing a leading plus sign, or numbers in scientific notation, may now
be converted to ordinary numeric values, whereas in XPath 1.0 they were converted
to NaN
.
Many operations in XPath 2.0 produce an empty sequence as their result
when one of the arguments or operands is an empty sequence. With XPath 1.0, the result
of such an operation was typically an empty string or the numeric value NaN
.
Examples include the numeric operators and certain functions such as substring
. Functions also produce an empty sequence when applied to an argument
for which no other value is defined. However, for functions in the core such as name
, the XPath 1.0 behavior has been retained; for example, applying the name
function to a text node produces the empty string, as it did in XPath 1.0
In XPath 1.0, an equality comparison involving an element node was performed by
comparing its string value, that is, the string obtained by concatenating all its
text node descendants. In XPath 2.0, it is an error to use an element node in such
a comparison unless it has simple content. However, because the =
operator
tests whether any pair of items from the two operands are equal, this error will generally
be masked, so a comparison such as PERSON='abc'
, where PERSON
is
an element with one or more child elements, will now always return false.
In XPath 1.0, the <
and >
operators, when applied
to two strings, attempted to convert both the strings to numbers and then made a numeric
comparison between the results. In XPath 2.0, these operators perform a lexicographic comparison using the
default collating sequence.
In XPath 1.0, functions and operators that compared strings (for example, the
=
operator and the contains
function) worked on the basis of
character-by-character equality of Unicode codepoints, allowing Unicode normalization
at the discretion of the implementor. In XPath 2.0 (subject to resolution of open issues),
these comparisons are done using the default collating sequence. The working group may
define mechanisms allowing codepoint comparison to be selected as the default collating
sequence, but there is no such mechanism in the current draft.
In the XPath 1.0 data model, an element node had a namespace node for each in-scope
namespace. The parent of the namespace node was the element node, and the namespace nodes
for one element were distinct from those of any other element (as revealed, for example,
using the union operator |
). In XPath 2.0 (subject to resolution of open
issues) element nodes will still have namespace nodes for all the in-scope namespaces,
but these namespace nodes will be shared by different elements in the same document: that
is, there will be a many-to-many relationship between element nodes and namespace nodes.
This will affect any code that attempts to find the parent or ancestors of a namespace
node, or that tries to count namespace nodes or to form a union between two sets of namespace
nodes.
Values for Status has the following meaning:
resolved: a decision has been finalized and the document updated to reflect the decision.
decided: recommendations and decision(s) has been made by one or more of the following: a task-force, XPath WG, or XQuery WG.
draft: a proposal has been developed for possible future inclusion in a published document.
active: issue is actively being discussed.
unassigned: discussion of issue deferred.
subsumed: issue has been subsumed by another issue.
(parameters used: kwSort: cluster, kwFull: brief, kwDate: 00000000).
Num | Cl | Cluster | Status | Locus | Description | Originator |
---|---|---|---|---|---|---|
293 | active | xquery | Cdata and CharRef Semantics | Michael Rys | ||
294 | active | xquery | Should all elements and attributes have type annotations? | Philip Wadler | ||
134 | (de)reference-expr | decided | xquery | Dereference Operator and Links | Jonathan Robie | |
92 | (in)equality-operators | active | xpath | Deep equality | Jonathan | |
96 | (in)equality-operators | active | xpath | Normalized Equality | Mary Fernandez | |
91 | (in)equality-operators | decided | xpath | 9. String comparisons: | XQuery | |
28 | 3-value-logic | active | xpath | Do we need and3(), or3(), not3() built in? | XSL WG | |
215 | 3-value-logic | active | xpath | Should we have a 3-valued form of quantifiers? | Andrew Eisenberg | |
132 | attribute accessors | draft | xfo | Attribute Name, Attribute Content | Don Chamberlin | |
113 | axes | draft | xpath | What should the mechanism be for axis subsetting? | jmarsh@microsoft.com | |
177 | TF | choice-context | active | xpath | Consistency of functions that take boolean formal argument | XPath-TF |
256 | D | collections | active | xpath | What is return type of colections? | XPath TF |
257 | D | collections | active | xpath | Does collection() always return same result? | XPath TF |
169 | conformance | unassigned | xquery | Missing conformance section | Jonathan | |
238 | consistency | active | xpath | Consistency: tradeoff between interoperability and efficiency | Phil Wadler | |
239 | consistency | active | xpath | Consistency: bracketing of nested expressions | Phil Wadler | |
240 | consistency | active | xpath | Consistency: parenthesizing test expressions | Phil Wadler | |
241 | consistency | active | xpath | Consistency: keywords | Phil Wadler | |
252 | consistency | active | xquery | "sort by" rather than "sortby" for consistency? | Phil Wadler | |
286 | constructor-expr | active | xquery | Element Construction vs Streaming | Michael Rys | |
288 | constructor-expr | active | xquery | Element Constructor Attribute Order | Michael Rys | |
289 | constructor-expr | active | xquery | Attribute Value Construction from Elements | Michael Rys | |
290 | constructor-expr | active | xquery | Element Attribute Constructor Name Type | Michael Rys | |
291 | constructor-expr | active | xquery | Element Construction anySimpleType Sequence Content | Michael Rys | |
292 | constructor-expr | active | xquery | Element Construction Sequence vs Multi-expr | Michael Rys | |
147 | constructor-expr | decided | xquery | Empty Attributes | XQuery | |
145 | constructor-expr | unassigned | xquery | Copy and Reference Semantics | XQuery Editors | |
146 | constructor-expr | unassigned | xquery | Jonathan | ||
143 | constructor-syntax | unassigned | algebra | XML Constructor | Jonathan Robie | |
69 | context | active | xquery | Mapping Input Context | Jerome Simeon | |
230 | D | context | active | xpath | Context document adequate for multiple docuemnts? | Michael Rys |
258 | D | documents | active | xpath | Identity of Document Nodes | Jonathan Robie |
170 | D | documents | unassigned | xquery | Document collections | XQuery WG |
125 | editorial | decided | xpath | Should we say something about the abstractness of XPath? | Editor | |
126 | editorial | decided | xpath | Should we re-explain path expressions? | mhkay@iclway.co.uk | |
97 | error | active | xpath | How should the error object be supported? | Editor | |
98 | error | active | xpath | General discussion of errors | XML Query WG | |
99 | error | unassigned | xquery | TRY/CATCH and error() | XQuery Editors | |
160 | execution-model | active | xquery | Naive Implementation Strategy | Marton Nagy | |
226 | existential expressions | active | xpath | Existential Expressions | Mike Kay | |
272 | external-functions | active | xpath | External Functions | Michael Kay | |
273 | external-objects | active | xpath | External Objects | Michael Kay | |
231 | fallback | decided | xpath | data(SimpleValue) is error or no-op? | XSL WG | |
163 | filter | unassigned | algebra | Typing of Filter | Jerome Simeon | |
216 | focus | active | xpath | Description of focus is very procedural | Michael Rys | |
217 | focus | active | xpath | Context document in focus | Michael Rys | |
32 | for-expr | decided | xpath | Do we really require for at the XPath expression level? | K Karun | |
265 | FTTF-xml:lang | active | xpath-fulltext | How do we determine the xml:lang for a node if it inherits xml:lang from a higher-level node? | FTTF | |
266 | FTTF-xml:lang | active | xpath-fulltext | Do we support the sublanguage portion of xml:lang? | FTTF | |
105 | function-app | active | xpath | Implicit current node for functions? | XQuery Editors | |
102 | function-app | decided | xpath | Functions on Empty Sequences | XQuery | |
103 | function-app | decided | xpath | Functions on Sequences | XQuery | |
107 | function-app | decided | xpath | Path iteration | XQuery | |
108 | function-app | decided | xpath | Aggregate functions on empty sequences. | XQuery | |
180 | functions | active | xpath | Functions expecting complex-valued arguments | XPath-TF | |
124 | functions | unassigned | xquery | External Functions | XQuery Editors | |
157 | functions | unassigned | xquery | Function Libraries | XQuery Editors | |
223 | functions external | active | xquery | We need a way to declare external functions | Michael Rys | |
3 | grammar | active | xpath | What should be the precedence of a RangeExpr be? | Editor | |
254 | grammar | active | xpath | Should the lexical details be in document? | XPath TF | |
168 | groupby | unassigned | xquery | GROUPBY | XML Query | |
59 | T | INSTANCEOF-expr | active | xpath | We need precise semantics for instanceof. | mhkay@iclway.co.uk |
151 | literal-XML | unassigned | xquery | Cutting and pasting XML into XQuery | XQuery Editors | |
166 | miscellaneous | unassigned | xquery | Excluding Undesired Elements | Don Chamberlin | |
74 | module-semantics | active | xquery | Module syntax | XQuery Editors | |
75 | module-semantics | unassigned | xquery | Importing Modules | XQuery Editors | |
79 | module-syntax | unassigned | xquery | Encoding | Jonathan Robie | |
228 | namespace functions | active | xpath | Should we keep the default function namespace, and the xf: namespace? | Scott Boag | |
219 | namespaces | active | xquery | Context: namespaces | Michael Rys | |
222 | namespaces | active | xquery | Allow redefinition of namespace prefixes? | Michael Rys | |
247 | namespaces | active | xpath | What does default namespace(s) affect? | XPath TF | |
202 | namespaces | decided | xquery | In-scope namespaces and bindings | XPath Editors | |
86 | node-equality | decided | xpath | Set operations based on value | XQuery Editors | |
85 | node-equality | draft | xfo | Identity-based equality operator | Algebra Editors | |
186 | node order | active | xpath | Ordering of result of union, intersect, and except operators | XPath Editors | |
184 | T | node-types | active | xpath | Need ability to test for Comments, PIs | F&O TF |
19 | nulls-empty | decided | xpath | How should null be treated in the data model? | XSL WG | |
187 | operators | active | xfo | Operations supported on date/time types | XPath Editors | |
189 | operators | active | xpath | Supported combinations of types for comparison operators | XPath Editors | |
182 | operators | draft | xpath | Mapping XPath Operators to F&O Functions | XPath TF | |
210 | order sequences | active | xpath | Order of sequences | Phil Wadler | |
234 | order sequences | active | xpath | Who defines sorting order of ()? | Phil Wadler | |
5 | reserved-words | active | xpath | Reserved words | XQuery | |
8 | reserved-words | decided | xpath | Case-Sensitivity in Keywords | XML Query | |
123 | serialization | active | xquery | Linearization/Serialization | XQuery | |
244 | serialization | active | xquery | CDATA sections and serialization | Michael Rys | |
36 | SOME-expr | decided | xpath | Quantifiers with multiple bindings? | Don Chamberlin | |
194 | sort | active | xquery | Support for stable and unstable sort? | XPath Editors | |
195 | sort | active | xquery | Semantics of sorting heterogeneous sequences | XPath Editors | |
220 | sort | active | xpath | Should there be a way to explicitly sort in document order? | Michael Rys | |
242 | sort | active | xquery | Sortby on partially ordered values? | Michael Rys | |
243 | sort | active | xpath | Provide an example of sorting "disappearing" | Michael Rys | |
251 | sort | active | xquery | Sorting "input to loop", not the result | Phil Wadler | |
155 | sort | unassigned | xquery | Sorting by Non-exposed Data | Michael Rys | |
109 | syntax | active | xpath | Need text to disambiguate Lexical Structure? | mhkay@iclway.co.uk | |
212 | syntax | active | xpath | Is "datatype" a suitable production name? | Phil Wadler | |
229 | syntax | active | xpath | Do we need both << and precedes? | XQuery/XSL WGs | |
233 | syntax | active | xquery | Simpler FLWR syntax? | Phil Wadler | |
235 | syntax | active | xpath | Need parenthesis in conditional expression? | Phil Wadler | |
236 | syntax | active | xpath | SimpleType preceded by a keyword? | Phil Wadler | |
237 | syntax | active | xpath | Need parenthesis in type switch expression? | Phil Wadler | |
246 | syntax | active | xquery | Nested XQuery comments allowed? | Michael Rys | |
267 | syntax | active | xpath | Syntax problems with "validate" | XPath TF | |
287 | syntax | active | xpath | Functional Status of Comma | Michael Rys | |
110 | syntax | decided | xpath | Should we use is and isnot instead of == and !==. | mhkay@iclway.co.uk | |
144 | syntax | draft | xquery | Escaping Quotes and Apostrophes | XML Query | |
112 | syntax | unassigned | xquery | Leading Minus | XML Query | |
209 | syntax attribute values | decided | xquery | Syntax for attribute values - more than one? | Phil Wadler | |
208 | syntax curly brace | active | xquery | Multiple curly braces allowed? | Phil Wadler | |
245 | syntax curly brace | active | xquery | Are {} in text evaluated? | Michael Rys | |
227 | syntax dereference | active | xpath | Syntax for dereference? | Don Chambrelin | |
232 | syntax operators date | active | xpath | Use "+" and "-" on dates and durations? | Phil Wadler | |
283 | syntax-productions | active | xpath | Is the DocumentElement syntax production necessary? | Jonathan Robie | |
213 | syntax quotes | active | xpath | How to get quotes etc in string literals? | Andrew Eisenberg | |
261 | syntax quotes | active | xquery | Quoting rules in nested expressions in attribute value construction | Michael Rys | |
214 | syntax strings in attributes | active | xquery | Strings in attributes | Andrew Eisenberg | |
183 | T | text-nodes | active | xpath | Text nodes - lexical structure and typed form | XPath TF |
192 | T | type constructed element | decided | xquery | Type of a newly constructed element | XPath Editors |
172 | T | typed-value/data() | active | xpath | Some functions taking node sequences and implicitly map? | XPath TF |
80 | typed-value/data() | decided | xpath | Accessing Element Data | Mary Fernandez | |
81 | T | typed-value/data() | decided | datamodel | What should the typed value of a complex type be? | jmarsh@microsoft.com |
54 | type-errors | decided | xquery | Queries with Invalid Content | XQuery Editors | |
174 | T | type exception | decided | xpath | Support for UnknownSimpleType | XPath TF f2f |
185 | type exception | decided | xpath | Always explicit cast? | Phil Wadler | |
200 | T | types | active | xpath | Semantics of "only" | XPath Editors |
206 | T | types | active | xpath | Typing support in XPath | Mike Kay |
224 | T | types | active | xquery | Why do we want to allow optional returns and DataType? | Michael Rys |
196 | T | types | decided | xpath | Concrete syntax for datatype declarations | XPath Editors |
197 | T | types | decided | xpath | Need "attribute of type"? | XPath Editors |
198 | T | types | decided | xpath | Syntax for named typing | XPath Editors |
199 | T | types | decided | xpath | Support for locally declared types? | XPath Editors |
205 | TF | types | decided | xquery | Default function parameter type | XPath Editors |
211 | T | types | decided | xpath | Treat and structural vs named typing | Phil Wadler |
40 | T | type-semantics | active | xquery | Correspondence of Types | Jerome Simeon |
46 | T | type-semantics | active | xquery | typeof() function | Jonathan |
48 | T | type-semantics | active | algebra | CASE not a subtype | XML Query |
255 | T | type-semantics | active | xpath | What are the operators on a derived type? | Don Chamberlin |
260 | T | type-semantics | active | xpath | Implicit data() on instanceof? | Michael Rys |
262 | T | type-semantics | active | xpath | Definition of data() on elements with known complex type | XPath TF |
268 | T | type-semantics | active | xpath | xsd:string and anySimpleType'd data behave the same? | XQuery WG |
269 | T | type-semantics | active | xpath | Can we get rid of the unknown keyword | XQuery WG |
270 | T | type-semantics | active | xpath | Typing, coercions, and conformance | XQuery WG |
271 | T | type-semantics | active | xpath | Type compatibility of heterogeneous union types | XQuery WG |
274 | T | type-semantics | active | xpath | Text-node-only implementation possible? | XSL WG |
275 | T | type-semantics | active | xpath | Should validation also check identity constraints? | Jonathan Robie |
276 | T | type-semantics | active | xpath | Does validation introduce new xsi:type attributes? | Jonathan Robie |
277 | T | type-semantics | active | xpath | Should validate introduce xsi:type? | Jonathan Robie |
278 | T | type-semantics | active | xpath | Does //@xsi:type match an xsi:type attribute? | Jonathan Robie |
279 | T | type-semantics | active | xpath | Should there be a lightweight cast? | Jonathan Robie |
280 | T | type-semantics | active | xpath | Do we need to distinguish atomic simple types and list simple types? | Jonathan Robie |
281 | T | type-semantics | active | xpath | Representing the type name of untyped character data | Jonathan Robie |
282 | T | type-semantics | active | xpath | xs:numeric type | Jonathan Robie |
284 | T | type-semantics | active | xpath | Static Named Typing | Jonathan Robie |
285 | T | type-semantics | active | xpath | Is the QName denoting type information optional or required? | Phil Wadler |
41 | T | type-semantics | decided | xquery | Static type-checking vs. Schema validation | Mary Fernandez |
42 | T | type-semantics | decided | xquery | Implementation of and conformance levels for static type checking | Don |
43 | T | type-semantics | decided | xquery | Defining Behavior for Well Formed, DTD, and Schema Documents | Don Chamberlin |
44 | T | type-semantics | decided | xquery | Support for schema-less and incompletely validated documents | Don Chamberlin/Mary Fernandez |
45 | T | type-semantics | decided | xquery | Names in Type Definitions | Don |
47 | T | type-semantics | decided | xquery | Subtype Substitutability | XQuery Editors |
253 | TF | type-semantics | decided | xpath | CAST as simple type of a node type | Michael Rys |
259 | T | type-semantics | decided | xpath | Arithmetic operation rules for unknown simpletype | Michael Rys |
263 | T | type-semantics | decided | xpath | Definition of data() on elements with unknown type, whose content may be simple or complex | XPath TF |
51 | TF | type-semantics | draft | xquery | Function Resolution | XQuery Editors |
56 | T | type-syntax | active | xquery | Human-Readable Syntax for Types | Algebra Editors |
57 | T | type-syntax | active | xquery | Inline XML Schema Declarations | Don Chamberlin |
164 | updates | unassigned | xquery | Updates | XQuery Editors | |
207 | variables | active | xpath | Variable names: QNames or NCnames? | Ashok Malhotra | |
225 | variables | active | xpath | Variable redefinition allowed? | Mike Kay | |
250 | variables | active | xquery | Declaring Variables in Prolog | Jonathan Robie | |
264 | variables | active | xpath | Shadowing of Variables | Michael Kay | |
191 | whitespace | active | xquery | Whitespace handling in element constructors | XPath Editors | |
218 | wildcards | active | xpath | What wildcards; namespaceprefix? | Michael Rys | |
193 | T | xml non representable | active | xquery | Construction of non representable XML | XPath Editors |
130 | xquery-alignment | active | algebra | Algebra Mapping | XQuery Editors | |
152 | xqueryx | active | xqueryx | XML-based Syntax | XML Query WG | |
153 | xqueryx | active | xquery | Escape between syntaxes | Jerome Simeon |
XPath 1.0 has no reserved words. The current XQuery spec attempts to avoid reserved words but the result is that the XQuery grammar relies heavily on lexing tricks that make it difficult to document and difficult to extend. There is currently a substantial feeling in the XQuery group that the language should have some reserved words, which would be an incompatible change from XPath 1.0.
XSL WG Position: Exceptionally strong feeling that requiring element names that match a reserved word to be escaped is utterly unacceptable. If reserved words are required they must start with an escape character so they cannot conflict with element names. Attempt to maintain grammar and revisit this issue as necessary. We recognize that there is a problem but solutions are all distasteful.
Cf. 5. Reserved Words:
Subsumes: [link to subsumed issue: #xquery-xpath-issue-reserved-words] .
Cf. Keywords in XQuery
Subsumes: [link to subsumed issue: #xquery-reserved-keywords] .
Should keywords in XQuery be case-sensitive?
Decision by: xsl on 2001-12-07 ([link to member only information] )(joint meeting)
Decision by: xquery on 2001-12-07 ([link to member only information] )(joint meeting)
Keywords are case-sensitive and it was also decided to use only lower-case keywords in the current XQuery / XPath WD. Thtopchange the text, the grammar, and the examples.
Sequences are defined to not be able to contain sequences. Yet, it is probably that we need to be able to represent null in sequences in order to maintain cardinality for table processing and the like.
Proposal: Nulls are a special value or an empty sequence: It is a special value when it is a member of a sequence. It is an empty sequence for type checking and iteration. This may require tagging empty sequences that were returned as null with a flag. The XSL WG has not reached resolution on this proposal.
Conflicts with : [link to subsumed issue: null-missing-data] .
Decision by: xpath-tf on 2001-12-18 ([link to member only information] )
Decision by: xquery on 2001-12-19 ([link to member only information] ) confiriming that no action is required by the XQuery WG
XSLT WG agrees that empty sequence should be used to represent missing data (this is the status quo).
Should the 3-valued logic functions be part of the XPath function library? Note that they can be implemented as user functions (not as efficient as a "native" implementation). We may want to include the user definition as an example.
for
at the XPath
expression level?
Is for
really a proper construct for a simple
expression language? Will the definition of for
in
XPath cause problems for XQuery?
[link to member only information] Michael Kay:
Decision by: xpath-tf on 2001-11-27 ([link to member only information] )
Decision by: xsl on 2001-11-29 ([link to member only information] )
Adoption of FOR expression in XPath 2.0.
Scott Boag will provide 'tips & traps' text on potential semantic problems of mixing FOR, '/' and SORT.
Text is in Working Draft 2001-11-28 sec 2.9, paragraph 2.
We have considered forms of quantified expressions that bind several variables at once, as in SOME $x IN expr1, $y IN expr2. Are such quantifiers desireable? If so, what are their semantics, and what use cases support them? Note that there is no additional expressive power over the current single-variable syntax, this is purely a question of convenience.
Decision by: xpath-tf on 2001-12-18 ([link to member only information] )
Allow them; especially in view of consistency with eg "for" that already allows them. The semantics should be the same.
Section 2.9, on functions, portrays XQuery as a statically typed language, but the mechanisms by which static typing is established are still being developed by the XML Query Algebra editorial team. A complete accounting for type requires that the XML Query Algebra conform completely to the XML Schema type system, and that many open issues be resolved.
The semantics of XQuery are defined in terms of the operators of the XML Query Algebra. The mapping of XQuery operators into Algebra operators is still being designed, and may result in some changes to XQuery and/or the Algebra. The type system of XQuery is the type system of XML Schema. Work is in progress to ensure that the type systems of XQuery, the XML Query Algebra, and XML Schema are completely aligned. The details of the operators supported on simple XML Schema datatypes will be defined by a joint XSLT/Schema/Query task force.
Static type checking and schema validation are not equivalent, but we might want to do both in a query. For example, we might want to assert statically that an expression has a particular type and also validate dynamically the value of an expression w.r.t a particular schema.
The differences between static type checking and schema validation must be enumerated clearly (the XSFD people should help us with this).
This item is a duplicate of the Formal Semantics issue [link to member only information] .
Addressed by the "Named Typing" proposal.
Static type checking may be difficult and/or expensive to implement. Some discussion of algorithmic issues of type checking are needed. In addition, we may want to define "conformance levels" for XQuery, in which some processors (or some processing modes) are more permissive about types. This would allow XQuery implementations that do not understand all of Schema, and it would allow customers some control over the cost/benefit tradeoff of type checking.
This item is a duplicate of the Formal Semantics issue [link to member only information] .
Addressed by the "Named Typing" proposal.
This is related to [link to resolved issue: #xquery-schema-import] . We do not specify what is the effect of type checking a query that is applied to a document without a DTD or Schema. In general, a schema-less document has type xs:AnyType and type checking can proceed under that assumption. A related issue is what is the effect of type checking a query that is applied to an incompletely validated document. As above, we can make *no* assumptions about the static type of an incompletely validated document and must assume its static type is xs:AnyType.
This item is a duplicate of the Formal Semantics issue [link to member only information] .
Addressed by the "Named Typing" proposal.
Does the definition of a type include both element-names and element-contents (as in the Formal Semantics document), or only element-contents (as in XML Schema)?
Addressed by the "Named Typing" proposal.
Do we need a function that returns the type name of its operand? If so, what should it return if the operand is an element with a given xsi:type - the element name? the name of the type denoted by xsi:type? Specification of this function requires more work on types in XQuery.
Should XQuery 1.0 support subtype substitutability for function parameters?
If subtype substitutability is not supported in XQuery Version 1, the motivation for TYPESWITCH is weakened and the decision to support TYPESWITCH should be revisited.
Addressed by the "Named Typing" proposal.
More detailed rules need to be developed for function resolution. What kinds of function overloading are allowed? A promotion hierarchy of basic types needs to be specified. The issue of polymorphic functions with dynamic dispatch needs to be studied. Can overloaded functions be defined such that the parameter-type of one function is a subtype of the parameter-type of another function? If so, what are the constraints on the return-types of these functions? Is function selection based on the static type of the argument or on the dynamic type of the argument (dynamic dispatch, performed at execution time)? If XQuery supports dynamic dispatch, is it based on all the arguments of a function or on only one distinguished argument?
Observation: This is a very complex area of language design. If it proves too difficult to solve in the available time, it may be wise to take a simple approach such as avoiding dynamic dispatch in Version 1 of XML Query.
The XML Query Formal Semantics does not support overloading or dynamic dispatch. We will attempt to simplify XML Query Level 1 by omitting these, unless it becomes clear that they are needed. We realize that this might happen.
Is it an error for a query to specify content that may not appear, according to the schema definition? Consider the following query:
invoice//nose
If the schema does not allow a nose to appear on an invoice, is this query an error, or will it simply return an empty list?
Addressed by the "Named Typing" proposal.
The Algebra has a syntax for declaring types. Up to now, XQuery uses XML Schema for declaring types. Is this sufficient? Some important questions:
Do we need to allow inline XML schema declarations in the prolog of a query? The following example shows one potential syntax for this. It extends the namespace declaration to allow literal XML Schema text to occur instead of a URI in a namespace declaration. The implementation would then assign an internal URI to the namespace.
NAMESPACE fid = "http://www.example.com/fiddlefaddle.xsd" NAMESPACE loc = [[ <xsd:schema xmlns:xsd = "http://www.w3.org/2000/10/XMLSchema"> <xsd:simpleType name="myInteger"> <xsd:restriction base="xsd:integer"> <xsd:minInclusive value="10000"/> <xsd:maxInclusive value="99999"/> </xsd:restriction> </xsd:simpleType> </xsd:schema> ]] FUNCTION string-to-myInteger ($s STRING) RETURNS loc:myInteger { If the facets of loc:myInteger are not satisfied, this function raises an error. LET $t := round(number($s)) RETURN TREAT AS loc:myInteger($t) } string-to-myInteger("1023")
The semantics of the instanceof operator are not defined over all operands, e.g. sets of several nodes, sequences of several values, etc. What should the symantics be for these types? Should these semantics be defined in the F&O document?
Do we need a way to specify the nodes in the input context? Many queries do not specifically state the input to which they will be applied. This allows the same query, for instance, to be applied to a number of databases. It may be helpful for the mapping to introduce a global variable, eg $input, to represent the input nodes for a query. This variable might even be useful in the syntax of XQuery itself.
The definition and syntax of a query module are still under discussion in the working group. The specifications in this section are pending approval by the working group.
Future versions of the language may support other forms of query modules, such as update statements and view definitions.
The means by which a query module gains access to the functions defined an an external function library remains to be defined.
Should xmlns only be respected for construction, Xquery expressions but not functions, or also functions?
There is no operator to access the typed constant content of an element. In the Algebra, the data() operator does this. Should XQuery do the same?
Decision by: xpath-tf on 2001-10-23 ([link to member only information] )
Decision by: xquery on 2001-10-31 ([link to member only information] )
Decision by: xsl on 2001-12-13 ([link to member only information] ) It was noted that there are other issues on data() that may lead to further discussions.
Consensus is to define data() on only singleton node and empty sequence. This decision will be reflected in next WD.
Section 1 - 4th paragraph says the typed-value of an element with complex type is the same as its string-value. This is not currently consistent with the data model. The data model doc says, in section 4.2, "If the element has a complex type, the typed-value is the empty sequence. For an element in a well-formed document with no associated schema, the element's typed-value is the empty sequence."
Ed. Note: Question: I had a note from this, "insert from minutes", but I only see "Need to track "what does data()" return as an issue. Typed value? Something else?" as a response to this issue, and the formulation of issue text for the Data Model. Should this issue be removed from this document? -sb
Element & attribute nodes ~~~~~~~~~~~~~~~~~~~~~~~~~~ Given $e is a single element or attribute node: 1. If $e is of unknown type and has simple content (i.e., $e does not contain complex content and $e does not have a known type), then data($e) evaluates to the simple content of the node and has UnknownSimpleType. Example: let $e := <fact about="what i saw"> I saw 8 cats.</ fact> return data($e) ==> "I saw 8 cats" : UnknownSimpletype data($e/@about) ==> "what i saw" : UnknownSimpleType 2. Else if $e is of a known simple type or has a simple content type, then data($e) evalutes to the simple value of the node and has the node's known simple type. Example: let $e := <weight units="{ 'lbs.' }">{ 42 }</weight> return data($e) ==> 42 : xs:integer data($e/@units) ==> "lbs." : xs:string 3. Else if $e is of an unknown (complex) type, then data($e) evaluates to string($e) (text node aggregation) and has UnknownSimpleType. let $e := <fact>The cat weighs <weight>12</weight> pounds</fact> return data($e) ==> "The cat weighs 12 pounds" : UnknownSimpleType 4. Else if $e is of a known complex type with complex or mixed content, then there are two options: 4a. data($e) evaluates to an error 4b. data($e) is defined as in (3) above. Example: Assume we have schema type: <element name="fact" mixed="true"> <element name="weight" type="xs:integer"/> </element> and $e is validated w.r.t. the above type: let $e := validate as element fact (<fact>The cat weighs <weight>12</weight> pounds</fact>) return data($e) 4a. raises error 4b. "The cat weighs 12 pounds" : UnknownSimpleType Text nodes ~~~~~~~~~~~ 5. Given $t is a single text node, then data($t) evaluates to string($t) (content of text node) and has UnknownSimpleType. Example: let $e := <fact>The cat weighs 12 pounds</fact>, $t := $e/text() return data($t) ==> "The cat weighs 12 pounds" : UnknownSimpleType NB: Open issue as to whether data() should be defined on node sequences. NB: Current definition of data() applied to a text node is the empty sequence. Comment, PI, Namespace nodes ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 6. Given $c is a comment, processing instruction, or namespace node, then data($c) evaluates to the empty sequence. Example: let $c := <!-- a comment --> return data($c) ==> () : empty
Decision by: xpath-tf on 2002-03-19 ([link to member only information] )
Decision by: xquery on 2002-03-20 ([link to member only information] )
Decision by: xsl on 2002-03-28 ([link to member only information] )
Mary's proposal was adopted.
In particular, we chose option (4a) instead of (4b), because the current semantics applies data() implicitly in the basic conversion rules (e.g., when implementing equality and inequality operators), and therefore (4a) will raise an error if a user attempts to extract the atomic data from an element that has *known* complex type.
Do we need an identity-based equality operator? Please justify your answer with sample queries. Note that XPath gets along without it.
The '==' operator is already defined in the F&O document and used in XQuery use cases.
The definitions of UNION, INTERSECT, and EXCEPT for simple values are still under discussion. It is not clear that these operators should apply to simple values, because simple values do not have a concept of node identity. If these operators are defined for simple values, perhaps they should have a lower precedence than arithmetic operators.
Text is in Working Draft 2001-11-28 sec 2.4.
Decision by: xsl on 2002-01-22 ([link to member only information] )
The XSL WG felt that these operators should operate on nodes only and not be overloaded to work on "values" as well. Functions should be used for the "analogous" functionality on values. Action to Ashok to write a proposal. It was noted that one might well want to to a "value" union operating on nodes (where the typed value of each is extracted).
Decision by: xsl on 2002-01-22 ([link to member only information] )
Decision by: xquery on 2002-02-28 ([link to member only information] )Xquery acceptance of XSL proposal
These operators operate on nodes only and are not overloaded to work on "values" as well. Functions are to be used for the "analogous" functionality on values.
In XPath 1.0, string1 = string2 is evaluated by string comparison, but string1 > string2 is evaluated by attempting to convert both strings to floating-point numbers and comparing the numbers. This seems inconsistent. Both of these comparions should be carried out as string comparisons using the default collation.
In XPath 1.0, comparison of a string with a number is carried out by attempting to convert the string to a number. For example, 47 = "47" is True. This seems to conflict with strong typing. One might expect 47 = "47" to be a type error. Status: Open, pending discussion.
Addressed by XPath 2.0 basic and standard-fallback conversions.
Decision by: xquery on 2002-03-27 ([link to member only information] ) XML Query WG has adopted a solution to Issues 259 and 91 as per Proposal 1 in Michael Rys' proposal. See #unknown-simple-type-arithmetic
Decision by: xsl on 2002-03-28 ([link to member only information] )
In XPath, <book><title> Mark Twain </title></book> and <book><author> Mark Twain </author></book> are treated as equal in comparisons. Is this acceptable for us? Do we need another notion of deep equality? If so, what are the compatibility issues with XPath?
We believe the following approach to error handling would be very useful - (1) introduce TRY <expression> CATCH <expression>, similar to try/catch in OO languages. Instead of having "throw" to throw objects, use error(<expression>), bind the result of the expression to the variable $err, and allow $err to be used in the CATCH clause.
Dana Florescu has been assigned the task of writing a proposal for this.
XQuery-Null-Issue-7: Question: What should happen if a function expecting one element is invoked on an empty sequence?
It's an error.
Text is in Working Draft 2001-11-28 sec 2.1.2, paragraph 6, item 1.3.
What should the the result of various aggregate functions when applied to the empty sequence?
[link to member only information] :
null-aggregates-on-empty: Aggregate functions on empty sequences [link to member only information] Status: The XPath TF recommends that we reopen this issue. We will do a straw poll with the WG on this recommendation. The Chair views the public pushback we have received on this topic as sufficient reason for re-opening this issue: http://lists.w3.org/Archives/Public/www-xpath-comments/2002JanMar/0013.html http://lists.w3.org/Archives/Public/www-xpath-comments/2001OctDec/0010.html (point 8)
Paul Cotton - Do we re-open this issue? Straw poll taken - Yes: 10 No: 0 Abstain: 8
The XPath TF should take this matter back under review.
Action A-87-06 - Paul Cotton to convey to XPath TF that issue is re-opened and the WG would like to receive some proposed changes.
As in SQL, count(()) returns 0, and all other aggregate functions return the empty sequence. This rule is familiar to SQL users and minimizes the complexity of SQL-based XQuery implementations.
Decision by: xpath-tf on 2002-01-29 ([link to member only information] )
Decision by: xquery on 2002-03-06 ([link to member only information] )
Decision by: xsl on 2002-04-04 ([link to member only information] )
Change semantics of sum() on () to 0.
There seems to be a lot of material missing here, for example the rules for disambiguating operator names from NCNames, the two uses of "*", etc. The statement "the longest possible token" means the longest sequence that would form a token in the token-space of the grammar, not the longest that would be valid in the current syntactic context.
is
and isnot
instead of ==
and !==
.
Should we use is
and isnot
instead
of ==
and !==
. Using keywords would
be clearer, and less prone to error. On the other hand,
introduction of more keywords could cause more controversy.
At Reston F2F, we agreed to infix operators 'value=', 'value<', 'node=', 'node<'. Next WD should reflect this decision.
Text is in Working Draft 2001-11-28 sec 2.6.2.
Decision by: xsl on 2002-02-28 ([link to member only information] )(joint meeting)
Decision by: xquery on 2002-02-28 ([link to member only information] )(joint meeting)
Decided to change to "is" and "isnot"
Why is axis availability part of the run-time context? Myaxis::foo should be a syntax error. This seems like a really clunky mechanism for subsetting. The alternative, as Mike Kay presented, is to provide a set of booleans telling if the given axis is available.
Proposed resolution: Axis subsetting should be done at the grammar level, similar to how XSLT pattern matching is specified.
An extensibility mechanism needs to be defined that permits XQuery to access a library of functions written in some other programming language such as Java.
Some sources of information: the definition of external functions in SQL, the implementation of external functions in Kweelt.
Should we say something about the fact that XPath is meant to be a abstract specification? I am concerned about people getting the impression that XPath can be used by itself. Maybe it can be, and maybe this is OK.
[link to member only information] Paul Cotton:
[link to member only information] Michael Rys:
Decision by: xquery on 2002-01-16 ([link to member only information] )
Action to Michael Rys to propose alternative text to resolve issue.
Decision by: xquery on 2002-01-23 ([link to member only information] )
XQuery WG approves wording in: [link to member only information] with a change so that "cannot" is changed to "should not" and Paul Cotton to convey changes to the XPath TF and XSL WG. Note: This text should be added to a new Conformance section in the XPath 2.0 specification.
Thus the proposed text is:
XPath is intended primarily as a component that can be used by other specifications. Therefore, XPath relies on specifications that use XPath (such as [XPointer] and [XSLT]) to specify criteria for conformance of implementations of XPath and does not define any conformance criteria for independent implementations of XPath. Specifications that set conformance criteria for their use of XPath should not change the syntactic or semantic definitions of XPath as given in this specification.
Decision by: xpath-tf on 2002-03-05 ([link to member only information] )
There is great concern in the XSL WG about the proposed last sentence. An alternative one was accepted by the XPath TF for approval by the WGs:
Specifications that set conformance criteria for their use of XPath must not change the syntactic or semantic definitions of XPath as given in this specification; except by subsetting and/or extensions in compatible ways.
Decision by: xquery on 2002-03-13 ([link to member only information] )Accepting the XPath TF proposal
Decision by: xsl on 2002-04-04 ([link to member only information] )
The division of path expressions into relative and absolute isn't reflected in the syntax. I think it's best to define the semantics as follows: / is an abbreviation for root(), /expr is an abbreviation for root()/expr, and // is an abbreviation for "/descendant-or-self::node()/". If the first step is an AxisStepExpr, add "./" in front of the expression. All unabbreviated paths now take the form OtherStepExpr ( '/' StepExpr )* and we only need to define the semantics of this kind of path expression.
Decision by: xquery on 2002-02-06 ([link to member only information] )
The current WD text reflects suggestions.
We need functions to return the name of an attribute and the content of an attribute.
My proposal is to create a separate section in the F&O document listing the accessors in the data model that are supported. The semantics would still be specified in the data model document. Similarly, we would add a section that listed the functions in the evaluation context that are supported. The semantics for these functions would be in the XPath document as decided this morning.
Does the dereference operator work on links, such as XLink or HTML href? Should we also support KEY/KEYREF? In general, our handling of references needs a lot of work.
In general, how are the semantics of the dereference operator defined?
Text is in Working Draft 2001-11-28 sec 2.3.
Decision by: xsl on 2002-01-22 ([link to member only information] )
Decision by: xquery on 2002-02-28 ([link to member only information] )
Acceptance of text in December 2001 published Working Draft.
Is there a need for a constructor that creates an instance of the XML Query Data Model from a string that contains XML text?
Close the issue, pending convincing use cases. When do we need to be able to create a string of XML text, then convert it into an instance of the XML data model? Can't there always be an intervening parser or other tool to create the XML data model instance?
In attribute constructors and string constructors, XQuery uses quotes or apostrophes as delimiters. How are these characters escaped when they occur within strings that are created by one of these constructors?
I propose that we use double-delimiters within a string literal, e.g. 'I don''t', and unlike most of my syntactic ideas, this proposal seemed to recieve general support.
What does <a b={expr}> mean if expr returns an empty sequence? Option 10A: Attribute is not created. Option 10B: Run-time error. Option 10C: The attribute is created, and its value is the empty sequence. Option 10D: The attribute is created and its value is the empty sequence if this is allowed by the attribute type; otherwise it's a run-time error. Option 10E: The attribute is created and its value is the empty sequence. However, an error may occur when the attribute is serialized. Option 10F: If the attribute-type is a list of scalar types that allows the empty list, an attribute is created with an empty sequence as its value; if the attribute is optional and scalar, then the attribute is not created. If the type system does not allow the attribute to be an empty list or absent, a type error is raised.
Decision by: xquery on 2001-12-07 ([link to member only information] )
Adopt 10C.
Should we make it easier to sort by data that is not exposed in the result? Although the current language allows this, it is difficult to define complex sort orders in which some items are not exposed in the result and others are computed in the expression that is sorted. Is there a more convenient syntax for this that would be useful in XQuery?
Here is an example: FOR $e IN //employee WHERE ... RETURN <newe>$e/name</newe> SORTBY -- Now I would like to sort by salary but cannot. Instead, the query would have to be written as FOR $e IN (FOR $x IN //employee RETURN $x SORTBY employee/salary/data()) WHERE ... RETURN <newe>$e/name</newe> Which seems awkward. The question is of course how we can integrate the SORTBY in an other way. For example, could we say FOR $e IN //employee WHERE ... SORTBY $e/salary/data() RETURN <newe>$e/name</newe> ? Best regards Michael
XQuery needs a mechanism to allow function definitions to be shared by multiple queries. The XQuery grammar allows function definitions to occur without a query expression.
We must provide a way for queries to access functions in libraries. For instance, we might add an IMPORT statement to XQuery, with the URI of the functions to be imported. It must be possible to specify either that (1) local definitions replace the imported definitions, or (2) imported definitions replace the local ones.
Marton Nagy has suggested that it would be helpful to describe a naive implementation strategy for XQuery.
A naive XQuery implementation might parse the query, map it to Algebra syntax, and pass it to an Algebra implementation to request type checking from the algebra, returning an error if there were static type errors. A naive implementation might then request query execution from the algebra, get the results from the algebra and return it to the user.
Alternatively, the implementation might have its own algebra for execution, or it might generate statements in a specific implementation language such as XPath or SQL.We expect a wide variety of implementation approaches to be used in practice.
The current mapping of filter to the algebra does not preserve much useful type information. Can the mapping be improved? Is there another approach to filter that would yield better type information?
We believe that a syntax for update would be extremely useful, allowing inserts, updates, and deletion. This might best be added as a non-normative appendix to the syntax proposal, since the algebra is not designed for defining this portion of the language.
How do we exclude undesired elements from the results of joins?
[link to member only information] :
This need came out of a thread exploring data integration scenarios, starting with http://lists.w3.org/Archives/Member/w3c-archive/2000Dec/0132.html.
How are collections of documents named and addressed in queries? How are they associated with files in directory structures, or resources in various systems? How does one address documents within collections?
Do we still need fallbacks if we have a marker for untyped data (="PCDATA")?
[link to member only information] Mary F. Fernandez:
Decision by: xsl on 2002-01-22 ([link to member only information] ) Acceptance of text in December 2001 published Working Draft.
Text is in Working Draft 2001-11-28 sec 2.5.
I discussed this issue with Mary on the phone today, and we have developed the following modified version of her original proposal. The key difference is this: 1. In the data model, the type name 'anySimpleType' is used everywhere that 'unknownSimpleType' was used in her original proposal. This avoids the problems discussed in: http://lists.w3.org/Archives/Member/w3c-xml-query-wg/2002Mar/0173.html 2. In the SequenceType production, the keyword 'unknown' matches values whose most specific type is 'anySimpleType'. Jonathan and Mary ================= This message proposes, in summary, that XQuery/XPath must have a type for Text Nodes, denoted by the reserved word 'text', and a type for Atomic Values with unknown simple type, denoted by the type name 'anySimpleType' in the Data Model. In the SequenceType production, the keyword 'unknown' matches values whose most specific type is 'anySimpleType'. Rationale: XQuery/XPath supports expressions that yield two *distinct* types of values: 1. Text nodes, which have identity and contain character data Example: let $e := <fact>I saw 8 cats</fact> return $e/text() This expression yields a Text Node (that has identity!) with type 'text'. 2. Atomic values with unknown simple type, which no not have identity and contain character data Example 1: let $e := <fact about="what I saw">I saw 8 cats</fact> return data($e) This expression yields an Atomic Value (that does not have identity!) with type 'anySimpleType' Example 2: data($e/@about) This expression also yields an Atomic Value with anySimpleType. In a typed language, every value must have an associated type. Neither value above currently has a type in XQuery/XPath. In addition, Text Nodes and Atomic Values with unknown simple type do not denote the same set of values, therefore, they must have distinct types. Both these types may occur wherever a type expression is permitted, e.g., in the SequenceType production. However, note that the type name 'anySimpleType' matches all simple types, since they are all derived from 'anySimpleType', whereas the keyword 'unknown' matches only values whose most specific type is 'anySimpleType'. The formal semantics already constructs core expressions that require both 'text' and 'unknown'. for example, here's the rule that converts a node to an optional atomic value of type xsd:integer: typeswitch (Expr) as $v case xs:integer? return $v case unknown return cast as xs:integer ($v) case node return typeswitch (data($v)) as $w ... We use the type 'anySimpleType' for simple types because this type explicity captures the notion that it is a simple type for which there is no more specific known type. To simplify processing, we map all PSVI representations of character data with unknown type onto this one type. Since our language needs a way to match only values whose most specific type is 'anySimpleType', we add a keyword to the language, rather than invent a new type for XML Schema. The functionality we need is part of our language, not part of the XML Schema type system that underlies our type system. The necessity of associating a type to text nodes was first discussed in Aug 2001: http://lists.w3.org/Archives/Member/w3c-xml-query-wg/2001Aug/0209.html
Decision by: xquery on 2002-03-27 ([link to member only information] ) XML Query WG has resolved issue 174 and Strawman Issue 17 by adopting Proposal #1 Jonathan Robie's proposal above.
Decision by: xsl on 2002-03-28 ([link to member only information] )
The proposal by Michael Rys in [link to member only information: Proposal to close issue expr[nodes]] treats not()/not3() differently from all other functions that take a boolean formal argument.
Cf. Implicit conversion of node-sets to boolean for comparisons.
The mapping from operators (such as "+", "*") to the operator functions needs to be defined. A second question is if the text should be in the F&O or XPath/XQuery document.
This belongs in the XPath document. Ashok will send a draft to Don, who will incorporate this in XPath post December 2001 publication.
See [link to member only information] .
Decision by: xpath-tf on 2002-01-22 ([link to member only information] )Accepting Don's Proposal
Decision by: xsl on 2002-01-22 ([link to member only information] )(whole group at XPath TF telcon)
Decision by: xquery on 2002-01-23 ([link to member only information] )Accepting Don's Proposal
Decision by: xquery on 2002-02-06 ([link to member only information] )
Lexical structure and typed form of text nodes discussed in datamodel. No analogous discussion in the XPath document on that there are two ways to access information, as typed content or as nodes. This also needs to be discussed in conjunction with construction.
Should we do explicit casts rather than type conversion, like for example Python? This would result in e.g. forceing the user to tag a string everytime...
Addressed by the "Named Typing" proposal.
What should be the ordering of the results of the union, intersect, and except operators?
Issue is for material in sec 2.4. in Working Draft 2001-11-28.
Union, intersect, and except on node sequences are defined to return their results in document order.
What arithmetic operations should be supported on date/time types?
Issue is for material in sec 2.5. in Working Draft 2001-11-28.
Decision by: xquery on 2002-02-06 ([link to member only information] )
Locus should be Functiond and Operators
Make sure that the XPath/XQuery document is consistent with the F&O document with respect to the supported combinations of types for comparison operators.
Issue is for material in sec 2.6. in Working Draft 2001-11-28.
How is whitespace handled in element constructors?
Issue is for material in sec 2.8. in Working Draft 2001-11-28.
[link to member only information] Michael Kay:
The XQuery WG requested information from XSL WG as to how we currently deal with whitespace, in the hope that we can provide an off-the-shelf solution to the problem. In response to the action, here's a description of what XSLT does. The stylesheet is an XML document. In constructing its infoset, all processing instructions, comments, and whitespace-only text nodes are discarded. (To be absolutely precise, PIs and comments are discarded; then adjacent text nodes are merged; then whitespace-only text nodes are removed from the tree). Whitespace text nodes are retained however, in two circumstances: (a) if the whitespace text node is a child of an <xsl:text> element, and (b) if an ancestor element specifies xml:space="preserve". Certain elements in the stylesheet (for example, xsl:element) contain a "content constructor". A content constructor is a sequence of XSLT instructions, literal result elements, and literal text nodes. In evaluating a content constructor, XSLT instructions do whatever the semantics of the particular instruction say, while literal result elements and literal text nodes are copied to the result tree. The effect of this is that a whitespace-only text node in the stylesheet is copied to the result tree only if either (a) it appears immediately inside <xsl:text>, or (b) it is within the scope of an xml:space="preserve" attribute. Whitespace that is adjacent to non-white text in a literal text node is copied to the result tree. The effect of these rules is as follows: ======================================= <a> </a> generates an empty element: <a/> ======================================= <a xml-space="preserve"> </a> generates: <a xml-space="preserve"> </a> ======================================= <a><xsl:text> </xsl:text></a> generates: <a> </a> ======================================= <a> <b/> <a> generates: <a><b/></a> ======================================= <a>Some text <b/> </a> generates: <a>Some text <b/></a> ======================================= There are other complications with whitespace. Whitespace in the result tree can come from the source document as well as from the stylesheet; XSLT provides control over whether whitespace-only text nodes in the source document are significant or not. Whitespace can also be generated in the output during serialization, if the xsl:output option indent="yes" is specified. Also of course the XSLT rules apply in addition to the XML rules. XML for example normalizes line endings and normalizes whitespace (but not character references) in attribute values. This happens outside XSLT's control. Whitespace character references such as are treated differently from literal whitespace by the XML processor, but are treated identically to literal whitespace by the XSLT processor. It's fair to say that these rules create a fair bit of confusion. It usually doesn't matter for generating HTML, because whitespace in HTML is rarely significant. For generating text files, it can be quite tricky. However, the rules are well-defined and a user who understands the rules can always get the required output. What should XQuery do? I'd suggest mimicking these rules as closely as possible, if only because users then only have to learn one set of confusing rules rather than two. I can't think of any obvious improvements that would make the system less confusing. Where the user wants to explicitly output whitespace, of course, <a>{' '}</a> provides a suitable alternative to XSLT's <xsl:text> instruction. This analogy would suggest that <a> {'x'} </a> should output <a>x</a>, while <a>z {'x'} y</a> should output <a>z x y</a>: that is, the characters between <a> and "{" are ignored if they consist entirely of whitespace, but are all significant if any of them is non-whitespace. <a> </a> should output <a/>, as should <a> </a>. This is only a suggestion, of course, the decision is entirely for XQuery to make. Mike Kay
An element constructor may contain adjacent simple values as the content of the element. This cannot be represented in XML. What should we do about this?
Issue is for material in sec 2.8. in Working Draft 2001-11-28.
What should be the concrete syntax for datatypes in function signatures and expressions? Should this syntax support node-or-value? Processing-instructions? Comments? Note that some functions in the F&O document (such as "exists") require "node-or-value" parameters.
Issue is for material in sec 2.13. in Working Draft 2001-11-28.
Addressed by the "Named Typing" proposal.
The current Datatype production supports declarations of the form "element of type <var>". Do we also need declarations of the form "attribute of type <var>" or "node of type <var>"?
Issue is for material in sec 2.13. in Working Draft 2001-11-28.
Addressed by the "Named Typing" proposal.
Does the Datatype declaration need a way to specify both the QName of an element or attribute and its type, eg element person of type plumber?
Issue is for material in sec 2.13. in Working Draft 2001-11-28.
Addressed by the "Named Typing" proposal.
Should XQuery support the import of locally declared types from schemas?
Issue is for material in sec 2.13. in Working Draft 2001-11-28.
Addressed by the "Named Typing" proposal.
The keyword "only" remains in the syntax of "instance of", but the meaning of this keyword is not clear. Do we need this? If so, what are its semantics?
Issue is for material in sec 2.13. in Working Draft 2001-11-28.
Further input from Phil Wadler: Suggest we remove "only" from the text, and turn it into an issue. (As noted in the text, "only" makes sense only if we have named types, which is another issue.) If we do have "only", it should be used consistently in both "instance of" and in the "case" of a type switch. [!]
How do namespace declarations in the prolog and in namespace declaration attributes affect the in-scope namespaces of the context?
Issue is for material in sec 3. in Working Draft 2001-11-28.
Decision by: xpath-tf on 2002-01-15 ([link to member only information] )
Decision by: xquery on 2002-01-16 ([link to member only information] )
Decision by: xsl on 2002-01-22 ([link to member only information] )
[Decided modulo suggested changes to text by Mike K] Action Item on Jonathan to incorporate these changes.
If a function parameter does not specify a type, can both nodes and values be passed as arguments? If a function return does not specify a type, can both nodes and values be returned?
Issue is for material in sec 3. in Working Draft 2001-11-28.
The default type of a function parameter when no type is specified in the function signature is changed from "any node" to "any type". The default return type of a function when no return type is specified is changed from "any sequence of nodes" to "any type".
Decision by: xpath-tf on 2002-01-15 ([link to member only information] )
Decision by: xquery on 2002-01-16 ([link to member only information] )
Decision by: xsl on 2002-01-22 ([link to member only information] )
[Decided modulo suggested changes to text ] Action Item on Jonathan to incorporate these changes. "any sequence" or "any type"
Do we want to continue to support both of the following forms for computed attribute values? If not, is it possible to decide which to remove?
<pic size={}> { } </pic>
<pic size="{}"> { } </pic>
Decision by: xquery on 2002-01-16 ([link to member only information] )
Jonathan: Computed attribute values - two ways to do this. Propose to elimiate no quoted representation. Michael: a = {3} - it is clear that the type is integer... PaulC: Is there anyone who thinks the semantics are different. Michael is not sure. PaulC: Anyone think we should retain non quoted syntax: no objections, resolved.
2.10, * Points 1 and 2 (Draft 2001-11-28). We could specify that lexical order is used when the ordering expression yields a sequence of values. This could be quite useful, e.g., if we represent Section 1.2.3 by (1,2,3) and Section 1.4 by (1,4), then lexical ordering does the right thing. This also implies that () should sort before everything else, as that is what happens with lexical order.
2.13.2 (Draft 2001-11-28) The behaviour of treat is profoundly affected by the choice between structural and named typing. If we use structural typing, then treat changes the type but not the value; if we use named typing, then treat must return a new value containing the appropriate type names. (Similarly for type switch.) The current wording is vague on this point. Should we be less vague and more clear about what the two different choices involve?
Addressed by the "Named Typing" proposal.
How do you get strings such as single and double quote to be allowed in character strings?
<name>Ben & Jerry's</name>
eg should doubling a quote escape it?
It would seem that we need to allow these CharRef's in string literals as well.
Should we have a 3-valued form of quantifiers?
QuantifiedExpr is defined as being two-valued, while SQL's is 3-valued. SQL would evaluate 5 >ALL (6, null, 7) as UNKNOWN. XQuery would return FALSE where SQL returns UNKNOWN.
XQuery must specify how namespaces are handled in the context.
Note that:
1. An unprefixed element name used as a nametest in a query has the namespaceURI associated with the default element namespace from the context.
Note: we may decide that this is the same as the default namespace of the in-scope namespaces, but this is not certain.
2. An unprefixed attribute has a null namespaceURI
Would we prefer a syntax that requires explicit declaration of a general type when a function is to be loosely typed, rather than use the current syntax in which the type is omitted when the function is untyped.
The binding of a variable in an expression always overrides any in-scope binding of a variable with the same name". In XSLT, it is an error to declare a (local) variable if another local variable with the same name is already in scope. This rule has proved useful in catching many user errors, particularly where users misunderstand the nature of XPath variables and think that a second declaration behaves like an assignment statement. I would prefer it to be an error to declare a variable if a variable of that name is already in scope. Also, the scope of variables has not been defined with very great precision, it's not explicitly clear what
for $i ........return for $i in // X, $j in $i/z return ....
means: which $i does this refer to?
Do we want to require implementations to test all pairs in order to determine if there is an incomparable value? Note that there are three choices: return true if any pair that satisfies the condition is encountered, return error on incomparable, or permit implementations to define what to do if both a true comparison and an incomparable pair are encountered. Should static and dynamic semantics handle this differently?
What syntax should be used for dereference? In addition to the => syntax described in the document, here are two alternative approaches: (a) Treat dereferencing as an axis; (b) Simply use id(.) in a general step, with no special syntax.
The question was raised of whether the Query WG and F&O TF have 1) a good rationale for putting built-in functions in a namespace, and 2) a consistent story about how this will relate to default namespace declarations and user-defined functions.
It would seem odd to have to have all user defined functions put in the FandO namespace if a namespace is not declared for it. If you do not do that, then user defined functions that don't require a prefix will not match the QName.
And, if there is not a good rational that provides user benifits, then it seems like we are going through a lot of additional complexity for little or no benefit.
What is the result of applying the data() function on a SimpleValue? Is it an error, is it a no-op, or is it a type exception with a fallback?
Decision by: xpath-tf on 2001-12-18 ([link to member only information] )
Decision by: xquery on 2001-12-19 ([link to member only information] )
data() applied to simple value is identity function (no-op). Rationale: does not require special 'fallback' behavior and if we resolve Issue 0172 so that data is defined on node sequences, then for consistency, it should be defined on heterogeneous sequences. Still waiting on general proposal for Issue 172.
2.10, + Point 5 (Draft 2001-11-28). If we don't adopt Plil W's proposal in Point 1, then there should be an Issue as to whether the behaviour should be specified by the user, or the vendor. One option is to let the user specify that () sorts high, low, or either, in the latter case the vendor decides.
Issue as to whether SimpleType (was BuiltInType) might be preceded by a keyword. Now that we have "element of type" it seems natural to use "type" to preced SimpleType, possible generalizing to also allow a complex type.
Consistent tradeoff between interoperability and efficiency. There are a number of places where XQuery must choose between pinning down precise behaviour or offering flexibility to the implementor. These include whether order in "for" expressions is significant, whether sorting is stable, whether order is significant for duplicate elimination, whether order is significant when finding the union, merge, except of sequences of values, and the like. We should have a consistent policy for making these choices.
Consistent bracketing of nested expressions. Some nested expressions are surrounded by parentheses (treat, cast, assert), some nested expressions are surrounded by braces (element construction, function body), and some nested expressions are not bracketed (for expression, conditional expression). We should have a consistent policy for bracketing of nested expressions.
Consistent parenthesizing of test expressions. Some test expressions are surrounded by parentheses (conditional, type switch) and some are not (where). We should have a consistent policy for parenthesizing of test expressions.
What is effect of default namespace declarations on unprefixed QNames that may occur in element constructors, attribute constructors, and name tests (or anywhere else).
In XPath 1.0, in-scope namespace decls effect prefixed QNames, but default namespace decl does not effect unprefixed names in a name test. In XSLT 2.0, we introduced multiple default namespace decls :one for constructed elements, one for names in xpath expressions.
Functions in a function library often need to access the same variables. For instance, a function library that manipulates a grammar may need to use the following variables in many functions:
$grammar := document("xpath-grammar.xml")/g:grammar $target := "xquery"
One possible syntax for this is:
'define' ''variable' varname ':=' expr
The above production would occur only in the prolog.
Consider this query:
for $x in /books/book, $y in /reviews/review where $x/isbn = $y/isbn return <newbook>{ $x/title, $x/author, $y/reviewer }</newbook> sortby isbn
This is an error, since isbn doesn't appear in newbook. (The static type system would catch this error.) What you have to write is
for $z in for $x in book, $y in review where $x/isbn = $y/isbn return <dummy>{ $x/title, $x/author, $y/reviewer, $x/isbn }</dummy> sortby isbn return <newbook>{ $z/title, $z/author, $z/reviewer }</newbook>
This is painful.
I think that XQuery should support this syntax, or something similar:
for $x in book, $y in review where $x/isbn = $y/isbn sortby $x/isbn return <newbook>{ $x/title, $x/author, $y/reviewer }</newbook>
Our plate is full with more important matters just now, but I hope we could fix this before we finalize XQuery.
Given the expression:
cast as xsd:decimal(//element_string [3]) div cast as xsd:decimal("+1.25000000")
and a type of ELEMENT element_decimal [xsd:string] for the element_string nodes, our current cast rules disallow the cast of the element node to a value, since the above expression would be translated into:
data(cast as xsd:decimal(//element_string [3])) div cast as xsd:decimal("+1.25000000")
instead of (the user expected):
cast as xsd:decimal(data(//element_string [3])) div cast as xsd:decimal("+1.25000000")
Could we change the casting rules to allow the above?
We could either add a rule that pushes data() into cast expressions or have a special rule for casting to simple value types that implies applying data() in the casted expression (similar to arithmetic expressions).
Addressed by the "Named Typing" proposal.
User defines a derived type, what operators are inherited by that type. SQL has a concept of distinct type. A distinct type does not inherit the operastors on the base type. XQuery in F&O does the opposite. All operations on the base type are inherited.
[link to member only information] Don Chamberlin:
[link to member only information] Don Chamberlin:
MR: Why does collection() return item*. I want document*.
JR: You can specify what you want. You have to accept a URI and what you return is implementation dependent.
SCA: Strawpoll. 5 item*, 3 document*. No one cannot live with item*
Can an implementation provide a more specific return type than item* and still be a conforming implementation?
Some discussion. No consensus.
Consider the following query:
if (document("foo.com") == document("foo.com")) then <yep/> else <nope/>
I would like the following output:
<yep/>
I think we can achieve this if we say that the URI of a resource is used as its identity. However, one resource can be identified by more than one URI. Suppose that "foo.com/here/there/hi.xml" and "file://c:/temp/limerick-tei.xml" refer to the same resource. What does the following return?
if (document("foo.com/here/there/hi.xml") == document("file://c:/temp/limerick-tei.xml")) then <yep/> else <nope/>
Should we simply use the URI of the parameter to establish identity and say that the two do not match? Should we make the result implementation-dependent?
Currently, the arithmetic operation rules in [1] say:
The operands of an arithmetic expression do not have required types. An arithmetic expression is evaluated by applying the following rules, in order, until an error is raised or a value is computed:
1. If any operand is a sequence of length greater than one, a type exception is raised.
2. If any operand is an empty sequence, the result is an empty sequence.
3. If any operand is a node, its typed-value accessor is applied. If the node has no typed-value accessor, or if the typed-value accessor returns a sequence of more than one value, an error is raised. If the typed-value accessor returns the empty sequence, the result of the expression is the empty sequence.
4. If any operand is an untyped simple value (such as character data in a schemaless document), it is cast to the type suggested by its lexical form. For example, the untyped value 12 is cast to the type xs:integer.
5. If the arithmetic expression has two numeric operands of different types, one of the operands is promoted to the type of the other operand, following the promotion rules in [XQuery 1.0 and XPath 2.0 Functions and Operators]. For example, a value of type xs:integer can be promoted to xs:decimal, and a value of type xs:decimal can be promoted to xs:double.
6. If the operand type(s) are valid for the given operator, the operator is applied to the operand(s), resulting in either a simple value or an error (for example, an error might result from dividing by zero.) The combinations of simple types that are accepted by the various arithmetic operators, and their respective result types, are listed in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If the operand type(s) are not valid for the given operator, a type exception is raised.
Rule 4 cannot be efficiently implemented and basically would defer any algebrization of the operation to the runtime when the value is actually available to make this decision. Not even XPath 1.0 had such an impossible rule. (see also Mary's reply in [2])
Instead, I would like to align this with the rules of comparison operators in the following way:
The untyped simple value is cast to the type of the other operand.
If both operands are untyped, they are cast to double (in analogy to the XPath 1.0 number conversion).
E.g.,
unknownSimpleType + xsd:decimal will become cast as xsd:decimal (unknownSimpleType) + xsd:decimal. unknownSimpleType + unknownSimpleType will be cast as xsd:double (unknownSimpleType) + cast as xsd:double (unknownSimpleType).
Another proposal was provided by Michael Kay in [3] that however relays on the not yet introduced type numeric [4], thus I think we should follow the rule above (which is basically the same as we do for comparisons).
[1] http://www.w3.org/TR/xquery/#id-arithmetic
[2] [link to member only information]
[3] [link to member only information]
[4] [link to member only information]
I have been tasked with rewording the sections 2.5 and 2.6.1 in [1] with two proposed solutions for implicit treatment of unknown simple types (UST) with arithmetic and comparison operators based on my earlier proposal in [2] and a subsequent simplification discussed at today's XPath TF call. The rewording should also refer to the basic conversion rules that are defined in [1] Section 2.1 as: The basic conversion rules are as follows: If the required type is a simple type or an optional occurrence of a simple type: If the given value is a sequence of more than one item, a type exception is invoked. If the given value is a single node, its typed value is extracted by calling its typed value accessor. If the node has no typed value accessor or if its typed value is a sequence containing more than one item, a type exception is invoked. If the (given or extracted) value has an unknown simple type (as in the case of character data in a schemaless document), an attempt is made to cast it to the required simple type. If the cast fails, a type exception is invoked. If the (given or extracted) value does not conform to the required type, a type exception is raised. This includes the case in which the (given or extracted) value is an empty sequence and the required type is not an optional occurrence. If the required type is a sequence of a simple type: If the given value is a sequence containing one or more nodes, each such node is replaced by its typed value, resulting in a sequence of simple values. Each of these simple values then is converted to the required type by applying the rules described above for converting values to a required simple type. If the required type is a sequence of nodes: If the given value contains any item that is not a node, a type exception is invoked. In addition, I assume that numeric and numeric types are well-defined terms referring to the set of types double, float, decimal and all their subtypes (derived by restriction). ******************************************** Proposal I: Rewrite to treat UST as double if operating with numeric types ******************************************** 2.5 Arithmetic Expressions <leave as is until "For example, a-b will be interpreted as a single token."/> An arithmetic expression is evaluated by applying the following rules that are based on the basic conversion rules, in order, until an error is raised or a value is computed: The required types of the operands of an arithmetic expression do not have required types. 1. If any operand is a sequence of length greater than one, a type exception is raised (applying the basic conversion rule to each argument). 2. If any operand is an empty sequence, the result is an empty sequence(applying the basic conversion rule to each argument). 3. If any operand is a node, its typed-value accessor is applied. If the node has no typed-value accessor, or if the typed-value accessor returns a sequence of more than one value, an error is raised. If the typed-value accessor returns the empty sequence, the result of the expression is the empty sequence. (applying the basic conversion rule to each argument). 4. If any or both operands are an untyped simple value (such as character data in a schemaless document), the basic conversion rule is applied and the required type is xs:double. Thus an untyped simple value is cast to type xs:double. 5. If the arithmetic expression has two numeric operands of different types, one of the operands is promoted to the type of the other operand, following the promotion rules in [XQuery 1.0 and XPath 2.0 Functions and Operators]. For example, a value of type xs:integer can be promoted to xs:decimal, and a value of type xs:decimal can be promoted to xs:double. This is an extension to the basic conversion rule. 6. If the operand type(s) are valid for the given operator, the operator is applied to the operand(s), resulting in either a simple value or an error (for example, an error might result from dividing by zero.) The combinations of simple types that are accepted by the various arithmetic operators, and their respective result types, are listed in [XQuery 1.0 and XPath 2.0 Functions and Operators]. If the operand type(s) are not valid for the given operator, a type exception is raised. Ed. Note: A future version of this document will provide a mapping from the arithmetic operators to the functions that implement these operators for various datatypes. See issue 182. Here are some examples of arithmetic expressions: In general, arithmetic operations on numeric values result in numeric values: <rest stays the same/> 2.6.1 Value Comparisons Value comparisons are intended for comparing single values. The result of a value comparison is defined by applying the following rules, based on the basic conversion rules, in order: 1. If either operand is an empty sequence, the result is an empty sequence. 2. If either operand is a sequence containing more than one item, an error is raised. 3. If either operand is a node, its typed value is extracted. If the typed value is an empty sequence, the result of the comparison is an empty sequence. If the typed value is a sequence containing more than one item, an error is raised. 4. If one of the operands is an untyped simple value (such as character data in a schemaless document) and the other operand is a typed simple value, the required type for casting the untyped simple value is determined by the type of the other operands as follows: - if the type is of the other operand is numeric the required type becomes xs:double. - if the type of the other operand is unknown, then the required type for both becomes xs:string. - otherwise the type of the other operand becomes the required type. 5. The result of the comparison is true if the value of the first operand is (equal, not equal, less than, less than or equal, greater than, greater than or equal) to the value of the second operand; otherwise the result of the comparison is false. [XQuery 1.0 and XPath 2.0 Functions and Operators] describes which combinations of simple types are comparable, and how comparisons are performed on values of various types. If the value of the first operand is not comparable with the value of the second operand, a type exception is invoked. Ed. Note: A future version of this document will provide a mapping from the comparison operators to the functions that implement these operators for various datatypes. See issue 182. Here is an example of a value comparison: The following comparison is true only if $book1 has a single author subelement and its value is "Kennedy": $book1/author eq "Kennedy" ******************************************** Proposal II: Rewrite to treat UST as the other numeric type ******************************************** 2.5 Arithmetic Expressions Change Proposal I Rule 4 to: 4. If of the operands is an untyped simple value (such as character data in a schemaless document), the basic conversion rule is applied and the required type is set based on the type of the other operand: - the required type for both operands becomes xs:double if the type of the other operand is unknown - otherwise the required type becomes the type of the other operand. Thus an untyped simple value added to a float is cast to type xs:float. 2.6.1 Value Comparisons Change Proposal I Rule 4 to: 4. If one of the operands is an untyped simple value (such as character data in a schemaless document) and the other operand is a typed simple value, the required type for casting the untyped simple value is determined by the type of the other operands as follows: - if the type of the other operand is unknown, then the required type for both becomes xs:string. - otherwise the type of the other operand becomes the required type. ******** Analysis ******** The advantage of proposal I is that it is closer to the known XPath behaviour (although as Peter pointed out not the same), it is simpler to explain and implement and allows expressions where the UST value is a double and an operation combines it with a type based on decimal that would lead to runtime errors in case II. Based on extensive discussions with my constituency, users and implementers alike, this seemed to be the preferred solution. The disadvantage is a slight loss of type precision on the result that can be regained by explicitly casting the result or operands to the desired type. Best regards Michael [1] http://www.w3.org/TR/xquery/ [2] http://lists.w3.org/Archives/Member/w3c-xml-query-wg/2002Mar/0037.html
Decision by: xquery on 2002-03-27 ([link to member only information] ) XML Query WG has adopted a solution to Issues 259 and 91 as per Proposal 1 in Michael Rys' proposal.
Decision by: xsl on 2002-03-28 ([link to member only information] )
Does expr instance of type define an expected type with type so that data() is implied explicitly on:
let $e := <e xsi:type=?xsd:integer?/> return $e instanceof xsd:integer
is that
let $e := <e xsi:type=?xsd:integer?/> return data($e) instanceof xsd:integer
and thus true or false?
This issue is somewhat related to CAST (Issue 253), but since we perform a type test here, I would argue that we should not.
We currently say that in a constant string in XQuery, I can do any of the following three to escape quotes (please correct if I am wrong):
A. XQuery rule (works both in XQuery only and XQuery in XML embedding): quotes and double quotes are doubled if they are enclosed inside their own kind.
E.g.,
Lexical Value in datamodel '"' " '''' ' """" " '""' ""
B. XML rules (work only in XQuery in XML embedding since XML parser will work:
B1. Use ' when string delimiter is " and viceversa. This of course does not preserve data fidelity, so if the difference between them is important, you will need to use B2.
B2. Entitize
I assume that I cannot do just B, but that I have to use B to get A. E.g., <a foo="""/> in an XML document is not a valid XQuery and I have to write <a foo=""""/>
The problem that I have is that I do not know what the rules are for nesting quotes inside XQuery expressions:
What are the rules for:
<foo bar="{fnc1(<baz goo="{fnc2("string arg")}"/>)}"/>
Do I have to double and then triple? Does {} mean that the outside "" become inconsequential?
An alternative definition of data() on elements with known complex type:
If $e is an element of an known (complex) type, then data($e) evaluates to the concatenation of $e's text nodes and has UnknownSimpleType.
This definition is appropriate when explicit casts are necessary to convert UnknownSimpleType to other atomic types, i.e., when the basic conversion rules *DO NOT* implicitly convert UnknownSimpleType to other atomic types.
The benefit of this alternative is that a user can always safely apply data() to any node and is guaranteed never to get an error.
The the data() function is only defined on element and attributes with a simple type. The definition of data() on other kinds of nodes or on element and attributes with unknown type is still an open issue.
The corresponding issue in the Formal Semantics document is Issue-108.
Decision by: xpath-tf on 2002-04-11 ([link to member only information] )
xf:data(): decided that it should return the error object when applied to document, PI, comment and namespace nodes.
This change should be reflected in the F&O, XPath and Data Model document.
XSLT does not allow a local variable to be declared if there is already a local variable in scope with the same name. For example, the following is disallowed:
<xsl:variable name="i" select="0"/> <xsl:for-each select="item"> <xsl:variable name="i" select="$i + 1"/> <a><xsl:value-of select="$i"/></a> </xsl:for-each>
This restriction has proved with experience to be a good thing, because users writing a construct such as the one above have almost invariably misunderstood the way variables work in a declarative language; if the construct were allowed, it would not give them the results they expect.
The equivalent XQuery expression is currently allowed:
let $i := 0 for $x in item let $i := $i + 1 return <a>{$i}</a>
XPath 2.0 has no "let" expression, but it can include variable declarations, and these are allowed to shadow each other.
For XSLT users, it seems inconsistent that there should be different rules in XSLT and in XPath. The XSLT 1.0 rule, which makes variable shadowing an error, has proved useful in practice and we recommend that it should be adopted also for XPath 2.0 and XQuery 1.0.
Should we simplify the relationship between xsd:string and the anySimpleType'd data to have them both behave the same operationally by providing implicit coercions and being type compatible?
Alternate, in some peoples view mutually exclusive, issue:
Should we simplify the relationship between xsd:string and the anySimpleType'd data to have them both behave the same operationally by disallowing implicit coercions on anySimpleType and being type compatible?
One difficulty in designing XQuery is that it must meet the needs of two quite different constituencies:
Convenient: Quickly write queries to explore a large body of data. Works best with implicit coercions and dynamic typing.
Reliable: Solidly engineer queries for web services. Works best with explicit coercions and static typing.
We've already agreed to have two conformance levels, one with dynamic typing and one with static typing. Perhaps the dynamic typing level should have implicit coercions and the explicit typing level should have explicit coercions.
Currently the formal semantics maps arithmetic and comparison operations that have union types as (at least of one of) their argument types to a runtime type switch. This has serious unwanted consequences for "algebraization" of queries and optimization and leads to some surprising static typing results.
Should we make non-promotable union types on such operations a type error instead?
The ability to call external functions is an established feature of XSLT 1.0, and is retained in XSLT 2.0. The facility is widely used, and some significant libraries of external functions have been developed by third parties. We made an attempt to standardize language bindings for external functions in the XSLT 1.1 working draft, but this proved highly controversial and has been dropped. The facility remains, however, even though the binding mechanisms remain implementation-defined.
The XPath 2.0 specification continues to tolerate external functions, though it doesn't really acknowledge their existence properly. All we say is that the repertoire of functions that can be called is part of the context.
The issue is: should the function function-available() function be transferred from XSLT to XPath?
This function tests whether a named function is available, and returns true if it is, and false if it isn't. A typical call is:
if (function-available('my:debug')) then my:debug('Hi!') else ()
This has two implications:
(a) a call on my:debug must not be a static error if the function is not available
(b) the names of functions (and the in-scope namespaces needed to resolve their QNames) must be available at run-time.
Logically the function-available() function has no dependencies on XSLT so it should be transferred to XPath.
Part of the strength of external functions is that they can return objects that are outside the scope of the XPath type system. For example, a function library for performing SQL database access may have a function sql:connect() that returns an object representing a database connection. This object may be passed as an argument to calls on other functions in the SQL function library.
The way this is handled in XPath 1.0 is that the XPath specification defines four data-types, and explicitly leaves the host language free to define additional data types. We could probably live with a similar solution for XPath 2.0, but it's a fudge, and I think we ought to try and do better.
Note that the only things you can do with an external object (under the XSLT 1.0 rules) are to assign it to a variable, or pass it as the argument to another function. In practice I think implementations also allow external objects to have additional behavior, for example they might allow conversion to a string when used in a context where a string is required. I think we should leave such behavior implementation-defined rather than saying that it is always an error.
The question arises as to where external objects should fit into the type hierarchy. Should they be a top-level thing at the same level as "sequence", or should they be one level down, along with "node" and "atomic value"? I think it makes most sense to preserve the principle "everything is a sequence", which means that there are now three kinds of item: nodes, atomic values, and external objects.
Handling this rigorously sounds like quite a pervasive change to the spec, but I don't think it's as bad as it seems. I don't think we should add any language features to support external objects, with the possible exception of a keyword "external" in the type syntax so that one can test for it using "instance of". Functions and operators that work on any sequence (for example, count) should treat an external object like any other item in the sequence. Operations that expect nodes will fail if presented with an external object; operations that expect atomic values will also fail, except that implementations may define fallback conversions from external objects to atomic values.
The current proposed text for XQuery element constructors precludes a "text node only" implementation. Since XSL should have semantics aligned with XQuery a decision needs to be made by the XSL WG as to if this restriction is acceptable to construction in XSLT.
Should validation also check identity constraints? Note that valid identity constraints of partial documents does not imply validity of the document as a whole. The current document says that identity constraints are not checked.
Does validation introduce new xsi:type attributes, or should xsi:type attributes introduced for validation be removed?
Note: The XPath telcon suggested that we eliminate this issue and simply say that any attributes introduced for the purpose of validation are removed as part of the validate semantics.
Should validate introduce xsi:type to reflect type annotations that are not explicitly stated using an xsi:type in the source document?
The current draft introduces xsi:type to reflect inferred or dynamically computed types.
Does //@xsi:type match an xsi:type attribute? Compare to xml:lang, xml:space, xmlns, which are not represented as attributes in the XML Information Set. Note, however, that xsi:type is represented as an attribute in the Infoset. Should we treat it like other special XML attributes in the Data Model?
Should there be any provision for a lightweight cast that does not observe facets? Phil Wadler has suggested that 'validate' be used whenever full schema validation is desired, and 'cast' be used as a lightweight validation, which can be used for either simple or complex types, but which does not supply defaults, enforce facets, or check integrity constraints. It may be easier to optimize through cast than through validate, but supporting both constructs may confuse users due to their similarity. He suggests the following syntax for these expressions:
('cast'|'validate') as SequenceType () ('cast'|'validate') 'in' ContextExpr { Expr }
We need a way to represent the type name of untyped character data. In XML Schema, there is no one type that corresponds to this - in strict mode, elements whose content is untyped character data will have the type 'anyType' and attributes whose content is untyped character data will have the type 'anySimpleType', but this interacts in somewhat complex ways with lax and skip validation.
For now, we assume that character data may be associated with a SimpleType whose name is 'xs:unknownSimpleType'. This type does not currently exist in XML Schema, so we must coordinate with them on this issue.
If Schema does not provide a single type to represent untyped character data, we will provide a keyword for it in the ItemType production.
For our Formal Semantics, it would be very helpful to have a simple type to represent all numerics. For now, we are using the SimpleType name "xs:numeric". In XML Schema terms, this would be a union type. We must coordinate with XML Schema to see if they can support this. If not, we will provide a keyword for numerics in the ItemType production.
The element construction rules in 2.8 make efficient streaming of element construction difficult/impossible. For example, we execute the following expression on a stream and serialize the result in a streaming processing (such as XSLT like applications):
<foo>{"foo", "bar", if (expr) then "baz" else <baz/>}</foo>
If expr is true, then this is serialized:
<foo>foo bar baz</foo>
If expr is false, then this is serialized: <foo>foobar<baz/></foo>
The implementation must cache up the "foo" and "bar" strings, just in case a sub-element node is constructed. If not, then I must insert a space between "foo" and "bar". This seems to contradict one of our explicit use scenarios in the XML Query Requirements (section 2.5).
Is , a dyadic operator or (, , ,) a polyargument operator? The element construction rules seem to indicate the later, but the document is not clear. If , is a dyadic node-concatenation operation, then it would be more streamable than as an argument separator for the element constructor.
Unlike XSLT, attributes seem to be allowed anywhere which makes streaming implementations impossible. XSLT has the following rule:
"The following are all errors:
* Adding an attribute to an element after children have been added to it; implementations may either signal the error or ignore the attribute."
Example:
let $e := expr return <a>{<b/>, ($e/@* | $e/*)</a>
XSLT would consider this an error. XQuery does not. This makes streaming impossible (see #element-construction-vs-streaming). Note that while the above query can easily be rewritten, there are cases (e.g. function calls) where the rewrite is not possible.
XQuery should allow implementations to disallow attribute nodes that are specified after the first child node in the sequence. It should not allow disregarding them.
What does XQuery do if assigning a list of element nodes to an attribute if the type of the attribute is not a list type?
Example:
<book isbn="{$i/booknum}" />:
This query implicitly gets rewritten to: <book isbn="{data($i/booknum)}" />
What happens if there are more than one booknum elements and ISBN is untyped or not a list type?
Does the name expression on dynamically computed names in element/attribute constructors be of type QName without implicit cast from string, QName with implicit cast from string, or string?
If the name is constructed by an expression, the expected type is xs:QName. Xs:string is in general implicitly cast to xs:QName (and xs:anyURI).
The current element construction treats sequences of anySimpleType values different from other simple typed values. This seems inconsistent. The document should make it clear why there is a difference. If there is a reason, is the reason good enough?
The data model cannot represent CDATA or CharRef, since the Information Set looses this information.
The XQuery document should make it clear that:
1. CDATA sections and CharRefs inside XQueries that are not embedded inside XML (which is what the XQuery document only talks about), are syntactic helps to write queries that otherwise would need entitization (in the case if CDATA sections) or a unicode input device (CharRefs).
2. Implementations can chose to use this information as serialization hints to preserve the CDATA and entitization.
Should all elements and attributes have type annotations? In particular, should a newly-constructed element or attribute have a generic type annotation such as "anyType", rather than the current proposal in which it has no type annotation at all? (This is largely a cosmetic issue, about whether "anyType" should be denoted by an explicit annotation or by the absence of an annotation.)
Grammar of path expressions has been reorganized to conform more closely to description in Formal Semantics.
Material has been added on Named Typing, including detailed syntax for SequenceType declaration, explanation of static and dynamic type-checking, and new rules for type-matching in function calls.
Explanatory material has been added on typed values, document order, and the error value.
Some terminology has been changed for consistency with other documents; for example, "simple value" changed to "atomic value".
Some changes have been made to rules for handling untyped data in arithmetic and comparison expressions.
A more detailed specification is provided for the static and dynamic semantics of treat
and assert
.
A new section has been added on validate
expressions.
More details have been provided on the semantics of element and attribute constructors, including their data model representations.
A new section has been added on Input Functions, describing the input(), collection(), and document() functions.
An Operator Mapping Table has been added (Appendix B.)
Quantified expressions now permit multiple variable bindings.
The semantics of sortby
have changed: all ordering keys must now have the same type, and explicit control is provided over the placement of empty sort keys.
The semantics of and
, or
, and quantified expressions have changed so that an implementation is not forced to evaluate all the operand expressions if it encounters an error or a conclusive result.
Union, Intersect, and Except expressions now apply to nodes only, not to atomic values.
The definitions of the precedes and follows operators have been made independent of the preceding and following axes, since these axes are not supported in XQuery.
The operators ==
and !==
have been changed to is
and isnot
.
Quotes are now required around attribute values in element constructors, even if the value is computed by an enclosed expression.
It has been clarified that the result of a dereference operator is a node list in document order without duplicates.
It has been clarified that the default element namespace applies to types as well as to elements.
Document had been completely rewritten during the joint work on XPath (see text in Intro).
The following issues have been resolved:
Should not( () ) == true or () or not3 function be defined?
Do we really require for
at the
XPath expression level?
Datatypes... XQuery suggests that XPath 2.0 should have a richer set of datatypes based on the built-in types of XML Schema and the notion of an ordered sequence.
Do we need a Context Item to track the "current item" in a for itteration, and, if so, how should it work? How should "." work in relation to it?
Does the context include a default namespace declaration?
Do we need a datatype names binding in the context?
How should qname-to-collation bindings be handled?
Implied existential quantifiers
Functions on Empty Sequences... What should happen if a function expecting one element is invoked on an empty sequence?
Functions on Sequences... What should happen if a function expecting one element is invoked on a sequence of more than one element?
Path iteration... How should the current node be passed to a function in a path-step?
Should we use is and isnot instead of == and !==.
Semantics of positional predicates in XPath
Function call rules needed