W3C

XML Path Language (XPath) 2.0

W3C Working Draft 02 May 2003

This version:
http://www.w3.org/TR/2003/WD-xpath20-20030502
Latest version:
http://www.w3.org/TR/xpath20/
Previous versions:
http://www.w3.org/TR/2002/WD-xpath20-20021115/ http://www.w3.org/TR/2002/WD-xpath20-20020816/ http://www.w3.org/TR/2002/WD-xpath20-20020430/ http://www.w3.org/TR/2001/WD-xpath20-20011220/
Editors:
Anders Berglund (XSL WG), IBM Research <alrb@us.ibm.com>
Scott Boag (XSL WG), IBM Research <scott_boag@us.ibm.com>
Don Chamberlin (XML Query WG), IBM Almaden Research Center <chamberlin@almaden.ibm.com>
Mary F. Fernandez (XML Query WG), AT&T Labs <mff@research.att.com>
Michael Kay (XSL WG), Software AG <Michael.Kay@softwareag.com>
Jonathan Robie (XML Query WG), DataDirect Technologies <jonathan.robie@datadirect-technologies.com>
Jérôme Siméon (XML Query WG), Bell Labs, Lucent Technologies <simeon@research.bell-labs.com>

Abstract

XPath is a language for addressing parts of an XML document.

Status of this 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 contains a new syntax for identifying types, and new features that allow path expressions to select element and attribute nodes based on their types as well as their names. It changes some of the details of the semantics of arithmetic and comparison operators, including making the value comparison operators transitive. It includes some grammar changes, including changes in the comment delimiters and the syntax of the cast expression. A detailed list of changes can be found in H Revision Log.

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, in particular comments on Issue 510. 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 and the XSL Working Group (both part of the XML Activity).

Patent disclosures relevant to this specification may be found on the XSL Working Group's patent disclosure page at http://www.w3.org/Style/XSL/Disclosures.

Table of Contents

1 Introduction
2 Basics
    2.1 Expression Context
        2.1.1 Static Context
        2.1.2 Evaluation Context
    2.2 Input Functions
    2.3 Expression Processing
        2.3.1 Document Order
        2.3.2 Typed Value and String Value
    2.4 Types
        2.4.1 Predefined Types
        2.4.2 Type Checking
        2.4.3 SequenceType
            2.4.3.1 SequenceType Matching
        2.4.4 Type Conversions
            2.4.4.1 Atomization
            2.4.4.2 Effective Boolean Value
    2.5 Error Handling
        2.5.1 Kinds of Errors
        2.5.2 Handling Dynamic Errors
        2.5.3 Errors and Optimization
    2.6 Optional Features
        2.6.1 Basic XPath
        2.6.2 Static Typing Feature
3 Expressions
    3.1 Primary Expressions
        3.1.1 Literals
        3.1.2 Variables
        3.1.3 Parenthesized Expressions
        3.1.4 Function Calls
        3.1.5 XPath Comments
    3.2 Path Expressions
        3.2.1 Steps
            3.2.1.1 Axes
            3.2.1.2 Node Tests
        3.2.2 Predicates
        3.2.3 Unabbreviated Syntax
        3.2.4 Abbreviated Syntax
    3.3 Sequence Expressions
        3.3.1 Constructing Sequences
        3.3.2 Combining Sequences
    3.4 Arithmetic Expressions
    3.5 Comparison Expressions
        3.5.1 Value Comparisons
        3.5.2 General Comparisons
        3.5.3 Node Comparisons
        3.5.4 Order Comparisons
    3.6 Logical Expressions
    3.7 For Expressions
    3.8 Conditional Expressions
    3.9 Quantified Expressions
    3.10 Expressions on SequenceTypes
        3.10.1 Instance Of
        3.10.2 Cast
        3.10.3 Castable
        3.10.4 Constructor Functions
        3.10.5 Treat

Appendices

A XPath Grammar
    A.1 EBNF
        A.1.1 Parsing Notes
    A.2 Lexical structure
        A.2.1 Whitespace Rules
        A.2.2 Lexical Rules
    A.3 Reserved Function Names
    A.4 Precedence Order
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 18 April 2003


1 Introduction

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 is an extension of XPath Version 2.0. 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:

This document specifies a grammar for XPath, using the same Basic EBNF notation used in [XML], except that grammar symbols always have initial capital letters. Unless otherwise noted (see A.2 Lexical structure), whitespace is not significant in the grammar. Grammar productions are introduced together with the features that they describe, and a complete grammar is also presented in the appendix [A XPath Grammar].

In the grammar productions in this document, nonterminal symbols are underlined and literal text is enclosed in double quotes. Certain productions (including the productions that define DecimalLiteral, DoubleLiteral, and StringLiteral) employ a regular-expression notation. The following example production describes the syntax of a function call:

[59]    FunctionCall    ::=    QName "(" (ExprSingle ("," ExprSingle)*)? ")"

The production should be read as follows: A function call consists of a QName followed by an open-parenthesis. The open-parenthesis is followed by an optional argument list. The argument list (if present) consists of one or more expressions, separated by commas. The optional argument list is followed by a close-parenthesis. The symbol ExprSingle denotes an expression that does not contain any top-level commas (since top-level commas in a function call are used to separate the function arguments).

Certain aspects of language processing are described in this specification as implementation-defined or implementation-dependent. These terms are defined as follows:

Editorial note  
A future version of this document will include links between terms (in bold font) and their definitions.


2 Basics

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. (However, unlike a pure functional language, it does not allow variable substitutability if the variable definition contains construction of new nodes.) XPath is also a strongly-typed language in which the operands of various expressions, operators, and functions must conform to the expected types.

Like XML, XPath is a case-sensitive language. All keywords in XPath use lower-case characters.

The value of an expression is always a sequence, which 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]. Each node has a unique node identity. 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.

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 fn: is considered to be bound to the namespace of XPath/XQuery functions, http://www.w3.org/2003/05/xpath-functions (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 are used without a namespace prefix. Also, this document assumes that the default function namespace is set to the namespace of XPath/XQuery functions, so function names appearing without a namespace prefix can be assumed to be in this namespace.

2.1 Expression Context

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.

2.1.1 Static Context

The static context of an expression is the 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.

Any component of the static context that is not assigned a default value in the XPath specification, and is not assigned a value by the host language, may be assigned an implementation-defined initial value. If processing of an expression relies on some component of the static context that has not been assigned a value, a static error is raised.

Static context consists of the following components:

  • XPath 1.0 compatibility mode. This value is true if rules for backward compatibility with XPath Version 1.0 are in effect; otherwise it is false.

  • 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 element namespace. 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 function namespace. This is a namespace URI. This namespace URI is used for any unprefixed QName appearing as the function name in a function call.

  • In-scope schema definitions. This is a generic term for all the element, attribute, and type definitions that are in scope during processing of an expression. It includes the following three parts:

    • In-scope type definitions. The in-scope type definitions always include the built-in types of [XML Schema] and the predefined types in the namespace http://www.w3.org/2003/05/xpath-datatypes. Additional type definitions may be added to the in-scope type definitions by the host language.

      XML Schema distinguishes named types, which are given a QName by the schema designer, must be declared at the top level of a schema, and are uniquely identified by their QName, from anonymous types, which are not given a name by the schema designer, must be local, and are identified in an implementation-dependent way. Both named types and anonymous types can be present in the in-scope type definitions.

    • In-scope element declarations. Each element declaration is identified either by a QName (for a top-level element) or by an implementation-defined element identifier (for a local element). Element declarations may be provided by the language environment.An element declaration includes information about the substitution groups to which this element belongs.

    • In-scope attribute declarations. Each attribute declaration is identified either by a QName (for a top-level attribute) or by an implementation-defined attribute identifier (for a local attribute). Attribute declarations may be provided by the language environment.

  • 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 expression. The QName represents the name of the variable, and the type represents its static data type.

    The static types of in-scope variables may be derived from static analysis of the expressions in which the variables are bound, or provided by the external environment.

  • In-scope functions. This part of the static context defines the set of functions that are available to be called from within an expression. Each function is uniquely identified by its QName and its arity (number of parameters). The static context maps the QName and arity into a function signature and a function definition. The function signature specifies the static types of the function parameters and the function result.

    For each atomic type in the in-scope type definitions, there is a constructor function in the in-scope functions. Constructor functions are discussed in 3.10.4 Constructor Functions.

  • 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 when necessary in the resolution of relative URIs (for example, by the fn:resolve-uri function.) The base URI is always provided by the external environment.

2.1.2 Evaluation Context

The evaluation context of an expression is defined as information that is available at the time the expression is evaluated.

Any component of the evaluation context that is not assigned a default value in the XPath specification, and is not assigned a value by the host language, may be assigned an implementation-defined initial value. If processing of an expression relies on some component of the evaluation context that has not been assigned a value, a dynamic error is raised.

The evaluation context consists of all the components of the static context, and the additional components listed below.

