XPath 1.0

related topics
{math, number, function}
{work, book, publish}
{math, energy, light}
{woman, child, man}
{company, market, business}

XPath (XML Path Language) is a language for selecting nodes from an XML document. In addition, XPath may be used to compute values (strings, numbers, or boolean values) from the content of an XML document. The current version of the language is XPath 2.0, but version 1.0 is still more widely used.

The XPath language is based on a tree representation of the XML document, and provides the ability to navigate around the tree, selecting nodes by a variety of criteria. In popular use (though not in the official specification), an XPath expression is often referred to simply as an XPath.

Originally motivated by a desire to provide a common syntax and behavior model between XPointer and XSLT, subsets of the XPath query language are used in other W3C specifications such as XML Schema and XForms.

Contents

Syntax and semantics

The most important kind of expression in XPath is a location path. A location path consists of a sequence of location steps. Each location step has three components:

An XPath expression is evaluated with respect to a context node. An Axis Specifier such as 'child' or 'descendant' specifies the direction to navigate from the context node. The node test and the predicate are used to filter the nodes specified by the axis specifier: For example the node test 'A' requires that all nodes navigated to must have label 'A'. A predicate can be used to specify that the selected nodes have certain properties, which are specified by XPath expressions themselves.

The XPath syntax comes in two flavours: the abbreviated syntax, is more compact and allows XPaths to be written and read easily using intuitive and, in many cases, familiar characters and constructs. The full syntax is more verbose, but allows for more options to be specified, and is more descriptive if read carefully.

Full article ▸

related documents
Semigroup
Modular arithmetic
Filter (mathematics)
Homological algebra
Countable set
Scope (programming)
Tychonoff's theorem
Exclusive or
Key size
Complex analysis
Ultrafilter
Ordinary differential equation
Partition (number theory)
Absolute convergence
Galois theory
Normed vector space
Natural transformation
Gaussian quadrature
Holomorphic function
Sequence
Elliptic curve
IEEE 754-1985
Ideal class group
Database normalization
J (programming language)
Power series
Objective Caml
Linear combination
Algebraic structure
Natural logarithm