The first three components of the evaluation context (context item, context position, and context size) 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 may supplied by the environment in which the expression is evaluated--otherwise, the focus for the outermost expression is undefined. Any reference to a component of an undefined focus raises an error. Certain language constructs, notably the path expression E1/E2 and the predicate expression E1[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.

  • 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 or E1[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 fn:position(). When an expression E1/E2 or E1[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 or E1[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.

  • Dynamic variables. This is a set of (QName, value) pairs. It contains the same QNames as the in-scope variables in the static context for the expression. Each variable name is associated with a typed value. The dynamic type associated with the value of 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 typed value of a variable may be set by execution of an expression that binds a value to the variable, or by the external environment.

  • Current date and time. This information represents an implementation-dependent point in time during processing of a query or transformation. It can be retrieved by the fn:current-date, fn:current-time, and fn:current-dateTime functions. If invoked multiple times during the execution of a query or transformation, these functions always returns the same result.

  • Implicit timezone. This is the timezone to be used when a date, time, or dateTime value that does not have a timezone is used in a comparison or in any other operation. This value is an instance of xdt:dayTimeDuration that is implementation-defined. See [ISO 8601] for the range of legal values of a timezone.

  • Input sequence. An input sequence is a 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 by the host language.

2.2 Input Functions

XPath has a set of functions that provide access to input data. These functions are of particular importance because they provide a way in which an expression can reference a document or a collection of documents. The 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 defined by the host language.

The input functions supported by XPath are as follows:

  • The fn:input function, which takes no parameters, returns the input sequence. For example, the expression fn:input()//customer returns all the customer elements that are descendants of nodes in the input sequence. If no input sequence has been bound, the fn:input function raises a dynamic error.

  • The fn: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 fn:collection("http://example.org")//customer identifies all the customer elements that are descendants of nodes found in the collection whose URI is http://example.org.

  • The fn:doc function, when its first argument is a string containing a single URI that refers to an XML document, returns a document node whose content is the Data Model representation of the given document.

If a given input function is invoked repeatedly with the same arguments during the scope of a single query or transformation, each invocation returns the same result.

2.3 Expression Processing

Editorial note  
Some material in this section duplicates material in [XQuery 1.0 and XPath 2.0 Data Model]. Work is in progress to decide where this material will be normatively defined (see Issue 554.)

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 and atomic values. 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 might be converted to the Data Model by the following steps:

  1. The document might be parsed using an XML parser that generates an XML Information Set (see [XML Infoset]).

  2. The parsed document might 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).

  3. If necessary, the PSVI can be transformed to make it acceptable for processing by a particular system. For example, if the implementation understands only built-in XML Schema types, user-defined typenames in the PSVI might be replaced by their built-in base types or by generic types such as xs:anyType (for elements) and xs:anySimpleType (for attributes).

  4. The PSVI can be transformed into the Data Model by a process described in [XQuery 1.0 and XPath 2.0 Data Model]. During this transformation, an error is raised if the PSVI contains an element, attribute, or type whose expanded name matches a name in the in-scope schema definitions (ISSD), but whose definition in the PSVI is not consistent with the corresponding definition in the ISSD. Typenames in the PSVI that are not present in the ISSD are replaced by xs:anyType (for types of elements) or xs:anySimpleType (for types of attributes). At the conclusion of the transformation process, every element name, attribute name, and type name in the resulting Data Model instance matches an entry in the ISSD.

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 (except for the constraint that the result must be consistent with the in-scope schema definitions).

Each element or attribute node in the Data Model has an annotation that indicates its dynamic type. If the Data Model was derived from an input XML document, the dynamic types of the elements and attributes are derived from schema validation. The dynamic type of an element or attribute indicates its range of values--for example, an attribute named version might have the dynamic 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 dynamic type xdt:untypedAtomic.

The value of an element is represented by the children of the element node, which may include text nodes and other element nodes. The dynamic type of an element node indicates how the values in its child text nodes are to be interpreted. An element whose type is unknown (such as might occur in a schemaless document) is annotated with the type xs:anyType.

Atomic values in the Data Model also carry dynamic type annotations. An atomic value of unknown type is annotated with the type xdt:untypedAtomic. Under certain circumstances (such as during processing of an arithmetic operator), an atomic value of xdt:untypedAtomic may be cast into a more specific type (such as xs:double).

This document provides a description of how each kind of expression is processed. For each expression, the operands and result are instances of the Data Model.

The terms document order, typed value, and string value are described here because they are of particular importance for the processing of expressions.

2.3.1 Document Order

Document order defines a total ordering among all the nodes seen by the language processor. Informally, document order corresponds to a pre-order, depth-first, left-to-right traversal of the nodes in the Data Model.

Within a given 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 form of the document (after expansion of entities). Element nodes occur before their children, and the children of an element node occur before its following siblings. 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.

The relative order of nodes in distinct documents is implementation-defined but stable within a given query or transformation. Given two distinct documents A and B, if a node in document A is before a node in document B, then every node in document A is before every node in document B. The relative order among free-floating nodes (those not in a document) is also implementation-defined but stable.

2.3.2 Typed Value and String Value

Nodes have a typed value and a string value that can be extracted by calling the fn:data function and the fn:string function, respectively. The typed value of a node is a sequence of atomic values, and the string value of a node is a string. Element and attribute nodes also have a type annotation, which is a type identifier that is found in the in-scope type definitions. The type annotation represents the dynamic (run-time) type of the node. XPath does not provide a way to directly access the type annotation of an element or attribute node.

The typed value and string value for each kind of node are defined by the dm:typed-value and dm:string-value accessors in [XQuery 1.0 and XPath 2.0 Data Model]. The relationship between the typed value and the string value for various kinds of nodes is described and illustrated by examples below.

  1. For text, document, comment, processing instruction, and namespace nodes, the typed value of the node is the same as its string value, as an instance of xdt:untypedAtomic. (The string value of a document node is formed by concatenating the string values of all its descendant text nodes, in document order.)

  2. The typed value of an attribute node with the type annotation xdt:untypedAtomic is the same as its string value, as an instance of xdt:untypedAtomic. The typed value of an attribute node with any other type annotation is derived from its string value and type annotation in a way that is consistent with schema validation.

    Example: A1 is an attribute having string value "3.14E-2" and type annotation xs:double. The typed value of A1 is the xs:double value whose lexical representation is 3.14E-2.

    Example: A2 is an attribute with type annotation IDREFS, which is a list type derived from IDREF. Its string value is "bar baz faz". The typed value of A2 is a sequence of three atomic values ("bar", "baz", "faz"), each of type IDREF. The typed value of a node is never treated as an instance of a named list type. Instead, if the type annotation of a node is a list type (such as IDREFS), its typed value is treated as a sequence of the underlying base type (such as IDREF).

  3. For an element node, the relationship between typed value and string value depends on the node's type annotation, as follows:

    1. If the type annotation is xs:anyType, or denotes a complex type with mixed content, then the typed value of the node is equal to its string value, as an instance of xdt:untypedAtomic.

      Example: E1 is an element node having type annotation xs:anyType and string value "1999-05-31". The typed value of E1 is "1999-05-31", as an instance of xdt:untypedAtomic.

      Example: E2 is an element node with the type annotation formula, which is a complex type with mixed content. The content of E2 consists of the character "H", a child element named subscript with string value "2", and the character "O". The typed value of E2 is "H2O" as an instance of xdt:untypedAtomic.

    2. If the type annotation denotes a simple type or a complex type with simple content, then the typed value of the node is derived from its string value and its type annotation in a way that is consistent with schema validation.

      Example: E3 is an element node with the type annotation cost, which is a complex type that has several attributes and a simple content type of xs:decimal. The string value of E3 is "74.95". The typed value of E3 is 74.95, as an instance of xs:decimal.

      Example: E4 is an element node with the type annotation hatsizelist, which is a simple type derived by list from the type hatsize, which in turn is derived from xs:integer. The string value of E4 is "7 8 9". The typed value of E4 is a sequence of three values (7, 8, 9), each of type hatsize.

    3. If the type annotation denotes a complex type with empty content, then the typed value of the node is the empty sequence.

    4. If the type annotation denotes a complex type with non-mixed complex content, then the typed value of the node is undefined. The fn:data function raises an error when applied to such a node.

      Example: E5 is an element node with the type annotation weather, which is a complex type whose content type specifies elementOnly. E5 has two child elements named temperature and precipitation. The typed value of E5 is undefined, and the fn:data function applied to E5 raises an error.

2.4 Types

XPath is a strongly typed language with a type system based on [XML Schema]. When the type of a value is incompatible with the expected type for the context in which it is used, a type error is raised. A type error may be detected and reported during the analysis phase or during the evaluation phase, as described in 2.4.2 Type Checking.

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.

2.4.1 Predefined Types

All the built-in types of [XML Schema] are recognized by XPath. These built-in types are in the namespace http://www.w3.org/2001/XMLSchema, which is represented in this document by the prefix xs. Some examples of built-in schema types include xs:integer, xs:string, and xs:date.

In addition, XPath recognizes the predefined types listed below. All these predefined types are in the namespace http://www.w3.org/2003/05/xpath-datatypes, which is represented in this document by the prefix xdt.

  1. xdt:anyAtomicType is an abstract type that includes all atomic values (and no values that are not atomic). It is a subtype of xs:anySimpleType, which is the base type for all simple types, including atomic, list, and union types. All specific atomic types such as xs:integer, xs:string, and xdt:untypedAtomic, are subtypes of xdt:anyAtomicType.

  2. xdt:untypedAtomic is a specific atomic type used for untyped data, such as text that is not given a specific type by schema validation. It has no subtypes.

  3. xdt:dayTimeDuration is a subtype of xs:duration whose lexical representation contains only day, hour, minute, and second components.

  4. xdt:yearMonthDuration is a subtype of xs:duration whose lexical representation is restricted to contain only year and month components.

For more details about predefined types, see [XQuery 1.0 and XPath 2.0 Functions and Operators].

Additional type definitions may be added by the host language environment via the in-scope type definitions.

2.4.2 Type Checking

XPath defines two phases of processing called the analysis phase and the evaluation phase.

The analysis phase depends on the expression itself and on the static context. The analysis phase does not depend on any input data. The purpose of type-checking during the analysis phase is to provide early detection of type errors and to compute the type of a result.

During the analysis phase, 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 5 + 1.2 is xs:decimal. 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 static type checking is in effect and an operand of an expression is found to have a static type that is not appropriate for that operand, a type 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 either to produce a value of type T or to raise a dynamic error.

The evaluation phase is performed only after successful completion of the analysis phase. The evaluation phase depends on input data, on the expression being evaluated, and on the evaluation context. During the evaluation phase, a dynamic type is associated with each value as it is computed. The dynamic type of a value may be either a structural type (such as "sequence of integers") or a named type. 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 incompatible with the expected type for that operand, a type error is raised.

Even though static typing can catch many type errors before an expression is executed, it is possible for an expression to raise an error during evaluation that was not detected by static analysis. 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, a dynamic error will result. Similarly, an expression may apply an arithmetic operator to a value whose static type is xs:anySimpleType. This is not a static error, but at run time, if the value cannot be successfully cast to a numeric type, a dynamic error will be raised.

It is also possible for static analysis of an expression to raise a type error, even though execution of the expression on certain inputs would be successful. For example, an expression might contain a function that requires an element as its parameter, and the analysis phase might infer the static type of the function parameter to be an optional element. This case would be treated as a static type error, even though the function call would be successful for input data in which the optional element is present.

2.4.3 SequenceType

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.

SequenceType
[61]    SequenceType    ::=    (ItemType OccurrenceIndicator?)
| "empty" "(" ")"
[76]    OccurrenceIndicator    ::=    "?" | "*" | "+"
[63]    ItemType    ::=    AtomicType | KindTest | "item" "(" ")"
[62]    AtomicType    ::=    QName
[64]    KindTest    ::=    DocumentTest
| ElementTest
| AttributeTest
| ProcessingInstructionTest
| CommentTest
| TextTest
| AnyKindTest
[67]    ProcessingInstructionTest    ::=    "processing-instruction" "(" StringLiteral? ")"
[69]    CommentTest    ::=    "comment" "(" ")"
[70]    TextTest    ::=    "text" "(" ")"
[71]    AnyKindTest    ::=    "node" "(" ")"
[68]    DocumentTest    ::=    "document-node" "(" ElementTest? ")"
[65]    ElementTest    ::=    "element" "(" ((SchemaContextPath LocalName)
| (NodeName ("," TypeName "nillable"?)?))? ")"
[66]    AttributeTest    ::=    "attribute" "(" ((SchemaContextPath "@" LocalName)
| ("@" NodeName ("," TypeName)?))? ")"
[72]    SchemaContextPath    ::=    SchemaGlobalContext "/" SchemaContextStep "/"*
[8]    SchemaGlobalContext    ::=    QName | SchemaGlobalTypeName
[9]    SchemaContextStep    ::=    QName
[7]    SchemaGlobalTypeName    ::=    "type" "(" QName ")"
[73]    LocalName    ::=    QName
[74]    NodeName    ::=    QName | "*"
[75]    TypeName    ::=    QName | "*"

QNames appearing in a SequenceType have their prefixes expanded to namespace URIs by means of the in-scope namespaces and the default element namespace. It is a static error to use a name in a SequenceType if that name is not found in the appropriate part of the in-scope schema definitions. If the name is used as an element name, it must appear in the in-scope element declarations; if it is used as an attribute name, it must appear in the in-scope attribute declarations; and if it is used as a type name, it must appear in the in-scope type definitions.

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(po:shipto, po:address) refers to an element that has the name po:shipto (or is in the substitution group of that element), and has the type annotation po:address (or a subtype of that type)

  • element(po:shipto, *) refers to an element named po:shipto (or in the substitution group of po:shipto), with no restrictions on its type

  • element(*, po:address) refers to an element of any name that has the type annotation po:address (or a subtype of po:address). If the keyword nillable were used following po:address, that would indicate that the element may have empty content and the attribute xsi:nil="true", even though the declaration of the type po:address has required content.

  • node()* refers to a sequence of zero or more nodes of any type

  • item()+ refers to a sequence of one or more nodes or atomic values

2.4.3.1 SequenceType Matching

During processing of an expression, 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 is consistent with 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

As stated above, an item may be a node or an atomic value. The process of matching a given item against a given ItemType is performed as follows

  1. The ItemType item() matches any single item. For example, item() matches the atomic value 1 or the element <a/>.

  2. If an ItemType consists simply of a QName, that QName must be the name of an atomic type that is in the in-scope type definitions; otherwise a static error is raised. An ItemType consisting of the QName of an 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 an atomic type derived by restriction from xs:decimal. The named atomic type may be a generic type such as xdt:anyAtomicType. (Note that names of non-atomic types such as xs:IDREFS are not accepted in this context.)

  3. The following ItemTypes (referred to generically as KindTests) match nodes:

    1. node() matches any node.

    2. text() matches any text node.

    3. processing-instruction() matches any processing instruction node.

    4. processing-instruction(N ) matches any processing instruction node whose name (called its "PITarget" in XML) is equal to N, where N is a StringLiteral. Example: processing-instruction("browser") matches any processing instruction directed to the application named browser.

    5. comment() matches any comment node.

    6. document-node() matches any document node.

    7. document-node(E) matches any document node whose content consists of exactly one element node that matches E, where E is an ElementTest (see below). Example: document-node(element(book)) matches any document node whose content consists of exactly one element node named book, that conforms to the schema declaration for the top-level element book.

    8. An ElementTest (see below) matches an element node, optionally qualifying the node by its name, its type, or both.

    9. An AttributeTest (see below) matches an attribute node, optionally qualifying the node by its name, its type, or both.

An ElementTest is used to match an element node by its name and/or type. An ElementTest may take one of the following forms:

  1. element(), or element(*), or element(*,*). All these forms of ElementTest are equivalent, and they all match any single element node, regardless of its name or type.

  2. element(N, T), where N is a QName and T is a QName optionally followed by the keyword nillable. In this case, T must be the name of a top-level type definition in the in-scope type definitions. The ElementTest matches a given element node if:

    1. the name of the given element node is equal to N (expanded QNames match), or is equal to the name of any element in a substitution group headed by a top-level element with the name N; and:

    2. the type annotation of the given element node is T, or is a named type that is derived by restriction or extension from T. However, this test is not satisfied if the given element node has an attribute xsi:nil="true" and T does not specify nillable.

    The following examples illustrate this form of ElementTest, matching an element node whose name is person and whose type annotation is surgeon (the second example permits the element to have xsi:nil="true"):

    element(person, surgeon)
    element(person, surgeon nillable)
    
  3. element(N), where N is a QName. This form is very similar to the previous form, except that the required type, rather than being named explicitly, is taken from the top-level declaration of element N. In this case, N must be the name of a top-level element declaration in the in-scope element declarations. The ElementTest matches a given element node if:

    1. the name of the given element node is equal to N (expanded QNames match), or is equal to the name of any element in a substitution group headed by N; and:

    2. the type annotation of the given element node is the same as, or derived by restriction or extension from, the type of the top-level declaration for element N. The types to be compared may be either named types (identified by QNames) or anonymous types (identified in an implementation-dependent way). However, this test is not satisfied if the given element node has an attribute xsi:nil="true" and the top-level declaration for element N does not specify nillable.



    The following example illustrates this form of ElementTest, matching an element node whose name is person and whose type annotation conforms to the top-level person element declaration in the in-scope element declarations:

    element(person)
    
  4. element(N, *), where N is a QName. This ElementTest matches a given element node if the name of the node is equal to N (expanded QNames match), or is equal to the name of any element in a substitution group headed by a top-level element with the name N. The given element node may have any type annotation.

    The following example illustrates this form of ElementTest, matching any element node whose name is person or is in the person substitution group, regardless of its type annotation:

    element(person, *)
    
  5. element(*, T), where T is a QName optionally followed by the keyword nillable. In this case, T must be the name of a top-level type definition in the in-scope type definitions. The ElementTest matches a given element node if the node's type annotation is T, or is a named type that is derived by restriction or extension from T. However, this test is not satisfied if the given element node has an attribute xsi:nil="true" and T does not specify nillable.

    The following examples illustrate this form of ElementTest, matching any element node whose type annotation is surgeon, regardless of its name (the second example permits the element to have xsi:nil="true"):

    element(*, surgeon)
    element(*, surgeon nillable)
    
  6. element(P), where P is a valid schema context path beginning with a top-level element name or type name in the in-scope schema definitions and ending with an element name. This ElementTest matches a given element node if:

    1. the name of the given element node is equal to the last name in the path (expanded QNames match), and:

    2. the type annotation of the given element node is the same as the type of the element represented by the schema path P.

    The following examples illustrate this form of ElementTest, matching element nodes whose name is person. In the first example, the node must conform to the schema definition of a person element in a staff element in a hospital element. In the second example, the node must conform to the schema definition of a person element within the top-level type schedule:

    element(hospital/staff/person)
    element(type(schedule)/person)
    

An AttributeTest is used to match an attribute node by its name and/or type. An AttributeTest may take one of the following forms:

  1. attribute(), or attribute(@*), or attribute(@*,*). All these forms of AttributeTest are equivalent, and they all match any single attribute node, regardless of its name or type.

  2. attribute(@N, T), where N and T are QNames. In this case, T must be the name of a top-level simple type definition in the in-scope type definitions. This AttributeTest matches a given attribute node if:

    1. the name of the given attribute node is equal to N (expanded QNames match), and:

    2. the type annotation of the given attribute node is T, or is a named type that is derived by restriction from T.

    The following example illustrates this form of AttributeTest, matching an attribute node whose name is price and whose type annotation is currency:

    attribute(@price, currency)
    
  3. attribute(@N), where N is a QName. This form is very similar to the previous form, except that the required type, rather than being named explicitly, is taken from the top-level attribute declaration with name N.In this case, N must be the name of a top-level attribute declaration in the in-scope attribute declarations. This AttributeTest matches a given attribute node if:

    1. the name of the given attribute node is equal to N (expanded QNames match), and:

    2. the type annotation of the given attribute node is the same as, or derived by restriction from, the type of the top-level attribute declaration for N. The types to be compared may be either named types (identified by QNames) or anonymous types (identified in an implementation-dependent way).



    The following example illustrates this form of AttributeTest, matching an attribute node whose name is price and whose type annotation conforms to the schema declaration for a top-level price attribute:

    attribute(@price)
    
  4. attribute(@N, *), where N is a QName. This AttributeTest matches a given attribute node if the name of the node is equal to N (expanded QNames match). The given attribute node may have any type annotation.

    The following example illustrates this form of AttributeTest, matching any attribute node whose name is price, regardless of its type annotation:

    attribute(@price, *)
    
  5. attribute(@*, T), where T is a QName. In this case, T must be the name of a top-level simple type definition in the in-scope type definitions. This AttributeTest matches a given attribute node if the node's type annotation is T, or is a named type that is derived by restriction from T.

    The following example illustrates this form of AttributeTest, matching any attribute node whose type annotation is currency, regardless of its name:

    attribute(@*, currency)
    
  6. attribute(P), where P is a valid schema context path beginning with a top-level element name or type name in the in-scope schema definitions, and ending with an attribute name (preceded by @). This AttributeTest matches a given attribute node if:

    1. the name of the given attribute node is equal to the last name in the path (expanded QNames match), and:

    2. the type annotation of the given attribute node is the same as the type of the attribute represented by the schema path P.

    The following examples illustrate this form of AttributeTest, matching attribute nodes whose name is price. In the first example, the node must conform to the schema definition of a price attribute in a product element in a catalog element. In the second example, the node must conform to the schema definition of a price attribute within the top-level type plan:

    attribute(catalog/product/@price)
    attribute(type(plan)/@price)
    

2.4.4 Type Conversions

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 automatically perform certain type conversions, 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 3.1.4 Function Calls. Other operators that provide special conversion rules include arithmetic operators, which are discussed in 3.4 Arithmetic Expressions, and value comparisons, which are discussed in 3.5.1 Value Comparisons.

2.4.4.1 Atomization

Type conversions sometimes depend on a process called atomization, which is used when a sequence of atomic values is required. The result of atomization is either a sequence of atomic values or a type error. Atomization of a sequence is defined as the result of invoking the fn:data function on the sequence, as defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

The semantics of fn:data are repeated here for convenience. The result of fn:data is the sequence of atomic values produced by applying the following rules to each item in the input sequence:

  • If the item is an atomic value, it is returned.

  • If the item is a node, it is replaced by its typed value.

Atomization may be used in processing the following types of expressions:

  • Arithmetic expressions

  • Comparison expressions

  • Function calls and returns

  • Cast expressions

2.4.4.2 Effective Boolean Value

Under certain circumstances (listed below), it is necessary to find the effective boolean value of a sequence. This is defined as the result of invoking the fn:boolean function on the sequence, as defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

The semantics of fn:boolean are repeated here for convenience. fn:boolean returns false if its operand is any of the following:

  • An empty sequence.

  • The boolean value false.

  • A zero-length string ("").

  • A numeric value that is equal to zero.

  • The double or float value NaN.

Otherwise, fn:boolean returns true.

The effective boolean value of a sequence is computed implicitly during processing of the following types of expressions:

  • Logical expressions (and, or)

  • The fn:not function

  • Certain types of predicates, such as a[b].

  • Conditional expressions (if)

  • Quantified expressions (some, every)

Note that the definition of effective boolean value is not used when casting a value to the type xs:boolean.

2.5 Error Handling

2.5.1 Kinds of Errors

As described in 2.4.2 Type Checking, XPath defines an analysis phase, which does not depend on input data, and an evaluation phase, which does depend on input data.

The result of the analysis phase is either success or one or more type errors and/or static errors. Type errors reported by the analysis phase occur when the static type of an expression is not correct for the context in which it appears. Static errors are non-type-related errors such as syntax errors. The means by which errors are reported during the analysis phase is implementation-defined.

The result of the evaluation phase is either a result value, a type error, or a dynamic error. Type errors are raised during the evaluation phase when the dynamic type of an expression is not correct for the context in which it appears. Dynamic errors are non-type-related errors such as numeric overflow. If evaluation of an expression yields a value (that is, it does not raise an error), the value must be the value specified by the dynamic semantics defined in [XQuery 1.0 Formal Semantics].

If an implementation can determine by static analysis that an expression will necessarily raise a dynamic error (for example, because it attempts to construct a decimal value from a constant string that is not in the lexical space of xs:decimal), the implementation is allowed to report this error during the analysis phase (as well as during the evaluation phase).

[XQuery 1.0 Formal Semantics] defines the set of static, dynamic, and type errors. In addition to these errors, an XPath implementation may raise implementation-defined warnings, either during the analysis phase or the evaluation phase. The circumstances in which warnings are raised, and the ways in which warnings are handled, are implementation-defined.

In addition to the errors defined in this specification, an implementation may raise a dynamic error if insufficient resources are available for processing a given expression. For example, an implementation may specify limitations on the maximum numbers or sizes of various objects. These limitations, and the consequences of exceeding them, are implementation-defined.

2.5.2 Handling Dynamic Errors

Except as noted in this document, if any operand of an expression raises a dynamic error, the expression also raises a dynamic error. If an expression can validly return a value or raise a dynamic error, the implementation may choose to return the value or raise the dynamic error. For example, the logical expression expr1 and expr2 may return the value false if either operand returns false, or may raise a dynamic error if either operand raises a dynamic error.

If more than one operand of an expression raises an error, the implementation may choose which error is raised by the expression. For example, in this expression:

($x div $y) + xs:decimal($z)

both ($x div $y) and xs:decimal($z) may raise an error. The implementation may choose which error is raised by the "+" expression. Once one operand raises an error, the implementation is not required, but is permitted, to evaluate any other operands.

A dynamic error carries an error value, which may be a single item or an empty sequence. For example, an error value might be an integer, a string, a QName, or an element. An implementation may provide a mechanism whereby an application-defined error handler can process error values and produce diagnostics; in the absence of such an error handler, the string-value of the error value may be used directly as an error message.

A dynamic error may be raised by a built-in function or operator. For example, the input function raises an error if the input sequence is not defined in the evaluation context.

An error can be raised explicitly by calling the fn:error function, which only raises an error and never returns a value. The fn:error function takes an optional item as its parameter, which is used as the error value. For example, the following function call raises a dynamic error whose error value is a string:

fn:error(fn:concat("Unexpected value ", fn:string($v)))

2.5.3 Errors and Optimization

Because different implementations may choose to evaluate or optimize an expression in different ways, the detection and reporting of dynamic errors is implementation dependent.

When an implementation is able to evaluate an expression without evaluating some subexpression, the implementation is never required to evaluate that subexpression solely to determine whether it raises a dynamic error. For example, if a function parameter is never used in the body of the function, an implementation may choose whether to evaluate the expression bound to that parameter in a function call.

In some cases, an optimizer may be able to achieve substantial performance improvements by rearranging an expression so that the underlying operations such as projection, restriction, and sorting are performed in a different order than that specified in [XQuery 1.0 Formal Semantics]. In such cases, dynamic errors may occur that could not have occurred if the expression were evaluated as written. For example, consider the following expression:

$N[@x castable as xs:date]
      [xs:date(@x) gt xs:date("2000-01-01")]

This expression cannot fail with a casting error if it is evaluated exactly as written. An implementation is permitted, however, to reorder the predicates to achieve better performance (for example, by taking advantage of an index). This reordering could cause the above expression to fail. However, an expression must not be rearranged in a way that causes it to return a non-error result that is different from the result defined by [XQuery 1.0 Formal Semantics].

To avoid unexpected errors caused by reordering of expressions, tests that are designed to prevent dynamic errors should be expressed using conditional expressions, as in the following example:

$N[if (@x castable as xs:date)
   then xs:date(@x) gt xs:date("2000-01-01")
   else false()]

In the case of a conditional expression, the implementation is required not to evaluate the then branch if the condition is false, and not to evaluate the else branch if the condition is true. Conditional expressions are the only kinds of expressions that provide guaranteed conditions under which a particular subexpression will not be evaluated.

2.6 Optional Features

XPath defines a a required level of functionality, called Basic XPath, and an optional feature called the Static Typing Feature.

2.6.1 Basic XPath

A Basic XPath implementation must implement the full XPath language as described in this specification, subject to the following limitations:

  1. In a Basic XPath implementation, the in-scope type definitions consist only of the built-in types defined in [XML Schema] and the additional predefined types in the http://www.w3.org/2003/05/xpath-datatypes namespace.

  2. A mapping from a Post-Schema Validation Infoset (PSVI) to the Data Model is specified in [XQuery 1.0 and XPath 2.0 Data Model]. In a Basic XPath implementation, this mapping maps each datatype that is not one of the predefined types listed above into its nearest supertype that belongs to this list. As a result of this mapping, all complex types are mapped into xs:anyType. (Of course, mapping from a PSVI is only one way in which a Data Model instance might be constructed--other ways are also possible.)

  3. If any SequenceType contains a typename that is not one of the predefined types listed above, a Basic XPath implementation raises a static error.

  4. If any SequenceType contains an ElementTest or AttributeTest that contains a TypeName or a SchemaContextPath, a Basic XPath implementation raises a static error.

  5. If the processing of an expression depends on the type of some value, and that type is not one of the predefined types listed above, a Basic XPath implementation raises a dynamic error.

  6. A Basic XPath implementation is not required to raise type errors during the analysis phase. If an expression contains one or more non-type-related static errors, then a Basic XPath implementation must raise at least one of these static errors during the analysis phase. If the analysis phase is successful but one or more dynamic errors are encountered during the evaluation phase, then a Basic XPath implementation must raise at least one of these dynamic errors.

2.6.2 Static Typing Feature

The Static Typing Feature removes the limitation specified by Rule 6 of Basic XPath. An implementation that includes this feature is required to detect type errors during the analysis phase. If an expression contains one or more static errors or type errors, then a Static Typing implementation must raise at least one of these errors during the analysis phase.

3 Expressions

This section introduces each of the basic kinds of expression. Each kind of expression has a name such as PathExpr, which is introduced on the left side of the grammar production that defines the expression. Since XPath is a composable language, each kind of expression is defined in terms of other expressions whose operators have a higher precedence. In this way, the precedence of operators is represented explicitly in the grammar.

The order in which expressions are discussed in this document does not reflect the order of operator precedence. In general, this document introduces the simplest kinds of expressions first, followed by more complex expressions. For a complete overview of the grammar, see the Appendix [A XPath Grammar].

[15]    XPath    ::=    Expr?
[16]    Expr    ::=    ExprSingle ("," ExprSingle)*
[17]    ExprSingle    ::=    ForExpr
| QuantifiedExpr
| IfExpr
| OrExpr

The highest-level (goal) symbol in the XPath grammar is XPath.

The XPath operator that has lowest precedence is the comma operator, which is used to concatenate two operands to form a sequence. As shown in the grammar, a general expression (Expr) can consist of two operands (ExprSingle) separated by a comma. The name ExprSingle denotes an expression that does not contain a top-level comma operator (despite its name, an ExprSingle may evaluate to a sequence containing more than one item.)

The symbol ExprSingle is used in various places in the grammar where an expression is not allowed to contain a top-level comma. For example, each of the arguments of a function call must be an ExprSingle, because commas are used to separate the arguments of a function call.

After the comma, the expressions that have next lowest precedence are ForExpr, QuantifiedExpr, IfExpr, and OrExpr. Each of these expressions is described in a separate section of this document.

3.1 Primary Expressions

Primary expressions are the basic primitives of the language. They include literals, variables, function calls, constructors, and the use of parentheses to control precedence of operators.

[41]    PrimaryExpr    ::=    Literal | FunctionCall | ("$" VarName) | ParenthesizedExpr
[12]    VarName    ::=    QName

3.1.1 Literals

A literal is a direct syntactic representation of an atomic value. XPath supports two kinds of literals: numeric literals and string literals.

[56]    Literal    ::=    NumericLiteral | StringLiteral
[57]    NumericLiteral    ::=    IntegerLiteral | DecimalLiteral | DoubleLiteral
[3]    IntegerLiteral    ::=    Digits
[4]    DecimalLiteral    ::=    ("." Digits) | (Digits "." [0-9]*) /* ws: explicit */
[5]    DoubleLiteral    ::=    (("." Digits) | (Digits ("." [0-9]*)?)) ("e" | "E") ("+" | "-")? Digits /* ws: explicit */
[6]    StringLiteral    ::=    ('"' (('"' '"') | [^"])* '"') | ("'" (("'" "'") | [^'])* "'") /* ws: significant */

The value of a numeric literal containing no "." and no e or E character is an atomic value 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 an atomic value whose 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 an atomic value whose type is xs:double and whose value is obtained by parsing the numeric literal according to the rules of the xs:double datatype.

The value of a string literal is an atomic value whose type is xs:string and whose value is the string denoted by the characters between the delimiting apostrophes or quotation marks. If the literal is delimited by apostrophes, two adjacent apostrophes within the literal are interpreted as a single apostrophe. Similarly, if the literal is delimited by quotation marks, two adjacent quotation marks within the literal are interpreted as one quotation mark.

If a string literal is used in an XPath expression contained within the value of an XML attribute, the characters used to delimit the literal should be different from the characters that are used to delimit the attribute.

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.

  • "He said, ""I don't like it.""" denotes a string containing two quotation marks and one apostrophe.

The boolean values true and false can be represented by calls to the built-in functions fn:true() and fn:false(), respectively.

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]. In general, the name of a constructor function for a given type is the same as the name of the type (including its namespace). For example:

  • xs:integer("12") returns the integer value twelve.

  • xs:date("2001-08-25") returns an item whose type is xs:date and whose value represents the date 25th August 2001.

  • xdt:dayTimeDuration("PT5H") returns an item whose type is xdt:dayTimeDuration and whose value represents a duration of five hours.

It is also possible to construct values of various types by using a cast expression. For example:

  • 9 cast as hatsize returns the atomic value 9 whose type is hatsize.

3.1.2 Variables

A variable reference is a QName preceded by a $-sign. Two variable references are equivalent if their local names are the same and their namespace prefixes are bound to the same namespace URI in the in-scope namespaces. An unprefixed variable reference is in no namespace.

Every variable reference must match a name in the in-scope variables, which include variables from the following sources:

  1. A variable may be added to the in-scope variables by the host language environment.

  2. A variable may be bound by an XPath expression. The kinds of expressions that can bind variables are for expressions (3.7 For Expressions) and quantified expressions (3.9 Quantified Expressions).



Every variable binding has a static scope. The scope defines where references to the variable can validly occur. It is a static error to reference a variable that is not in scope. If a variable is bound in the static context for an expression, that variable is in scope for the entire expression.

If a variable reference matches two or more bindings that are in scope, then the reference is taken as referring to the inner binding, that is, the one whose scope is smaller. At evaluation time, the value of a variable reference is the value of the expression to which the relevant variable is bound. The scope of a variable binding is defined separately for each kind of expression that can bind variables.

3.1.3 Parenthesized Expressions

[58]    ParenthesizedExpr    ::=    "(" Expr? ")"

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.

Empty parentheses are used to denote an empty sequence, as described in 3.3.1 Constructing Sequences.

3.1.4 Function Calls

A function call consists of a QName followed by a parenthesized list of zero or more expressions, called arguments. If the QName in the function call has no namespace prefix, it is considered to be in the default function namespace.

If the expanded QName and number of arguments in a function call do not match the name and arity of an in-scope function in the static context, an error is raised (the host language environment may define this error as either a static or a dynamic error.)

[59]    FunctionCall    ::=    QName "(" (ExprSingle ("," ExprSingle)*)? ")"

A function call is evaluated as follows:

  1. Each argument expression is evaluated, producing an argument value. The order of argument evaluation is implementation-dependent and a function need not evaluate an argument if the function can evaluate its body without evaluating that argument.

  2. Each argument value is converted by applying the function conversion rules listed below.

  3. 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 expected type; that is, to the declared type of the function parameter. The expected type is expressed as a SequenceType. The function conversion rules are applied to a given value as follows:

  • If XPath 1.0 compatibility mode is true, then one of the following conversions is applied:

    1. If the expected type is xs:string or xs:string?, then the given value V is effectively replaced by fn:string(fn:subsequence(V, 1, 1)).

    2. If the expected type is xs:double or xs:double?, then the given value V is effectively replaced by fn:number(fn:subsequence(V, 1, 1)).

    3. If the expected type is a (possibly optional) node or item, then the given value V is effectively replaced by fn:subsequence(V, 1, 1).

    4. Otherwise, the given value is unchanged.

  • If the expected type is a sequence of an atomic type (possibly with an occurrence indicator *, +, or ?), the following conversions are applied:

    1. Atomization is applied to the given value, resulting in a sequence of atomic values.

    2. Each item in the atomic sequence that is of type xdt:untypedAtomic is cast to the expected atomic type.

    3. For each numeric item in the atomic sequence that can be promoted to the expected atomic type using the promotion rules in B.1 Type Promotion, the promotion is done.

  • If, after the above conversions, the resulting value does not match the expected type according to the rules for SequenceType Matching, a type error is raised. Note that the rules for SequenceType Matching permit a value of a derived type to be substituted for a value of its base type.

A core library of functions is defined in [XQuery 1.0 and XPath 2.0 Functions and Operators]. Additional functions may be provided in the static context.

Since the arguments of a function call are separated by commas, any argument expression that contains a top-level comma operator must be enclosed in parentheses. Here are some illustrative examples of function calls:

  • 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.

  • one-argument-function(( )) denotes a function call with one argument that is an empty sequence.

  • zero-argument-function( ) denotes a function call with zero arguments.

3.1.5 XPath Comments

[1]    ExprComment    ::=    "(:" (ExprCommentContent | ExprComment)* ":)" /* pn: parens */
[2]    ExprCommentContent    ::=    Char

XPath comments can be used to provide informative annotation. These comments are lexical constructs only, and do not affect the processing of an expression. Comments are delimited by the symbols (: and :). Comments may be nested.

Comments may be used anywhere that ignorable whitespace is allowed. See A.2 Lexical structure for the exact lexical states where comments are recognized.

The following is an example of a comment:

(: Houston, we have a problem :)

3.2 Path Expressions

A path expression can be used to locate nodes within a tree.

[36]    PathExpr    ::=    ("/" RelativePathExpr?)
| ("//" RelativePathExpr)
| RelativePathExpr
[37]    RelativePathExpr    ::=    StepExpr (("/" | "//") StepExpr)*

A path expression consists of a series of one or more steps, separated by "/" or "//", and optionally beginning with "/" or "//". An initial "/" or "//" is an abbreviation for one or more initial steps that are implicitly added to the beginning of the path expression, as described below.

A path expression consisting of a single step is evaluated as described in 3.2.1 Steps.

Each occurrence of // in a path expression is expanded as described in 3.2.4 Abbreviated Syntax, leaving a sequence of steps separated by /. This sequence of steps is then evaluated from left to right. Each operation E1/E2 is evaluated as follows: Expression E1 is evaluated, and if the result is not a sequence of nodes, a dynamic error is raised. 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.2 Evaluation Context. Each evaluation of E2 must result in a sequence of nodes; otherwise, a dynamic error is raised. The sequences of nodes resulting from all the evaluations of E2 are merged, eliminating duplicate nodes based on node identity and sorting the results in document order.

As an example of a 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 "/" at the beginning of a path expression is an abbreviation for the initial step fn:root(self::node()). The effect of this initial step is to begin the path at the root node of the tree that contains the context node. If the context item is not a node, a type error is raised.

A "//" at the beginning of a path expression is an abbreviation for the initial steps fn:root(self::node())/descendant-or-self::node(). The effect of these initial steps is to establish an initial node sequence that contains all nodes in the same tree as the context node. This node sequence is then filtered by subsequent steps in the path expression. If the context item is not a node, a dynamic error is raised.

3.2.1 Steps

[38]    StepExpr    ::=    AxisStep | FilterStep
[39]    AxisStep    ::=    (ForwardStep | ReverseStep) Predicates
[40]    FilterStep    ::=    PrimaryExpr Predicates
[47]    ForwardStep    ::=    (ForwardAxis NodeTest) | AbbreviatedForwardStep
[48]    ReverseStep    ::=    (ReverseAxis NodeTest) | AbbreviatedReverseStep

A step generates a sequence of items and then filters the sequence by zero or more predicates. The value of the step consists of those items that satisfy the predicates. Predicates are described in 3.2.2 Predicates. XPath provides two kinds of step, called a filter step and an axis step.

A filter step consists simply of a primary expression followed by zero or more predicates. The result of the filter expression consists of all the items returned by the primary expression for which all the predicates are true. If no predicates are specified, the result is simply the result of the primary expression. This result may contain nodes, atomic values, or any combination of these. The ordering of the items returned by a filter step is the same as their order in the result of the primary expression.

The result of an axis step is always a sequence of zero or more nodes, and these nodes are always returned in document order. An axis step may be either a forward step or a reverse step, followed by zero or more predicates. An axis step might be thought of as beginning at the context node and navigating to those nodes that are reachable from the context node via a specified axis. Such a step has two parts: an axis, which defines the "direction of movement" for the step, and a node test, which selects nodes based on their kind, name, and/or type.

In the abbreviated syntax for a step, the axis can be omitted and other shorthand notations can be used as described in 3.2.4 Abbreviated Syntax.

The unabbreviated syntax for an axis step consists of the axis name and node test separated by a double colon. The result of the step consists of the nodes reachable from the context node via the specified axis that have the node kind, name, and/or type specified by the node test. For example, the step child::para selects the para element children of the context node: child is the name of the axis, and para is the name of the element nodes to be selected on this axis. The available axes are described in 3.2.1.1 Axes. The available node tests are described in 3.2.1.2 Node Tests. Examples of steps are provided in 3.2.3 Unabbreviated Syntax and 3.2.4 Abbreviated Syntax.

3.2.1.1 Axes
[51]    ForwardAxis    ::=    "child" "::"
| "descendant" "::"
| "attribute" "::"
| "self" "::"
| "descendant-or-self" "::"
| "following-sibling" "::"
| "following" "::"
| "namespace" "::"
[52]    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 tree 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 tree 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 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

  • the namespace axis contains the namespace nodes of the context node; this axis is empty unless the context node is an element node. The namespace axis is deprecated in XPath 2.0. Whether an implementation supports the namespace axis is implementation-defined. An implementation that does not support the namespace axis must raise a static error if it is used. Applications needing information about the namespaces of an element should use the functions fn:get-in-scope-namespaces and fn:get-namespace-uri-for-prefix defined in [XQuery 1.0 and XPath 2.0 Functions and Operators].

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. 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.

3.2.1.2 Node Tests

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), the name of the node, or (in the case of element and attribute nodes), the type annotation of the node.

[53]    NodeTest    ::=    KindTest | NameTest
[54]    NameTest    ::=    QName | Wildcard
[55]    Wildcard    ::=    "*"
| NCName ":" "*"
| "*" ":" NCName
/* ws: explicit */

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 consists of a QName is called a name test. A name test is true if and only if the kind of the node is the principal node kind and the expanded-QName of the node is equal to the expanded-QName specified by the name test. 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::abc:href selects the attribute of the context node with the QName abc:href; if the context node has no such attribute, it selects an empty set of nodes.

A QName in a name test is expanded into an expanded-QName using the in-scope namespaces in the expression context. It is a static error if the QName has a prefix that does not correspond to any in-scope namespace. An unprefixed QName, when used as a name test on an axis whose principal node kind is element, has the namespaceURI of the default element namespace in the expression context; otherwise, it has no namespaceURI.

A name test is not satisfied by an element node whose name does not match the QName of the name test, even if it is in a substitution group whose head is the named element.

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 in-scope namespaces in the static context. If the prefix is not found in the in-scope namespaces, a static error is raised. The node test is true for any node of the principal node kind whose expanded-QName has the namespace URI to which the prefix is bound, 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.

An alternative form of a node test is called a KindTest, which can select nodes based on their kind, name, and type annotation. The syntax and semantics of a KindTest are described in 2.4.3 SequenceType. When a KindTest is used in a node test, only those nodes on the designated axis that match the KindTest are selected. Shown below are several examples of KindTests that might be used in path expressions:

  • node() matches any node.

  • text() matches any text node.

  • comment() matches any comment node.

  • element() matches any element node.

  • element(person) matches any element node whose name is person (or is in the substitution group headed by person), and whose type annotation conforms to the top-level schema declaration for a person element.

  • element(person, *) matches any element node whose name is person (or is in the substitution group headed by person), without any restriction on type annotation.

  • element(person, surgeon) matches any element node whose name is person (or is in the substitution group headed by person), and whose type annotation is surgeon.

  • element(*, surgeon) matches any element node whose type annotation is surgeon, regardless of its name.

  • element(hospital/staff/person) matches any element node whose name and type annotation conform to the schema declaration of a person element in a staff element in a top-level hospital element.

  • attribute() matches any attribute node.

  • attribute(@price, *) matches any attribute whose name is price, regardless of its type annotation.

  • attribute(*, xs:decimal) matches any attribute whose type annotation is xs:decimal, regardless of its name.

  • document-node() matches any document node.

  • document-node(element(book)) matches any document node whose content consists of a single element node that satisfies the KindTest element(book).

3.2.2 Predicates

[42]    Predicates    ::=    ("[" Expr "]")*

A predicate consists of an expression, called a predicate expression, enclosed in square brackets. A predicate serves to filter a sequence, retaining some items and discarding others. For each item in the sequence to be filtered, the predicate expression is evaluated using an inner focus derived from that item, as described in 2.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 items 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:

  1. If the value of the predicate expression is an atomic value of a numeric type, the predicate truth value is true if the value of the predicate expression is equal to the context position, and is false otherwise.

  2. Otherwise, the predicate truth value is the Effective Boolean Value of the predicate expression.

Here are some examples of axis 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]
    

Here are some examples of filter steps that contain predicates:

  • List all the integers from 1 to 100 that are divisible by 5. (See 3.3.1 Constructing Sequences for an explanation of the to operator.)

    (1 to 100)[. mod 5 eq 0]
    
  • The result of the following expression is the integer 95:

    (99 to 0)[5]
    

3.2.3 Unabbreviated Syntax

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 3.2.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

  • parent::* selects the parent of the context node. If the context node is an attribute node, this expression returns the element node (if any) to which the attribute node is attached.

  • 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 root of the node hierarchy that contains 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 a list parent and that are in the same document as the context node

  • child::para[fn:position() = 1] selects the first para child of the context node

  • child::para[fn:position() = fn:last()] selects the last para child of the context node

  • child::para[fn:position() = fn:last()-1] selects the last but one para child of the context node

  • child::para[fn:position() > 1] selects all the para children of the context node other than the first para child of the context node

  • following-sibling::chapter[fn:position() = 1]selects the next chapter sibling of the context node

  • preceding-sibling::chapter[fn:position() = 1]selects the previous chapter sibling of the context node

  • /descendant::figure[fn:position() = 42] selects the forty-second figure element in the document

  • /child::doc/child::chapter[fn:position() = 5]/child::section[fn: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'][fn:position() = 5]selects the fifth para child of the context node that has a type attribute with value warning

  • child::para[fn: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][fn:position() = fn:last()] selects the last chapter or appendix child of the context node

3.2.4 Abbreviated Syntax

[49]    AbbreviatedForwardStep    ::=    "." | ("@" NameTest) | NodeTest
[50]    AbbreviatedReverseStep    ::=    ".."

The abbreviated syntax permits the following abbreviations:

  1. The most important abbreviation is that the axis name can be omitted from an axis step. If the axis name is omitted from an axis step, the default axis is child unless the axis step contains an AttributeTest; in that case, the default axis is attribute. For example, a path expression section/para is an abbreviation for child::section/child::para. Similarly, section/attribute(@id) is an abbreviation for child::section/attribute::attribute(@id).

  2. 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.

  3. // is effectively replaced by /descendant-or-self::node()/ during processing of a path expression. For example, //para is an abbreviation 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.

  4. A step consisting of . returns the context item. This is particularly useful in conjunction with the // operator. For example, the path expression .//para returns all para descendant elements of the context node.

  5. 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[fn: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 a list parent

  • . selects the context item

  • .//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 typeattribute 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 book element that is a child of the context node.

  • book/fn:id(publisher)/name returns the same result as fn:id(book/publisher)/name.

  • If E is any expression that returns a sequence of nodes, then the expression E/. returns the same nodes in document order, with duplicates eliminated based on node identity.

3.3 Sequence Expressions

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).

3.3.1 Constructing Sequences

[16]    Expr    ::=    ExprSingle ("," ExprSingle)*
[29]    RangeExpr    ::=    AdditiveExpr ( "to" AdditiveExpr )?

One way to construct a sequence is by using the comma operator, which evaluates each of its operands and concatenates the resulting values, in order, into a single result sequence. Empty parentheses can be used to denote an empty sequence. In places where the grammar calls for ExprSingle, such as the arguments of a function call, any expression that contains a top-level comma operator must be enclosed in parentheses.

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. Each of the operands of the to operator is converted as though it was an argument of a function with the expected parameter type xs:integer (this process raises an error if the operand cannot be converted to a single 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 as one operand in constructing a sequence:

    (10, 1 to 4)
    

    It evaluates to the sequence:

    10, 1, 2, 3, 4

  • This example constructs a sequence of length one:

    10 to 10
    

    It evaluates to a sequence consisting of the single integer 10.

3.3.2 Combining Sequences

[33]    UnionExpr    ::=    IntersectExceptExpr ( ("union" | "|") IntersectExceptExpr )*
[34]    IntersectExceptExpr    ::=    ValueExpr ( ("intersect" | "except") ValueExpr )*
[35]    ValueExpr    ::=    PathExpr

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 on node identity. If an operand of union, intersect, or except contains an item that is not a node, a type error is raised.

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.

3.4 Arithmetic Expressions

XPath provides arithmetic operators for addition, subtraction, multiplication, division, and modulus, in their usual binary and unary forms.

[30]    AdditiveExpr    ::=    MultiplicativeExpr ( ("+" | "-") MultiplicativeExpr )*
[31]    MultiplicativeExpr    ::=    UnaryExpr ( ("*" | "div" | "idiv" | "mod") UnaryExpr )*
[32]    UnaryExpr    ::=    ("-" | "+")* UnionExpr

The binary subtraction operator must be preceded by whitespace if it could otherwise be interpreted as part of the previous token. For example, a-b will be interpreted as a name, but a - b will be interpreted as an arithmetic operation.

An arithmetic expression is evaluated by applying the following rules, in order, until an error is raised or a value is computed:

  1. Atomization is applied to each operand.

  2. If either operand is now an empty sequence, the result of the operation is an empty sequence.

  3. If either operand is now a sequence of length greater than one, then:

    1. If XPath 1.0 compatibility mode is true, any items after the first item in the sequence are discarded.

    2. Otherwise, a type error is raised.

  4. If either operand is now of type xdt:untypedAtomic, it is cast to the default type for the given operator. The default type for the idiv operator is xs:integer; the default type for all other arithmetic operators is xs:double. If the cast fails, a type error is raised.

  5. If the operand types are now valid for the given operator, the operator is applied to the operands, resulting in an atomic value or a dynamic 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 together with the functions in [XQuery 1.0 and XPath 2.0 Functions and Operators] that define the semantics of the operation for each type.

  6. If the operand types are not valid for the given operator, and XPath 1.0 compatibility mode is true, and the operator is not idiv, then each operand is further converted according to the rules in 3.1.4 Function Calls as if it were a function argument with the expected type xs:double. The operator is then applied to the operands, resulting in an atomic value or a dynamic error.

  7. If the operand types are still not valid for the given operator, a type error is raised.

XPath supports two division operators named div and idiv. The div operator accepts operands of any numeric types. The type of the result of the div operator is the least common type of its operands; however, if both operands are of type xs:integer, div returns a result of type xs:decimal. The idiv operator, on the other hand, requires its operands to be of type xs:integer and returns a result of type xs:integer, rounded toward zero.

Here are some examples of arithmetic expressions:

  • The first expression below returns -1.5, and the second expressions returns -1:

    -3 div 2
    -3 idiv 2
    
  • Subtraction of two date values results in a value of type xdt: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)
    

3.5 Comparison Expressions

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.

[28]    ComparisonExpr    ::=    RangeExpr ( (ValueComp
| GeneralComp
| NodeComp
| OrderComp) RangeExpr )?
[44]    ValueComp    ::=    "eq" | "ne" | "lt" | "le" | "gt" | "ge"
[43]    GeneralComp    ::=    "=" | "!=" | "<" | "<=" | ">" | ">="
[45]    NodeComp    ::=    "is" | "isnot"
[46]    OrderComp    ::=    "<<" | ">>"

When an XPath expression is written within an XML document, the XML escaping rules for special characters must be followed; thus "<" must be written as "&lt;".

3.5.1 Value Comparisons

Value comparisons are intended for comparing single values. The result of a value comparison is defined by applying the following rules, in order:

  1. Atomization is applied to each operand. If the result, called an atomized operand, does not contain exactly one atomic value, a type error is raised.

  2. Any atomized operand that has the dynamic type xdt:untypedAtomic is cast to the type xs:string.

  3. 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 atomized operand is not comparable with the value of the second atomized operand, a type error 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"
    
  • The following comparison is true if hatsize and shoesize are both user-defined types that are derived by restriction from a primitive numeric type:

    hatsize(5) eq shoesize(5)
    

3.5.2 General Comparisons

General comparisons are existentially quantified comparisons that may be applied to operand sequences of any length. The result of a general comparison that does not raise an error is always true or false.

Atomization is applied to each operand of a general comparison. The result of the comparison is true if and only if there is a pair of atomic values, one belonging to the result of atomization of the first operand and the other belonging to the result of atomization of the second operand, that have the required magnitude relationship. Otherwise the result of the general comparison is false. The magnitude relationship between two atomic values is determined as follows:

  1. If either atomic value has the dynamic type xdt:untypedAtomic, that value is cast to a required type, which is determined as follows:

    1. If the dynamic type of the other atomic value is a numeric type, the required type is xs:double.

    2. If the dynamic type of the other atomic value is xdt:untypedAtomic, the required type is xs:string.

    3. Otherwise, the required type is the dynamic type of the other atomic value.

    If the cast to the required type fails, a dynamic error is raised.

  2. If XPath 1.0 compatibility mode is true, and at least one of the atomic values has a numeric type, then both atomic values are cast to to the type xs:double.

  3. After any necessary casting, the atomic values are compared using one of the value comparison operators eq, ne, lt, le, gt, or ge, depending on whether the general comparison operator was =, !=, <, <=, >, or >=. The values have the required magnitude relationship if the result of this value comparison is true.

When evaluating a general comparison in which either operand is a sequence of items, an implementation may return true as soon as it finds an item in the first operand and an item in the second operand for which the underlying value comparison is true. Similarly, a general comparison may raise a dynamic error as soon as it encounters an error in evaluating either operand, or in comparing a pair of items from the two operands. As a result of these rules, the result of a general comparison is not deterministic in the presence of errors.

Here are some examples of general comparisons:

  • The following comparison is true if the value of any author subelement of $book1 has the string value "Kennedy":

    $book1/author = "Kennedy"
    
  • The following example contains three general comparisons. The value of the first two comparisons is true, and the value of the third comparison is false. This example illustrates the fact that general comparisons are not transitive.

    (1, 2) = (2, 3)
    (2, 3) = (3, 4)
    (1, 2) = (3, 4)
    
  • Suppose that $a, $b, and $c are bound to element nodes with type annotation xdt:untypedAtomic, with string values "1", "2", and "2.0" respectively. Then ($a, $b) = ($c, 3.0) returns false, because $b and $c are compared as strings. However, ($a, $b) = ($c, 2.0) returns true, because $b and 2.0 are compared as numbers.

3.5.3 Node Comparisons

The result of a node comparison is defined by applying the following rules, in order:

  1. Each operand must be either a single node or an empty sequence; otherwise a type error is raised.

  2. If either operand is an empty sequence, the result of the comparison is an empty sequence.

  3. 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"]
    

3.5.4 Order Comparisons

The result of an order comparison is defined by applying the following rules, in order:

  1. Both operands must be either a single node or an empty sequence; otherwise a type error is raised.

  2. If either operand is an empty sequence, the result of the comparison is an empty sequence.

  3. A comparison with the << operator returns true if the first operand node is earlier than the second operand node in document order; otherwise it returns false.

  4. A comparison with the >> operator returns true if the first operand node is later than the second operand node in document order; 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"]
    

3.6 Logical Expressions

A logical expression is either an and-expression or an or-expression. If a logical expression does not raise an error, its value is always one of the boolean values true or false.

Logical Expressions
[22]    OrExpr    ::=    AndExpr ( "or" AndExpr )*
[23]    AndExpr    ::=    InstanceofExpr ( "and" InstanceofExpr )*

The first step in evaluating a logical expression is to find the effective boolean value of each of its operands (see 2.4.4.2 Effective Boolean Value).

The value of an and-expression is determined by the effective boolean values (EBV's) of its operands. If an error is raised during computation of one of the effective boolean values, an and-expression may raise a dynamic error, as shown in the following table:

AND: EBV2 = true EBV2 = false error in EBV2
EBV1 = true true false error
EBV1 = false false false false or error
error in EBV1 error false or error error

The value of an or-expression is determined by the effective boolean values (EBV's) of its operands. If an error is raised during computation of one of the effective boolean values, an or-expression may raise a dynamic error, as shown in the following table:

OR: EBV2 = true EBV2 = false error in EBV2
EBV1 = true true true true or error
EBV1 = false true false error
error in EBV1 true or error error 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 raise an error if evaluation of the first expression raises an error. Similarly, an and-expression can return false if the first expression evaluated is false, and it can raise an error if evaluation of the first expression raises an error. As a result of these rules, 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 eq 1 and 2 eq 2
    
    1 eq 1 or 2 eq 3
    
  • The following expression may return either false or raise a dynamic error:

    1 eq 2 and 3 idiv 0 = 1
    
  • The following expression may return either true or raise a dynamic error:

    1 eq 1 or 3 idiv 0 = 1
    
  • The following expression must raise a dynamic error:

    1 eq 1 and 3 idiv 0 = 1
    

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. 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 an error is encountered in finding the effective boolean value of its operand, not raises a dynamic error. The not function is described in [XQuery 1.0 and XPath 2.0 Functions and Operators].

3.7 For Expressions

XPath provides an iteration facility called a for expression.

[18]    ForExpr    ::=    SimpleForClause "return" ExprSingle
[19]    SimpleForClause    ::=    "for" "$" VarName "in" ExprSingle ("," "$" VarName "in" ExprSingle)*

A for expression is evaluated as follows:

  1. If the for expression uses multiple variables, it is first expanded to a set of nested for expressions, each of which uses only one variable. For example, the expression for $x in X, $y in Y return $x + $y is expanded to for $x in X return for $y in Y return $x + $y.

  2. In a single-variable for expression, the variable is called the range variable, the value of the expression that follows the in keyword is called the input sequence, and the expression that follows the return keyword is called the return expression. The result of the for expression is obtained by evaluating the return expression once for each item in the input sequence, with the range variable bound to that item. The resulting sequences are concatenated in the order of the items in the input sequence from which they were derived.

The following example illustrates the use of a for expression in restructuring an input document. The example is based on the following input:

<bib>
  <book>
    <title>TCP/IP Illustrated</title>
    <author>Stevens</author>
    <publisher>Addison-Wesley</publisher>
  </book>
  <book>
    <title>Advanced Unix Programming</title>
    <author>Stevens</author>
    <publisher>Addison-Wesley</publisher>
  </book>
  <book>
    <title>Data on the Web</title>
    <author>Abiteboul</author>
    <author>Buneman</author>
    <author>Suciu</author>
  </book>
</bib>

The following example transforms the input document into a list in which each author's name appears only once, followed by a list of titles of books written by that author. This example assumes that the context item is the bib element in the input document.

for $a in distinct-values(//author)
return ($a,
        for $b in //book[author = $a]
        return $b/title)

The result of the above expression consists of the following sequence of elements. The ordering of author elements in the result is implementation-dependent.

<author>Stevens</author> 
<title>TCP/IP Illustrated</title>
<title>Advanced Programming in the Unix environment</title>
<author>Abiteboul</author>
<title>Data on the Web</title>
<author>Buneman</author>
<title>Data on the Web</title>
<author>Suciu</author>
<title>Data on the Web</title>

The following example illustrates a for expression containing more than one variable:

for $i in (10, 20),
    $j in (1, 2)
return ($i + $j)

The result of the above expression, expressed as a sequence of numbers, is as follows: 11, 12, 21, 22

The scope of a variable bound in a for expression comprises all subexpressions of the for expression that appear after the variable binding. The scope does not include the expression to which the variable is bound. The following example illustrates how a variable binding may reference another variable bound earlier in the same for expression:

for $x in input(), $y in f($x)
return g($x, $y)

Note that the focus for evaluation of the return clause of a for expression is the same as the focus for evaluation of the for expression itself. The following example, which attempts to find the total value of a set of order-items, is therefore incorrect:

sum(for $i in order-item return @price * @qty)

Instead, the expression must be written to use the variable bound in the for clause:

sum(for $i in order-item
    return $i/@price * $i/@qty)

3.8 Conditional Expressions

XPath supports a conditional expression based on the keywords if, then, and else.

Conditional Expression
[21]    IfExpr    ::=    "if" "(" Expr ")" "then" Expr "else" ExprSingle

The expression following the if keyword is called the test expression, and the expressions following the then and else keywords are called the then-expression and else-expression, respectively.

The first step in processing a conditional expression is to find the effective boolean value of the test expression, as defined in 2.4.4.2 Effective Boolean Value.

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 then-expression is returned. If the effective boolean value of the test expression is false, the value of the else-expression is returned.

Conditional expressions have a special rule for propagating dynamic errors. If the effective value of the test expression is true, the conditional expression ignores (does not raise) any dynamic errors encountered in the else-expression. In this case, since the else-expression can have no observable effect, it need not be evaluated. Similarly, if the effective value of the test expression is false, the conditional expression ignores any dynamic errors encountered in the then-expression, and the then-expression need not be evaluated.

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
    

3.9 Quantified Expressions

Quantified expressions support existential and universal quantification. The value of a quantified expression is always true or false.

[20]    QuantifiedExpr    ::=    ("some" "$" | "every" "$") VarName "in" ExprSingle ("," "$" VarName "in" ExprSingle)* "satisfies" ExprSingle

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. 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.4.4.2 Effective Boolean Value. The value of the quantified expression is defined by the following rules:

  1. 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.

  2. 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 scope of a variable bound in a quantified expression comprises all subexpressions of the quantified expression that appear after the variable binding. The scope does not include the expression to which the variable is bound.

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 raise a dynamic error as soon as it finds one binding tuple for which the test expression raises 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 raise a dynamic error as soon as it finds one binding tuple for which the test expression raises 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 either return true or raise a type error, since its test expression returns true for one variable binding and raises a type error for another:

    some $x in (1, 2, "cat") satisfies $x * 2 = 4
    
  • This quantified expression may either return false or raise a type error, since its test expression returns false for one variable binding and raises a type error for another:

    every $x in (1, 2, "cat") satisfies $x * 2 = 4
    

3.10 Expressions on SequenceTypes

SequenceTypes are used in instance of, cast, castable, and treat expressions.

3.10.1 Instance Of

[24]    InstanceofExpr    ::=    TreatExpr ( "instance" "of" SequenceType )?

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. For example:

  • 5 instance of xs:integer

    This example returns true because the given value is an instance of the given type.

  • 5 instance of xs:decimal

    This example returns true because the given value is an integer literal, and xs:integer is derived by restriction from xs:decimal.

  • . instance of element()

    This example returns true if the context item is an element node.

3.10.2 Cast

[27]    CastExpr    ::=    ComparisonExpr ( "cast" "as" SingleType )?
[60]    SingleType    ::=    AtomicType "?"?

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 target type. The type of the input expression is called the input type. The target type must be a named atomic type, represented by a QName, optionally followed by the occurrence indicator ? if an empty sequence is permitted. If the target type has no namespace prefix, it is considered to be in the default element namespace. The semantics of the cast expression are as follows:

  1. Atomization is performed on the input expression.

  2. If the result of atomization is a sequence of more than one atomic value, a type error is raised.

  3. If the result of atomization is an empty sequence:

    1. If ? is specified after the target type, the result of the cast expression is an empty sequence.

    2. If ? is not specified after the target type, a type error is raised.

  4. If the result of atomization is a single atomic value, the result of the cast expression depends on the input type and the target type. In general, the cast expression attempts to create a new value of the target type based on the input value. Only certain combinations of input type and target type are supported. The rules are listed below. For the purpose of these rules, we use the terms subtype and supertype in the following sense: if type B is derived from type A by restriction, then B is a subtype of A, and A is a supertype of B.

    1. 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 built-in schema types. For example, a value of type xs:string can be cast into the type xs:decimal. For each of these built-in combinations, the semantics of casting are specified in [XQuery 1.0 and XPath 2.0 Functions and Operators].

    2. cast is supported if the input type is a derived atomic type and the target type is a supertype of the input type. In this case, the input value is mapped into the value space of the target type, unchanged except for its type. For example, if shoesize is derived by restriction from xs:integer, a value of type shoesize can be cast into the type xs:integer.

    3. cast is supported if the target type is a derived atomic type and the input type is xs:string or xdt:untypedAtomic. The input value is first converted to a value in the lexical space of the target type by applying the whitespace normalization rules for the target type; a dynamic error is raised if the resulting lexical value does not satisfy the pattern facet of the target type. The lexical value is then converted to the value space of the target type using the schema-defined rules for the target type; a dynamic error is raised if the resulting value does not satisfy all the facets of the target type.

    4. cast is supported if the target type is a derived atomic type and the input type is a supertype of the target type. The input value must satisfy all the facets of the target type (in the case of the pattern facet, this is checked by generating a string representation of the input value, using the rules for casting to xs:string). The resulting value is the same as the input value, but with a different dynamic type.

    5. If a primitive type P1 can be cast into a primitive type P2, then any subtype of P1 can be cast into any subtype of P2, provided that the facets of the target type are satisfied. First the input value is cast to P1 using rule (b) above. Next, the value of type P1 is cast to the type P2, using rule (a) above. Finally, the value of type P2 is cast to the target type, using rule (d) above.

    6. For any combination of input type and target type that is not in the above list, a cast expression raises a type error.

If casting from the input type to the target type is supported but nevertheless it is not possible to cast the input value into the value space of the target type, a dynamic error is raised. This includes the case when any facet of the target type is not satisfied. For example, the expression "2003-02-31" cast as xs:date would raise a dynamic error.

3.10.3 Castable

[26]    CastableExpr    ::=    CastExpr ( "castable" "as" SingleType )?

XPath provides a form of Boolean expression that tests whether a given value is castable into a given target type. The expression V castable as T returns true if the value V can be successfully cast into the target type T by using a cast expression; otherwise it returns false. The castable predicate can be used to avoid errors at evaluation time. It can also be used to select an appropriate type for processing of a given value, as illustrated in the following example:

if ($x castable as hatsize)
then $x cast as hatsize
else if ($x castable as IQ)
then $x cast as IQ
else $x cast as xs:string

3.10.4 Constructor Functions

Constructor functions provide an alternative syntax for casting.

For every built-in atomic type T that is defined in [XML Schema], as well as the predefined types xdt:dayTimeDuration, xdt:yearMonthDuration, and xdt:untypedAtomic, a built-in constructor function is provided. The signature of the built-in constructor function for type T is as follows:

T($x as item) as T

The constructor function for type T accepts any single item (either a node or an atomic value) as input, and returns a value of type T (or raises a dynamic error). Its semantics are exactly the same as a cast expression with target type T. The built-in constructor functions are described in more detail in [XQuery 1.0 and XPath 2.0 Functions and Operators]. The following are examples of built-in constructor functions:

  • This example is equivalent to "2000-01-01" cast as xs:date.

    xs:date("2000-01-01")
    
  • This example is equivalent to ($floatvalue * 0.2E-5) cast as xs:decimal.

    xs:decimal($floatvalue * 0.2E-5)
    
  • This example returns a dayTimeDuration value equal to 21 days. It is equivalent to "P21D" cast as xdt:dayTimeDuration.

    xdt:dayTimeDuration("P21D")
    

For each user-defined top-level atomic type T in the in-scope type definitions, a constructor function is effectively defined. Like the built-in constructor functions, the constructor functions for user-defined types have the same name (including namespace or lack of namespace) as the type, accept any item as input, and have semantics identical to a cast expression with the user-defined type as target type. For example, if usa:zipcode is a user-defined top-level atomic type in the in-scope type definitions, then the expression usa:zipcode("12345") is equivalent to the expression "12345" cast as usa:zipcode.

If the argument to any constructor function is a literal value, the result of the function may be computed statically, and an error encountered in this process may be reported as a static error.

3.10.5 Treat

[25]    TreatExpr    ::=    CastableExpr ( "treat" "as" SequenceType )?

XPath provides an expression called treat that can be used to modify the static type of its operand.

Like cast, the treat expression takes two operands: an expression and a SequenceType. Unlike cast, however, treat does not change the dynamic type or value of its operand. Instead, the purpose of treat is to ensure that an expression has an expected type at evaluation time.

The semantics of expr1 treat as type1 are as follows:

  • During static analysis (if the Static Typing Feature is implemented):

    type1 must be derived by restriction from the static type of expr1--otherwise, a type 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 expr1 matches type1, using the SequenceType Matching rules in 2.4.3 SequenceType, the treat expression returns the value of expr1; otherwise, it raises a dynamic error. If the value of expr1 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:

    $myaddress treat as element(*, USAddress)
    

    The static type of $myaddress may be element(*, Address), a less specific type than element(*, USAddress). However, at run-time, the value of $myaddress must match the type element(*, USAddress) using SequenceType Matching rules; otherwise a dynamic error is raised.

A XPath Grammar

A.1 EBNF

The following grammar uses the same Basic Extended Backus-Naur Form (EBNF) notation as [XML], except that grammar symbols always have initial capital letters. The notation "< ... >" is used to indicate a grouping of terminals that together may help disambiguate the individual symbols. To help readability, this "< ... >" notation is absent in the EBNF in the main body of this document.

Comments on grammar productions are between '/*' and '*/' symbols. A 'pn:' prefix means a 'Parser Note', and are meant as clarifications for parsing rules, and are explained in A.1.1 Parsing Notes. A 'ws:' prefix explains the whitespace rules for the production, the details of which are explained in A.2.1 Whitespace Rules

Note:

The Semicolon character is reserved for future use.

Named Terminals
[1]    ExprComment    ::=    "(:" (ExprCommentContent | ExprComment)* ":)" /* pn: parens */
[2]    ExprCommentContent    ::=    Char
[3]    IntegerLiteral    ::=    Digits
[4]    DecimalLiteral    ::=    ("." Digits) | (Digits "." [0-9]*) /* ws: explicit */
[5]    DoubleLiteral    ::=    (("." Digits) | (Digits ("." [0-9]*)?)) ("e" | "E") ("+" | "-")? Digits /* ws: explicit */
[6]    StringLiteral    ::=    ('"' (('"' '"') | [^"])* '"') | ("'" (("'" "'") | [^'])* "'") /* ws: significant */
[7]    SchemaGlobalTypeName    ::=    "type" "(" QName ")"
[8]    SchemaGlobalContext    ::=    QName | SchemaGlobalTypeName
[9]    SchemaContextStep    ::=    QName
[10]    Digits    ::=    [0-9]+
[11]    NCName    ::=    [http://www.w3.org/TR/REC-xml-names/#NT-NCName]
[12]    VarName    ::=    QName
[13]    QName    ::=    [http://www.w3.org/TR/REC-xml-names/#NT-QName]
[14]    Char    ::=    [http://www.w3.org/TR/REC-xml#NT-Char]
Non-Terminals
[15]    XPath    ::=    Expr?
[16]    Expr    ::=    ExprSingle ("," ExprSingle)*
[17]    ExprSingle    ::=    ForExpr
| QuantifiedExpr
| IfExpr
| OrExpr
[18]    ForExpr    ::=    SimpleForClause "return" ExprSingle
[19]    SimpleForClause    ::=    <"for" "$"> VarName "in" ExprSingle ("," "$" VarName "in" ExprSingle)*
[20]    QuantifiedExpr    ::=    (<"some" "$"> | <"every" "$">) VarName "in" ExprSingle ("," "$" VarName "in" ExprSingle)* "satisfies" ExprSingle
[21]    IfExpr    ::=    <"if" "("> Expr ")" "then" Expr "else" ExprSingle
[22]    OrExpr    ::=    AndExpr ( "or" AndExpr )*
[23]    AndExpr    ::=    InstanceofExpr ( "and" InstanceofExpr )*
[24]    InstanceofExpr    ::=    TreatExpr ( <"instance" "of"> SequenceType )?
[25]    TreatExpr    ::=    CastableExpr ( <"treat" "as"> SequenceType )?
[26]    CastableExpr    ::=    CastExpr ( <"castable" "as"> SingleType )?
[27]    CastExpr    ::=    ComparisonExpr ( <"cast" "as"> SingleType )?
[28]    ComparisonExpr    ::=    RangeExpr ( (ValueComp
| GeneralComp
| NodeComp
| OrderComp) RangeExpr )?
[29]    RangeExpr    ::=    AdditiveExpr ( "to" AdditiveExpr )?
[30]    AdditiveExpr    ::=    MultiplicativeExpr ( ("+" | "-") MultiplicativeExpr )*
[31]    MultiplicativeExpr    ::=    UnaryExpr ( ("*" | "div" | "idiv" | "mod") UnaryExpr )*
[32]    UnaryExpr    ::=    ("-" | "+")* UnionExpr
[33]    UnionExpr    ::=    IntersectExceptExpr ( ("union" | "|") IntersectExceptExpr )*
[34]    IntersectExceptExpr    ::=    ValueExpr ( ("intersect" | "except") ValueExpr )*
[35]    ValueExpr    ::=    PathExpr
[36]    PathExpr    ::=    ("/" RelativePathExpr?)
| ("//" RelativePathExpr)
| RelativePathExpr
[37]    RelativePathExpr    ::=    StepExpr (("/" | "//") StepExpr)*
[38]    StepExpr    ::=    AxisStep | FilterStep
[39]    AxisStep    ::=    (ForwardStep | ReverseStep) Predicates
[40]    FilterStep    ::=    PrimaryExpr Predicates
[41]    PrimaryExpr    ::=    Literal | FunctionCall | ("$" VarName) | ParenthesizedExpr
[42]    Predicates    ::=    ("[" Expr "]")*
[43]    GeneralComp    ::=    "=" | "!=" | "<" | "<=" | ">" | ">="
[44]    ValueComp    ::=    "eq" | "ne" | "lt" | "le" | "gt" | "ge"
[45]    NodeComp    ::=    "is" | "isnot"
[46]    OrderComp    ::=    "<<" | ">>"
[47]    ForwardStep    ::=    (ForwardAxis NodeTest) | AbbreviatedForwardStep
[48]    ReverseStep    ::=    (ReverseAxis NodeTest) | AbbreviatedReverseStep
[49]    AbbreviatedForwardStep    ::=    "." | ("@" NameTest) | NodeTest
[50]    AbbreviatedReverseStep    ::=    ".."
[51]    ForwardAxis    ::=    <"child" "::">
| <"descendant" "::">
| <"attribute" "::">
| <"self" "::">
| <"descendant-or-self" "::">
| <"following-sibling" "::">
| <"following" "::">
| <"namespace" "::">
[52]    ReverseAxis    ::=    <"parent" "::">
| <"ancestor" "::">
| <"preceding-sibling" "::">
| <"preceding" "::">
| <"ancestor-or-self" "::">
[53]    NodeTest    ::=    KindTest | NameTest
[54]    NameTest    ::=    QName | Wildcard
[55]    Wildcard    ::=    "*"
| <NCName ":" "*">
| <"*" ":" NCName>
/* ws: explicit */
[56]    Literal    ::=    NumericLiteral | StringLiteral
[57]    NumericLiteral    ::=    IntegerLiteral | DecimalLiteral | DoubleLiteral
[58]    ParenthesizedExpr    ::=    "(" Expr? ")"
[59]    FunctionCall    ::=    <QName "("> (ExprSingle ("," ExprSingle)*)? ")"
[60]    SingleType    ::=    AtomicType "?"?
[61]    SequenceType    ::=    (ItemType OccurrenceIndicator?)
| <"empty" "(" ")">
[62]    AtomicType    ::=    QName
[63]    ItemType    ::=    AtomicType | KindTest | <"item" "(" ")">
[64]    KindTest    ::=    DocumentTest
| ElementTest
| AttributeTest
| ProcessingInstructionTest
| CommentTest
| TextTest
| AnyKindTest
[65]    ElementTest    ::=    <"element" "("> ((SchemaContextPath LocalName)
| (NodeName ("," TypeName "nillable"?)?))? ")"
[66]    AttributeTest    ::=    <"attribute" "("> ((SchemaContextPath "@" LocalName)
| ("@" NodeName ("," TypeName)?))? ")"
[67]    ProcessingInstructionTest    ::=    <"processing-instruction" "("> StringLiteral? ")"
[68]    DocumentTest    ::=    <"document-node" "("> ElementTest? ")"
[69]    CommentTest    ::=    <"comment" "("> ")"
[70]    TextTest    ::=    <"text" "("> ")"
[71]    AnyKindTest    ::=    <"node" "("> ")"
[72]    SchemaContextPath    ::=    <SchemaGlobalContext "/"> <SchemaContextStep "/">*
[73]    LocalName    ::=    QName
[74]    NodeName    ::=    QName | "*"
[75]    TypeName    ::=    QName | "*"
[76]    OccurrenceIndicator    ::=    "?" | "*" | "+"

A.1.1 Parsing Notes

  1. A look-ahead of one character is required to distinguish function patterns from a QName followed by a comment. For example:address (: this may be empty :) may be mistaken for a call to a function named "address" unless this lookahead is employed.

  2. Token disambiguation of the overloaded "<" pattern is defined in terms of positional lexical states. The "<" comparison operator can not occur in the same places as a "<" tag open pattern. The "<" comparison operator can only occur in the OPERATOR state, and the "<" tag open pattern can only occur in the DEFAULT state. (These states are only a specification tool, and do not imply an implementation strategy for this same effect.)

A.2 Lexical structure

Legal characters are those allowed in the [XML] recommendation.

When patterns are simple string matches, the strings are embedded directly into the EBNF. In other cases, named terminals are used.

It is up to an implementation to decide on the exact tokenization strategy, which may be different depending on the parser construction. In the EBNF, the notation "< ... >" is used to indicate a grouping of terminals that together may help disambiguate the individual symbols.

This document uses lexical states to assist with terminal symbol recognition. The states specify lexical constraints and transitions based on grammatical positioning. The rules for calculating these states are given in the A.2.2 Lexical Rules section. The specification of these states in this document does not imply any tokenization strategy on the part of implementations.

When tokenizing, the longest possible match that is valid in the current lexical state is prefered .

All keywords are case sensitive.

A.2.1 Whitespace Rules

For readability, Whitespace may be used in most expressions even though not explicitly notated in the EBNF. Whitespace may be freely added between terminals, except a few cases where whitespace is needed to disambiguate the token. For instance, 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, e.g. by using whitespace or parentheses.

Special whitespace notation is specified with the EBNF productions, when it is different from the default rules, as follows.

Whitespace: explicit

"ws: explicit" means that the EBNF notation must explicitly notate where whitespace is allowed, otherwise whitespace may not be freely used.

Whitespace: significant

"ws: significant" means that whitespace is significant as value content.

A.2.2 Lexical Rules

Editorial note  
The role of these states as normative parts of the specification is being investigated. One proposal suggests that only of subset of these states need be normative.

The lexical contexts and transitions between lexical contexts is described in terms of a series of states and transitions between those states.

The tables below define the complete lexical rules for XPath. Each table corresponds to a lexical state in which the tokens listed are recognized only in that state. When a given token is recognized in the given state, the transition to the next state is given. In some cases, a transition will "push" the current state or a specific state onto an abstract stack, and will later restore that state by a "pop" when another lexical event occurs.

The lexical states have in many cases close connection to the parser productions. However, just because a token is recognized in a certain lexical state, does not mean it will be legal in the parser state.

The DEFAULT State

This state is for patterns that occur at the beginning of an expression or subexpression.

Pattern Transition To State
DecimalLiteral, "..", ".", DoubleLiteral, IntegerLiteral, <NCName ":" "*">, "]", ")", <"*" ":" NCName>, "*", StringLiteral
OPERATOR
"$", <"for" "$">, <"some" "$">, <"every" "$">
VARNAME
<"element" "(">, <"attribute" "(">, <"comment" "(">, <"text" "(">, <"node" "(">, <"processing-instruction" "(">, <"document-node" "(">
KINDTEST
pushState(OPERATOR)
OfType
QNAME
Rbrace
popState()
"(:"
EXPR_COMMENT
pushState()
LbraceExprEnclosure, "@", <"ancestor-or-self" "::">, <"ancestor" "::">, <"attribute" "::">, <"child" "::">, <"descendant-or-self" "::">, <"descendant" "::">, <"following-sibling" "::">, <"following" "::">, <"namespace" "::">, <"parent" "::">, <"preceding-sibling" "::">, <"preceding" "::">, <"self" "::">, ",", <"if" "(">, "[", "(", "-", "+", QMark, <QName "(">, "//", "/"
(maintain state)


The OPERATOR State

This state is for patterns that are defined for operators.

Pattern Transition To State
"and", ",", "div", "else", "=", "except", "eq", "ge", "gt", "le", "lt", "ne", ">=", ">>", ">", "idiv", Global, "intersect", "in", "isnot", "is", "[", "(", "<=", "<<", "<", "-", "mod", "*", "!=", "or", "+", QMark, "return", "satisfies", "//", "/", "then", "to", "union", "|", LbraceExprEnclosure
DEFAULT
<"instance" "of">, <"castable" "as">, <"cast" "as">, <"treat" "as">, InContext
ITEMTYPE
OfType
QNAME
Rbrace
popState()
"$", <"for" "$">, <"some" "$">, <"every" "$">
VARNAME
"(:"
EXPR_COMMENT
pushState()
"]", IntegerLiteral, DecimalLiteral, DoubleLiteral, ")", StringLiteral, <NCName ":" "*">, <"*" ":" NCName>, ".", ".."
(maintain state)


The QNAME State

When a qualified name is expected, and it is required to remove ambiguity from patterns that look like functions, this state is used.

Pattern Transition To State
<NCName ":" "*">, <"*" ":" NCName>, ".", ".."
OPERATOR
"(:"
EXPR_COMMENT
pushState()


The ITEMTYPE State

This state distinguishes tokens that can occur only inside the ItemType production.

Pattern Transition To State
"$"
VARNAME
<"empty" "(" ")">
OPERATOR
"(:"
EXPR_COMMENT
pushState()
<"element" "(">, <"attribute" "(">, <"comment" "(">, <"text" "(">, <"node" "(">, <"processing-instruction" "(">, <"document-node" "(">
KINDTEST
pushState(OCCURRENCEINDICATOR)
QName, <"item" "(" ")">
OCCURRENCEINDICATOR


The KINDTEST State
Pattern Transition To State
LbraceExprEnclosure
DEFAULT
<SchemaGlobalContext "/">, SchemaGlobalTypeName
SCHEMACONTEXTSTEP
")"
popState()
"*", QName
CLOSEKINDTEST
"@", InContextForKindTest, Global, StringLiteral
(maintain state)


The CLOSEKINDTEST State
Pattern Transition To State
")"
popState()
","
KINDTEST
LbraceExprEnclosure
DEFAULT
"nillable"
(maintain state)


The OCCURRENCEINDICATOR State
Pattern Transition To State
NotOccurrenceIndicator
OPERATOR
input_stream.backup(1)
"?", "*", "+"
OPERATOR


The SCHEMACONTEXTSTEP State

This state distinguishes the SchemaContextStep from the SchemaGlobalContext.

Pattern Transition To State
<SchemaContextStep "/">, "@"
(maintain state)
LbraceExprEnclosure
DEFAULT
QName
CLOSEKINDTEST


The VARNAME State

This state differentiates variable names from qualified names. This allows only the pattern of a QName to be recognized when otherwise ambiguities could occur.

Pattern Transition To State
VarName
OPERATOR
"(:"
EXPR_COMMENT
pushState()


The EXPR_COMMENT State

The "(:" token marks the beginning of an expression Comment, and the ":)" token marks the end. This allows no special interpretation of other characters in this state.

Pattern Transition To State
":)"
popState()
"(:"
EXPR_COMMENT
pushState()
ExprCommentContent
(maintain state)


A.3 Reserved Function Names

The following is a list of names that may not be used as user function names, in an unprefixed form.

  • if

  • typeswitch

  • node

  • comment

  • text

  • processing-instruction

A.4 Precedence Order

In all cases the grammar defines built-in precedence. In the cases where a number of statements are a choice at the same production level, the expressions are always evaluated from left to right.

B Type Promotion and Operator Mapping

B.1 Type Promotion

Under certain circumstances, an atomic value can be promoted from one type to another. Type promotion is used in function calls (see 3.1.4 Function Calls) and in processing of operators that accept numeric operands (listed in the tables below). The following type promotions are permitted:

  1. A value of type xs:float (or any type derived by restriction from xs:float) can be promoted to the type xs:double. The result is the xs:double value that is the same as the original value. This kind of promotion may cause loss of precision.

  2. A value of type xs:decimal (or any type derived by restriction from xs:decimal) can be promoted to either of the types xs:float or xs:double. The result is the value of the target type that is closest to the original value.

Note that promotion is different from subtype substitution. For example:

  • A function that expects a parameter $p of type xs:float can be invoked with a value of type xs:decimal. This is an example of promotion. The value is actually converted to the expected type. Within the body of the function, $p instance of xs:decimal returns false.

  • A function that expects a parameter $p of type xs:decimal can be invoked with a value of type xs:integer. This is an example of subtype substitution. The value retains its original type. Within the body of the function, $p instance of xs:integer returns true.

B.2 Operator Mapping

The tables in this section list the combinations of types for which the various operators of XPath are defined. For each valid combination of types, the table indicates the function(s) that are used to implement the operator and the type 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.

Operators listed in the tables may be validly applied to operands whose types are derived by restriction from the listed operand types. For example, a table entry indicates that the gt operator may be applied to two xs:date operands, returning xs:boolean. Therefore, the gt operator may also be applied to two (possibly different) subtypes of xs:date, also returning xs:boolean.

In the operator tables, the term numeric refers to the types xs:integer, xs:decimal, xs:float, and xs:double. An operator whose operands and result are designated as numeric might be thought of as representing four operators, one for each of the numeric types. For example, the numeric + operator might be thought of as representing the following four operators:

Operator First operand type Second operand type Result type
+ xs:integer xs:integer xs:integer
+ xs:decimal xs:decimal xs:decimal
+ xs:float xs:float xs:float
+ xs:double xs:double xs:double

A numeric operator accepts operands of the four numeric types and any type that is derived by restriction from one of the four numeric types. If the result type of an operator is listed as numeric, it means "the first numeric type, in promotion order, into which all operands can be converted by subtype substitution and promotion." As an example, suppose that the type hatsize is derived from xs:integer and the type shoesize is derived from xs:float. Then if the + operator is invoked with operands of type hatsize and shoesize, it returns a result of type xs:float. Similarly, if + is invoked with two operands of type hatsize it returns a result of type xs:integer.

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.)

Binary Operators
Operator Type(A) Type(B) Function Result type
A + B numeric numeric op:numeric-add(A, B) numeric
A + B xs:date xdt:yearMonthDuration op:add-yearMonthDuration-to-date(A, B) xs:date
A + B xdt:yearMonthDuration xs:date op:add-yearMonthDuration-to-date(B, A) xs:date
A + B xs:date xdt:dayTimeDuration op:add-dayTimeDuration-to-date(A, B) xs:date
A + B xdt:dayTimeDuration xs:date op:add-dayTimeDuration-to-date(B, A) xs:date
A + B xs:time xdt:dayTimeDuration op:add-dayTimeDuration-to-time(A, B) xs:time
A + B xdt:dayTimeDuration xs:time op:add-dayTimeDuration-to-time(B, A) xs:time
A + B xs:datetime xdt:yearMonthDuration op:add-yearMonthDuration-to-dateTime(A, B) xs:dateTime
A + B xdt:yearMonthDuration xs:datetime op:add-yearMonthDuration-to-dateTime(B, A) xs:dateTime
A + B xs:datetime xdt:dayTimeDuration op:add-dayTimeDuration-to-dateTime(A, B) xs:dateTime
A + B xdt:dayTimeDuration xs:datetime op:add-dayTimeDuration-to-dateTime(B, A) xs:dateTime
A + B xdt:yearMonthDuration xdt:yearMonthDuration op:add-yearMonthDurations(A, B) xdt:yearMonthDuration
A + B xdt:dayTimeDuration xdt:dayTimeDuration op:add-dayTimeDurations(A, B) xdt:dayTimeDuration
A - B numeric numeric op:numeric-subtract(A, B) numeric
A - B xs:date xs:date op:subtract-dates(A, B) xdt:dayTimeDuration
A - B xs:date xdt:yearMonthDuration op:subtract-yearMonthDuration-from-date(A, B) xs:date
A - B xs:date xdt:dayTimeDuration op:subtract-dayTimeDuration-from-date(A, B) xs:date
A - B xs:time xs:time op:subtract-times(A, B) xdt:dayTimeDuration
A - B xs:time xdt:dayTimeDuration op:subtract-dayTimeDuration-from-time(A, B) xs:time
A - B xs:datetime xs:datetime fn:subtract-dateTimes-yielding-dayTimeDuration(A, B) xdt:dayTimeDuration
A - B xs:datetime xdt:yearMonthDuration op:subtract-yearMonthDuration-from-dateTime(A, B) xs:dateTime
A - B xs:datetime xdt:dayTimeDuration op:subtract-dayTimeDuration-from-dateTime(A, B) xs:dateTime
A - B xdt:yearMonthDuration xdt:yearMonthDuration op:subtract-yearMonthDurations(A, B) xdt:yearMonthDuration
A - B xdt:dayTimeDuration xdt:dayTimeDuration op:subtract-dayTimeDurations(A, B) xdt:dayTimeDuration
A * B numeric numeric op:numeric-multiply(A, B) numeric
A * B xdt:yearMonthDuration xs:decimal op:multiply-yearMonthDuration(A, B) xdt:yearMonthDuration
A * B xs:decimal xdt:yearMonthDuration op:multiply-yearMonthDuration(B, A) xdt:yearMonthDuration
A * B xdt:dayTimeDuration xs:decimal op:multiply-dayTimeDuration(A, B) xdt:dayTimeDuration
A * B xs:decimal xdt:dayTimeDuration op:multiply-dayTimeDuration(B, A) xdt:dayTimeDuration
A idiv B xs:integer xs:integer op:integer-div(A, B) xs:integer
A div B numeric numeric op:numeric-divide(A, B) numeric; but xs:decimal if both operands are xs:integer
A div B xdt:yearMonthDuration xs:decimal op:divide-yearMonthDuration(A, B) xdt:yearMonthDuration
A div B xdt:dayTimeDuration xs:decimal op:divide-dayTimeDuration(A, B) xdt: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(fn:compare(A, B), 1) xs:boolean
A eq B xs:date xs:date op:date-equal(A, B) xs:boolean
A eq B xs:time xs:time op:time-equal(A, B) xs:boolean
A eq B xs:dateTime xs:dateTime op:datetime-equal(A, B) xs:boolean
A eq B xdt:yearMonthDuration xdt:yearMonthDuration op:yearMonthDuration-equal(A, B) xs:boolean
A eq B xdt:dayTimeDuration xdt:dayTimeDuration op:dayTimeDuration-equal(A, B) xs:boolean
A eq B Gregorian Gregorian op:gYear-equal(A, B) etc. 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 fn:not(op:numeric-equal(A, B)) xs:boolean
A ne B xs:boolean xs:boolean fn:not(op:boolean-equal(A, B)) xs:boolean
A ne B xs:string xs:string fn:not(op:numeric-equal(fn:compare(A, B), 1)) xs:boolean
A ne B xs:date xs:date fn:not(op:date-equal(A, B)) xs:boolean
A ne B xs:time xs:time fn:not(op:time-equal(A, B)) xs:boolean
A ne B xs:dateTime xs:dateTime fn:not(op:datetime-equal(A, B)) xs:boolean
A ne B xdt:yearMonthDuration xdt:yearMonthDuration fn:not(op:yearMonthDuration-equal(A, B)) xs:boolean
A ne B xdt:dayTimeDuration xdt:dayTimeDuration fn:not(op:dayTimeDuration-equal(A, B) xs:boolean
A ne B Gregorian Gregorian fn:not(op:gYear-equal(A, B)) etc. xs:boolean
A ne B xs:hexBinary xs:hexBinary fn:not(op:hex-binary-equal(A, B)) xs:boolean
A ne B xs:base64Binary xs:base64Binary fn:not(op:base64-binary-equal(A, B)) xs:boolean
A ne B xs:anyURI xs:anyURI fn:not(op:anyURI-equal(A, B)) xs:boolean
A ne B xs:QName xs:QName fn: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(fn:compare(A, B), 0) xs:boolean
A gt B xs:date xs:date op:date-greater-than(A, B) xs:boolean
A gt B xs:time xs:time op:time-greater-than(A, B) xs:boolean
A gt B xs:dateTime xs:dateTime op:datetime-greater-than(A, B) xs:boolean
A gt B xdt:yearMonthDuration xdt:yearMonthDuration op:yearMonthDuration-greater-than(A, B) xs:boolean
A gt B xdt:dayTimeDuration xdt: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-than(A, B) xs:boolean
A lt B xs:string xs:string op:numeric-less-than(fn:compare(A, B), 0) xs:boolean
A lt B xs:date xs:date op:date-less-than(A, B) xs:boolean
A lt B xs:time xs:time op:time-less-than(A, B) xs:boolean
A lt B xs:dateTime xs:dateTime op:datetime-less-than(A, B) xs:boolean
A lt B xdt:yearMonthDuration xdt:yearMonthDuration op:yearMonthDuration-less-than(A, B) xs:boolean
A lt B xdt:dayTimeDuration xdt:dayTimeDuration op:dayTimeDuration-less-than(A, B) xs:boolean
A ge B numeric numeric fn:not(op:numeric-less-than(A, B)) xs:boolean
A ge B xs:string xs:string op:numeric-greater-than(fn:compare(A, B), -1) xs:boolean
A ge B xs:date xs:date fn:not(op:date-less-than(A, B)) xs:boolean
A ge B xs:time xs:time fn:not(op:time-less-than(A, B)) xs:boolean
A ge B xs:dateTime xs:dateTime fn:not(op:datetime-less-than(A, B)) xs:boolean
A ge B xdt:yearMonthDuration xdt:yearMonthDuration fn:not(op:yearMonthDuration-less-than(A, B)) xs:boolean
A ge B xdt:dayTimeDuration xdt:dayTimeDuration fn:not(op:dayTimeDuration-less-than(A, B)) xs:boolean
A le B numeric numeric fn:not(op:numeric-greater-than(A, B)) xs:boolean
A le B xs:string xs:string op:numeric-less-than(fn:compare(A, B), 1) xs:boolean
A le B xs:date xs:date fn:not(op:date-greater-than(A, B)) xs:boolean
A le B xs:time xs:time fn:not(op:time-greater-than(A, B)) xs:boolean
A le B xs:dateTime xs:dateTime fn:not(op:datetime-greater-than(A, B)) xs:boolean
A le B xdt:yearMonthDuration xdt:yearMonthDuration fn:not(op:yearMonthDuration-greater-than(A, B)) xs:boolean
A le B xdt:dayTimeDuration xdt:dayTimeDuration fn:not(op:dayTimeDuration-greater-than(A, B)) xs:boolean
A is B node node op:node-equal(A, B) xs:boolean
A isnot B node node fn: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 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:integer xs:integer op:to(A, B) xs:integer+
A , B item* item* op:concatenate(A, B) item*
Unary Operators
Operator Operand type Function Result type
+ A numeric op:numeric-unary-plus(A) numeric
- A numeric op:numeric-unary-minus(A) numeric

C References

C.1 Normative References

XQuery 1.0 and XPath 2.0 Functions and Operators
World Wide Web Consortium. XQuery 1.0 and XPath 2.0 Functions and Operators W3C Working Draft, 15 November 2002. See http://www.w3.org/TR/xpath-functions/
XQuery 1.0 Formal Semantics
World Wide Web Consortium. XQuery 1.0 Formal Semantics. W3C Working Draft, 2 May 2003. See http://www.w3.org/TR/xquery-semantics/.
XML Schema
World Wide Web Consortium. XML Schema, Parts 0, 1, and 2. W3C Recommendation, 2 May 2001. See http://www.w3.org/TR/2001/REC-xmlschema-0-20010502/, http://www.w3.org/TR/2001/REC-xmlschema-1-20010502/, and http://www.w3.org/TR/2001/REC-xmlschema-2-20010502/.
XQuery 1.0 and XPath 2.0 Data Model
World Wide Web Consortium. XQuery 1.0 and XPath 2.0 Data Model. W3C Working Draft, 2 May 2003. See http://www.w3.org/TR/xpath-datamodel/.
XSLT 2.0 and XQuery 1.0 Serialization
World Wide Web Consortium. XSLT 2.0 and XQuery 1.0 Serialization. W3C Working Draft, 2 May 2003. See http://www.w3.org/TR/xslt-xquery-serialization/.
XML
World Wide Web Consortium. Extensible Markup Language (XML) 1.0. W3C Recommendation. See http://www.w3.org/TR/2000/REC-xml-20001006
XML Names
World Wide Web Consortium. Namespaces in XML. W3C Recommendation. See http://www.w3.org/TR/REC-xml-names/
ISO/IEC 10646
ISO (International Organization for Standardization). ISO/IEC 10646-1993 (E). Information technology -- Universal Multiple-Octet Coded Character Set (UCS) -- Part 1: Architecture and Basic Multilingual Plane. [Geneva]: International Organization for Standardization, 1993 (plus amendments AM 1 through AM 7).
ISO/IEC 10646-2000
ISO (International Organization for Standardization). ISO/IEC 10646-1:2000. Information technology -- Universal Multiple-Octet Coded Character Set (UCS) -- Part 1: Architecture and Basic Multilingual Plane. [Geneva]: International Organization for Standardization, 2000.
Unicode
The Unicode Consortium. The Unicode Standard, Version 2.0. Reading, Mass.: Addison-Wesley Developers Press, 1996.
Unicode3
The Unicode Consortium. The Unicode Standard, Version 3.0. Reading, Mass.: Addison-Wesley Developers Press, 2000. ISBN 0-201-61633-5.

C.2 Non-normative References

XPath 2.0 Requirements
World Wide Web Consortium. XPath Requirements Version 2.0. W3C Working Draft 14 February 2001. See http://www.w3.org/TR/xpath20req.
XQueryX 1.0
World Wide Web Consortium. XQueryX, Version 1.0. W3C Working Draft, 7 June 2001. See http://www.w3.org/TR/xqueryx
Editorial note  
As of the date of this publication, XQueryX has not incorporated recent language changes; it will be made consistent with this document in its next edition.
XQuery
World Wide Web Consortium. XQuery 1.0: An XML Query Language. W3C Working Draft, 2 May 2003. See http://www.w3.org/TR/xquery/
XSLT 2.0
World Wide Web Consortium. XSL Transformations (XSLT) 2.0. W3C Working Draft. See http://www.w3.org/TR/xslt20/
ISO 8601
International Organization for Standardization (ISO). Representations of Dates and Times, 2000-08-03. Available from http://www.iso.ch/

C.3 Background References

XQL
J. Robie, J. Lapp, D. Schach. XML Query Language (XQL). See http://www.w3.org/TandS/QL/QL98/pp/xql.html.
XML-QL
Alin Deutsch, Mary Fernandez, Daniela Florescu, Alon Levy, and Dan Suciu. A Query Language for XML. See http://www.research.att.com/~mff/files/final.html
SQL
International Organization for Standardization (ISO). Information Technology-Database Language SQL. Standard No. ISO/IEC 9075:1999. (Available from American National Standards Institute, New York, NY 10036, (212) 642-4900.)
ODMG
Rick Cattell et al. The Object Database Standard: ODMG-93, Release 1.2. Morgan Kaufmann Publishers, San Francisco, 1996.
Lorel
Serge Abiteboul, Dallan Quass, Jason McHugh, Jennifer Widom, and Janet L. Wiener. The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries, 1(1):68-88, April 1997. See "http://www-db.stanford.edu/~widom/pubs.html
YATL
S. Cluet, S. Jacqmin, and J. Simeon. The New YATL: Design and Specifications. Technical Report, INRIA, 1999.
Quilt
Don Chamberlin, Jonathan Robie, and Daniela Florescu. Quilt: an XML Query Language for Heterogeneous Data Sources. In Lecture Notes in Computer Science, Springer-Verlag, Dec. 2000. Also available at http://www.almaden.ibm.com/cs/people/chamberlin/quilt_lncs.pdf. See also http://www.almaden.ibm.com/cs/people/chamberlin/quilt.html.
XPath 1.0
World Wide Web Consortium. XML Path Language (XPath) Version 1.0. W3C Recommendation, Nov. 16, 1999. See http://www.w3.org/TR/xpath.html

C.4 Informative Material

RFC2396
T. Berners-Lee, R. Fielding, and L. Masinter. Uniform Resource Identifiers (URI): Generic Syntax. IETF RFC 2396. See http://www.ietf.org/rfc/rfc2396.txt.
Character Model
World Wide Web Consortium. Character Model for the World Wide Web. W3C Working Draft. See http://www.w3.org/TR/charmod/
XML Infoset
World Wide Web Consortium. XML Information Set. W3C Recommendation 24 October 2001. See http://www.w3.org/TR/xml-infoset/
XPointer
World Wide Web Consortium. XML Pointer Language (XPointer). W3C Last Call Working Draft 8 January 2001. See http://www.w3.org/TR/WD-xptr
XSLT 1.0
World Wide Web Consortium. XSL Transformations (XSLT) 1.0. W3C Recommendation. See http://www.w3.org/TR/xslt

D Glossary

Editorial note  
To be done.

E Conformance

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.

F Backwards Compatibility with XPath 1.0 (Non-Normative)

This section provides a summary of the main areas of incompatibility between XPath 2.0 and [XPath 1.0].

The list given here assumes (a) that the source document is processed in the absence of a schema, and (b) that XPath 1.0 compatibility mode is true.

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.

    This means that if $nodeset is empty, the result will be false regardless of the value of the boolean operand, and regardless of which operator is used. If $nodeset is non-empty, then in the absence of a schema the expression will usually raise a type error, caused by a failure when attempting to cast the untyped value of a node to a boolean. But if a node has the value "0", "1", "true", or "false", evaluation of the expression may succeed.

  • 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 when dividing two integers is now a value of type decimal rather than double. The expression 10 div 0 raises an error rather than returning positive infinity.

  • 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 numbers are converted to strings using the rules for casting to the type xs:string.

  • The rules for converting strings to numbers have changed. A string that cannot be interpreted as a number now 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 a zero-length 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 a zero-length string, as it did in XPath 1.0

  • 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, 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 XPath 1.0, it was defined that with an expression of the form A and B, B would not be evaluated if A was false. Similarly in the case of A or B, B would not be evaluated if A was true. This is no longer guaranteed with XPath 2.0: the implementation is free to evaluate the two operands in either order or in parallel. This change has been made to give more scope for optimization in situations where XPath expressions are evaluated against large data collections supported by indexes.

  • In XPath 1.0, the expression (4 = true()) is evaluated by converting the number 4 to boolean (yielding true). The expression returns true. In XPath 2.0, running in compatibility mode, the same expression is evaluated by converting both operands to double (yielding 4e0 = 1e0). The expression returns false.

  • Consecutive comparison operators such as A < B < C were supported in XPath 1.0, but are not supported in XPath 2.0.

  • Constructs such as @text(), @comment(), and @processing-instruction() were legal in XPath 1.0 (they returned an empty sequence) but have become illegal according the the XPath 2.0 grammar.

  • The namespace axis is deprecated in XPath 2.0. Implementations may support the namespace axis for backward compatibility with XPath 1.0, but they are not required to do so.

  • Suppose that the context node is an element node derived from the following markup: <background color="red green blue">. In XPath 1.0, the predicate [@color="blue"] would return false. In XPath 2.0, if the color attribute is defined in a schema or DTD to be of type NMTOKENS, the same predicate will return true.

  • Backward compatibility issues affecting individual functions in the core function library are described in [XQuery 1.0 and XPath 2.0 Functions and Operators].

G XPath 2.0 and XQuery 1.0 Issues (Non-Normative)

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 Pr Cluster Status Locus Description Responsible
293 1 decided xquery Cdata and CharRef Semantics
444 1 decided formal-semantics Support for mixed content in the type system
96 o-1 (in)equality-operators decided xpath Normalized Equality
328 1 cdata section decided xquery What does CDATA section constructor construct?
257 D 1 collections decided xpath Does collection() always return same result?
546 1 conformance-levels active xpath Are there more processing model options that could make sense as consistent features and thus as conformance levels?
286 1 constructor-expr decided xquery Element Construction vs Streaming
290 1 constructor-expr decided xquery Element Attribute Constructor Name Type
529 1 constructor-expr decided xquery Node identity in the formal semantics
329 1 constructors decided xquery Duplicate attribute constructors
258 D 2 documents decided xpath Identity of Document Nodes
554 1 editorial active xpath What is the really normative text?
553 1 errors active xpath Rules for reporting dynamic errors statically
339 2 errors decided xquery Error type for attributes constructed too late
340 1 errors decided xpath How to identify errors?
317 1 extensions decided xquery XQuery Extension Mechanisms
538 1 extensions decided xquery Can (and should) keyword extensions be allowed in XQuery by equipping them with a namespace prefix?
272 1 external-functions decided xpath External Functions
273 1 external-objects decided xpath External Objects
555 1 formal semantics active formal-semantics Formal Semantics of Module Import
556 1 formal semantics active formal-semantics Formal Semantics of Variable Definitions
557 1 formal semantics active formal-semantics Formal semantics of Validation Declaration
558 1 formal semantics active formal-semantics The content of element types should always allow PI's and comment node types
559 1 formal semantics active formal-semantics New Sequence Type needs to be fully implemented in Formal Semantics
335 1 formal-semantics decided xpath XPath/XQuery's current semantics greatly interferes with optimization
265 2 FTTF-xml:lang decided xpath-fulltext How do we determine the xml:lang for a node if it inherits xml:lang from a higher-level node?
266 2 FTTF-xml:lang decided xpath-fulltext Do we support the sublanguage portion of xml:lang?
124 o-1 functions decided xquery External Functions
157 o-1 functions decided xquery Function Libraries
327 1 functions decided xpath Evaluate unused function parameters?
223 o-1 functions external decided xquery We need a way to declare external functions
458 1 Language active formal-semantics What is in the default context?
499 1 Language active formal-semantics Casting and validation
510 1 Language active formal-semantics Is validate working on sequences?
459 1 Language decided formal-semantics Serialization
492 1 Language decided formal-semantics Derivation by extension in XQuery
493 1 Language decided formal-semantics May the content of a text node be the empty string?
295 1 lexical-representation decided xquery Lexical Representation of Atomic Values
74 o-1 module-semantics decided xquery Module syntax
75 o-1 module-semantics decided xquery Importing Modules
79 o-1 module-syntax decided xquery Encoding
537 1 modules decided xquery What happens to imported schemas that are used in function signatures?
228 o-2 namespace functions decided xpath Should we keep the default function namespace, and the xf: namespace?
319 1 namespaces active xquery Namespace definitions and in-scope namespaces
343 1 namespaces active xpath Do functions in the null namespace clash with functions in the default namespace?
247 2 namespaces decided xpath What does default namespace(s) affect?
549 1 namespaces decided xquery Computed namespace-constructor
452 1 Semantics active formal-semantics Semantics of order by
473 1 Semantics active formal-semantics When to process the query prolog
481 1 Semantics active formal-semantics Semantics of Schema Context
496 1 Semantics active formal-semantics Support for lax and strict wildcards
508 1 Semantics active formal-semantics Namespaces in element constructors
512 1 Semantics active formal-semantics Conformance Levels
437 1 Semantics decided formal-semantics Static type errors and warnings
441 1 Semantics decided formal-semantics Implementation of and conformance levels for static type checking
450 1 Semantics decided formal-semantics Semantics of data()
453 1 Semantics decided formal-semantics Semantics of element and attribute constructors
457 1 Semantics decided formal-semantics Dynamic context for current date and time
461 1 Semantics decided formal-semantics Data model syntax and literal values
478 1 Semantics decided formal-semantics Semantics of special functions
479 1 Semantics decided formal-semantics Non-determinism in the semantics
482 1 Semantics decided formal-semantics Type equivalence rules
484 1 Semantics decided formal-semantics Treatment of nillability and xsi:nil
487 1 Semantics decided formal-semantics Representation of text nodes in formal values
491 1 Semantics decided formal-semantics Validation of an empty string against a string list
503 1 Semantics decided formal-semantics Collations in the static environment
514 1 Semantics decided formal-semantics Raising errors
520 1 Semantics decided formal-semantics Coercion between untyped and atomic values
521 1 Semantics decided formal-semantics Semantics of XPath 1.0 compatibility
525 1 Semantics decided formal-semantics Static context accessible from the dynamic context
528 1 semantics decided xpath Semantics of text constructor on empty sequence
443 1 Semantics? active formal-semantics Namespace resolution
244 2 serialization decided xquery CDATA sections and serialization
155 o-1 sort decided xquery Sorting by Non-exposed Data
243 3 sort decided xpath Provide an example of sorting "disappearing"
251 2 sort decided xquery Sorting "input to loop", not the result
318 1 sort decided xquery Add 'order by' clause to FLWR?
475 1 Static typing active formal-semantics Typing for descendant
455 1 Static typing decided formal-semantics Typing for the typeswitch default clause
472 1 Static typing decided formal-semantics Static typing of union
488 1 Static typing decided formal-semantics Static typing of path expressions in the presence of derivation by extension
509 1 Static typing decided formal-semantics Static typing for validate
513 1 Static typing decided formal-semantics Imprecise static type of constructed elements
547 1 syntax active xquery Use "declare" for declarations
548 1 syntax active xpath Lexical Rules: states normative?
550 1 syntax active xquery Location of Comments
552 1 syntax active xpath Should the quotes in processing-instruction("...") be optional?
144 o-1 syntax decided xquery Escaping Quotes and Apostrophes
246 2 syntax decided xquery Nested XQuery comments allowed?
341 1 syntax decided xpath Problems with SequenceType
532 1 syntax decided xpath Alignment between path expressions and sequence types
535 1 syntax decided xpath Lexical state tables
524 1 type semantics decided xpath Plural datatypes different from Singular *?
523 1 type-semantics active xpath input(), collection(), document(); validation semantics
534 1 type-semantics active formal-semantics Semantics of function calls and notion of "expected type"
542 1 type-semantics active formal-semantics What should be the type of an attribute or element that is well-formed but not validated, or is validated in skip mode?
43 T 1 type-semantics decided xquery Defining Behavior for Well Formed, DTD, and Schema Documents
47 T 2 type-semantics decided xquery Subtype Substitutability
48 T 3 type-semantics decided algebra CASE not a subtype
279 T 1 type-semantics decided xpath Should there be a lightweight cast?
334 T 1 type-semantics decided xpath How are documents for which validation has failed processed?
531 1 type-semantics decided xquery Should discard the type of copied subelement
533 1 type-semantics decided formal-semantics Strict static typing for automatic coercion of untyped atomic to atomic values
541 1 type-semantics decided formal-semantics Should it be a static error if an expression other than () has type empty?
543 1 type-semantics decided xpath How can a path expression match elements in the substitution group of a given element?
544 1 type-semantics decided xpath How can a path expression match nodes of a given type?
56 T 3 type-syntax decided xquery Human-Readable Syntax for Types
307 T 1 types active xpath Schema Types from input documents?
526 1 types active xpath Semantics for anySimpleType and untypedAtomic
536 1 types active xpath Data model to infoset mapping and type information
539 1 types active formal-semantics Semantics of fs:cast-untypedAtomic in backward compatibility mode
540 1 types active formal-semantics How does the static semantics works in the case where the input types are unions?
545 1 types active xpath Are XS element/attribute declarations implicitly added to the schema context?
551 1 types active xpath Constructor functions for unprefixed user defined types
206 T 2 types decided xpath Typing support in XPath
224 T 2 types decided xquery Why do we want to allow optional returns and DataType?
297 T 1 types decided xpath Should XPath have "type binding" in variable?
306 T 1 types decided xpath PSVI to Data Model mapping part of normative text?
308 T 1 types decided xpath Type Soundness
310 T 1 types decided xquery Are the children of a newly constructed element typed?
316 T 1 types decided xpath Is anySimpleType = anySimpleType*?
320 T 1 types decided xquery Should different conformance levels give the same result for the same query and data?
325 T 1 types decided xpath Refering to element that is not in the in-scope schema def.
527 1 types decided formal-semantics Static typing of XPath index expressions
486 1 Typing active formal-semantics Support for PI, comment and namespace nodes
446 1 Typing decided formal-semantics Complexity of interleaving
449 1 Typing decided formal-semantics Constraint on attribute and element content models
501 1 Typing decided formal-semantics Support for XML Schema groups
516 1 Typing decided formal-semantics Typeswitch and type substitutability
519 1 Typing decided formal-semantics Type of document node
321 1 validate decided xquery Is validate strict or lax?
322 1 validate decided xquery "validate" strict/lax override?
530 1 validation decided xquery Default default validation mode
250 2 variables decided xquery Declaring Variables in Prolog
191 o-1 whitespace decided xquery Whitespace handling in element constructors
311 1 whitespace decided xquery Whitespace and Attribute Constructors
338 1 whitespace decided xquery Handling of whitespace and character references
152 o-1 xqueryx active xqueryx XML-based Syntax

43. xquery-define-schema-variants: Defining Behavior for Well Formed, DTD, and Schema Documents

Issue Class: T Locus: xquery Cluster: type-semantics Priority: 1 Status: decided
Originator: Don Chamberlin
Defining Behavior for Well Formed, DTD, and Schema Documents

Description

We should specify the behavior of XQuery for well formed XML, XML validated by a schema, and XML validated by a DTD.

Proposed Resolution

The mapping of a DTD validated or well formed document still needs to be defined in the Data Model.

Actual Resolution

Decision by: xquery on 2003-02-26 ([link to member only information] )

Closing of the directly related issues: [resolved issue #xquery-abstract-syntax] and [resolved issue #xpath-issue-complex-type-value] is sufficient to close this issue.

Decision by: xpath-tf on 2003-03-04 ([link to member only information] )

Decision by: xsl on 2003-03-07 ([link to member only information] )Joint meeting

Decision by: xquery on 2003-03-07 ([link to member only information] )Joint meeting

On recommendation of the Processing Model Taskforce the disposition is reaffirmed.

47. xquery-subtype-substitutability: Subtype Substitutability

Issue Class: T Locus: xquery Cluster: type-semantics Priority: 2 Status: decided
Originator: XQuery Editors
Subtype Substitutability

Description

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.

Interactions and Input

[link to member only information] Michael Rys:

I think this is still an open issue given some semantic issues that we
found between named subtype substitutability and derivation by
extension. I will send mail on this issue this week,

Actual Resolution

Addressed by the "Named Typing" proposal.

Decision by: xpath-tf on 2002-05-07 ([link to member only information] )

Decision by: xquery on 2002-05-22 ([link to member only information] )

Decision by: xsl on 2002-06-27 ([link to member only information] )

Accepting text in 2002-04-30 public draft.

48. xquery-typeswitch-case-not-subtype: CASE not a subtype

Issue Class: T Locus: algebra Cluster: type-semantics Priority: 3 Status: decided
Originator: XML Query
CASE not a subtype

Description

If the types in the CASE branches are not subtypes of the TYPESWITCH, is this an error, or are these branches simply never executed? If the latter, should we require a warning?

Actual Resolution

Decision by: xquery on 2003-02-12 ([link to member only information] )

Issue 48 closed without changes to the document (no static errors will be raised, implementations can but are not required to raise warnings).

Decision by: fs-editors on 2003-02-13 ([link to member only information] )

Decision by: xquery on 2003-02-19 ([link to member only information] )

Decision by: xsl on 2003-02-27 ([link to member only information] )

Accepting proposal in #FS-Issue-0173 closes this issue in a consistent way.

56. xquery-type-syntax: Human-Readable Syntax for Types

Issue Class: T Locus: xquery Cluster: type-syntax Priority: 3 Status: decided
Originator: Algebra Editors
Human-Readable Syntax for Types

Description

The Algebra has a syntax for declaring types. Up to now, XQuery uses XML Schema for declaring types. Is this sufficient? Some important questions:

  1. Are type names sufficient, or does XQuery really need its own syntax for declaring types?
  2. Would Normalized Universal Names (derived from MSL) be sufficient for type names?
  3. How will type names be bound to definitions?

Actual Resolution

Decision by: xquery on 2003-01-15 ([link to member only information] )Joint F2F

Decided:

Are type names sufficient - YES

Would NUNS be sufficient for type name - not needed

How will type names be bound to definitions - with imported schemas and namespaces

74. xquery-module-syntax: Module syntax

Locus: xquery Cluster: module-semantics Priority: o-1 Status: decided
Originator: XQuery Editors
Module syntax

Description

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.

Proposed Resolution

Paulist Modules Proposal

This proposal adds modules, external variables, external functions,
and global variables to XQuery. It addresses the following open
issues:

   74 Module syntax
   75 Importing Modules
124 External Functions
157 Function Libraries
223 We need a way to declare external functions
250 Declaring Variables in Prolog

This proposal is called the Paulist Modules Proposal, because it is
based on a simplification Paul Cotton made to earlier module
proposals, which can be found here:

  Subject: Paul's Proposal (was: Unified proposal on modules, global
           and external variables, and external functions)
  From: Jonathan Robie (jonathan.robie@datadirect-technologies.com)
  Date: Thu, Dec 19 2002
  http://lists.w3.org/Archives/Member/w3c-xml-query-wg/2002Dec/0391.html

Many other people have contributed to this proposal in various
iterations, including Mary Fernandez, Jerome Simeon, Don Chamberlin,
Michael Rys, Phil Wadler, and Michael Kay.


1. Modules and Module Declarations

    An XQuery module is a resource that contains a Query. A module may
    declare a target namespace using a ModuleDecl. The syntax of Query
    and ModuleDecl is as follows:

      Query ::= ModuleDecl? QueryProlog ExprSequence?
      ModuleDecl ::= "module" ModuleURI

    If a module contains a ModuleDecl, its functions may be imported by
    other modules. A module that does not have a ModuleDecl can not be
    imported. A ModuleURI may be relative - if so, it is combined with
    the Base URI to create an absolute URI.

    In a module that is imported by another module, the optional
    ExprSequence must be absent, or a static error is raised.

2. Module Imports

    A query may import modules in the QueryProlog using
    ModuleImports. The syntax of QueryProlog and ModuleImport is as
    follows:

      QueryProlog ::=  (NamespaceDecl
                       | DefaultNamespaceDecl
                       | SchemaImport
                       | ModuleImport
                       | VarDn)*
                       FunctionDn*

      ModuleImport ::= "import" "module" ModuleURI ("at" ImplURI)?

    Functions and global variables defined in a module may be used in
    any module that imports the defining module. Importing a module
    does not provide access to the imported schemas or namespaces of
    that module. Importing a module does not provide access to the
    functions imported by that module.

    An implementation may locate a module in any convenient manner,
    provided the ModuleURI of the module it locates matches the
    ModuleURI of the ModuleImport. The optional ImplURI specifies the
    resource containing the implemenation of the module. It is treated
    like a schema location hint in XML Schema - an implementation may
    ignore it completely.

    Two modules may import each other. For instance, if module A
    imports module B, then module B may import module A.

3. Variable declarations and definitions

    A variable may be declared or defined using a VarDn in the
    QueryProlog. The syntax of VarDn is as follows:

      VarDn ::=  "define" "global"? "external"? "variable" "$" VarName
                    ("as" SequenceType)? (":=" Expr)?

    A variable may have no forward references to functions or
    variables. Functions and variables imported into a module are
    considered prior to a global variable if they are imported before
    the global variable is defined. A variable may not be used before
    it is defined.

    If the "global" keyword is present, then the variable will be
    imported whenever the module that contains it is imported.

    If the "external" keyword is present, the variable is [external];
    if it is absent, the variable is [internal].

    An [external] variable definition must include only the variable's
    name and optional sequence type, or a static error is raised.
    During dynamic evaluation, an [external] variable must be bound to
    a value in the dynamic context, or an error is raised.

    An [internal] variable definition must include the variable's name,
    optional sequence type, and a required expression, or a static
    error is raised.

    It is a type error, if the value of a variable does not match the
    declared sequence type of the variable.


4. External functions

    An external function definition allows XQuery to call functions
    written in other languages. The syntax of a FunctionDefn is as
    follows:

     FunctionDefn ::= <"define" "function"> "external"? <QName "(">
     ParamList? (")" | (<")" "as"> SequenceType)) EnclosedExpr

    If the "external" keyword is present, the function is [external];
    if it is absent, the function is [internal].

    If a function is [internal], its implementation is given as an
    XQuery expression in the module's implementation. If a function is
    [external], its implementation is given by the query environment.
    XQuery does not specify how external functions are implemented or
    accessed, how actual arguments are passed to external functions, or
    how return values are passed to the query environment - all that is
    implementation defined.

Questions in proposal that need resolution:

In today's telcon, we identified three central questions that need to
be resolved for the modules proposal. Once we resolve these questions,
it will be easy to rewrite the Paulist module accordingly.

Question 1: What is the relationship between the ModuleURI and the
namespace of the functions it contains?

Possible answers:

1.A. There is no relationship. A module is identified by a URI, and
may contain functions in any namespace.

1.B. The module URI is the namespace of functions and global variables
defined in that module. It serves as a default namespace for both
functions and global variables, but the prolog can change these
defaults.

1.C. The module URI is the namespace of functions and global variables
exported by the module. A module may contain functions and global
variables defined in other namespaces or in no namespace, but they are
not exported when the module is imported into another module.


2. Should there an optional LocationURI?

2.A. A module has an optional LocationURI, which provides the location
of a resource. This allows the name of a resource to be decoupled from
its location, while allowing relative or absolute locations to be
specified explicitly.

2.B. A module is identified only by the ModuleURI, which may be
relative or absolute. Catalogs or other similar devices are used to
map the ModuleURI onto a location.

There are two variations on 2.B:

2.B.i: The ModuleURI may be relative.
2.B.ii: The ModuleURI must be absolute.

Relative ModuleURIs are not useful if we choose 2.A.

Jonathan

Note: Michael Kay suggested Option A and Option B. They are defined as:

Option A: (C3, L1)
Option B: (C1, L2)

Actual Resolution

Decision by: xquery on 2003-02-26 ([link to member only information] )

Decided to adopt 1B and 2A.

75. xquery-import: Importing Modules

Locus: xquery Cluster: module-semantics Priority: o-1 Status: decided
Originator: XQuery Editors
Importing Modules

Description

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?

Actual Resolution

Decision by: xquery