View source with raw comments or as raw
    1/*  Part of SWI-Prolog
    2
    3    Author:        Jan Wielemaker
    4    E-mail:        J.Wielemaker@vu.nl
    5    WWW:           http://www.swi-prolog.org
    6    Copyright (c)  2009-2019, University of Amsterdam
    7                              VU University Amsterdam
    8                              CWI, Amsterdam
    9    All rights reserved.
   10
   11    Redistribution and use in source and binary forms, with or without
   12    modification, are permitted provided that the following conditions
   13    are met:
   14
   15    1. Redistributions of source code must retain the above copyright
   16       notice, this list of conditions and the following disclaimer.
   17
   18    2. Redistributions in binary form must reproduce the above copyright
   19       notice, this list of conditions and the following disclaimer in
   20       the documentation and/or other materials provided with the
   21       distribution.
   22
   23    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   24    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   25    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
   26    FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
   27    COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
   28    INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
   29    BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
   30    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
   31    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   32    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
   33    ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
   34    POSSIBILITY OF SUCH DAMAGE.
   35*/
   36
   37:- module(xpath,
   38          [ xpath/3,                    % +DOM, +Spec, -Value
   39            xpath_chk/3,                % +DOM, +Spec, -Value
   40
   41            op(400, fx, //),
   42            op(400, fx, /),
   43            op(200, fy, @)
   44          ]).   45:- use_module(library(record)).   46:- use_module(library(lists)).   47:- use_module(library(debug)).   48:- use_module(library(error)).   49:- use_module(library(sgml)).

Select nodes in an XML DOM

The library xpath.pl provides predicates to select nodes from an XML DOM tree as produced by library(sgml) based on descriptions inspired by the XPath language.

The predicate xpath/3 selects a sub-structure of the DOM non-deterministically based on an XPath-like specification. Not all selectors of XPath are implemented, but the ability to mix xpath/3 calls with arbitrary Prolog code provides a powerful tool for extracting information from XML parse-trees.

See also
- http://www.w3.org/TR/xpath */
   66:- record
   67    element(name, attributes, content).
 xpath_chk(+DOM, +Spec, ?Content) is semidet
Semi-deterministic version of xpath/3.
   73xpath_chk(DOM, Spec, Content) :-
   74    xpath(DOM, Spec, Content),
   75    !.
 xpath(+DOM, +Spec, ?Content) is nondet
Match an element in a DOM structure. The syntax is inspired by XPath, using () rather than [] to select inside an element. First we can construct paths using / and //:
//Term
Select any node in the DOM matching term.
/Term
Match the root against Term.
Term
Select the immediate children of the root matching Term.

The Terms above are of type callable. The functor specifies the element name. The element name '*' refers to any element. The name self refers to the top-element itself and is often used for processing matches of an earlier xpath/3 query. A term NS:Term refers to an XML name in the namespace NS. Optional arguments specify additional constraints and functions. The arguments are processed from left to right. Defined conditional argument values are:

index(?Index)
True if the element is the Index-th child of its parent, where 1 denotes the first child. Index can be one of:
Var
Var is unified with the index of the matched element.
last
True for the last element.
last - IntExpr
True for the last-minus-nth element. For example, last-1 is the element directly preceding the last one.
IntExpr
True for the element whose index equals IntExpr.
Integer
The N-th element with the given name, with 1 denoting the first element. Same as index(Integer).
last
The last element with the given name. Same as index(last).
last - IntExpr
The IntExpr-th element before the last. Same as index(last-IntExpr).

Defined function argument values are:

self
Evaluate to the entire element
content
Evaluate to the content of the element (a list)
text
Evaluates to all text from the sub-tree as an atom
text(As)
Evaluates to all text from the sub-tree according to As, which is either atom or string.
normalize_space
As text, but uses normalize_space/2 to normalise white-space in the output
number
Extract an integer or float from the value. Ignores leading and trailing white-space
@Attribute
Evaluates to the value of the given attribute. Attribute can be a compound term. In this case the functor name denotes the element and arguments perform transformations on the attribute value. Defined transformations are:
number
Translate the value into a number using xsd_number_string/2 from library(sgml).
integer
As number, but subsequently transform the value into an integer using the round/1 function.
float
As number, but subsequently transform the value into a float using the float/1 function.
string
Translate the value into a Prolog string.
lower
Translate the value to lower case, preserving the type.
upper
Translate the value to upper case, preserving the type.

In addition, the argument-list can be conditions:

Left = Right
Succeeds if the left-hand unifies with the right-hand. If the left-hand side is a function, this is evaluated. The right-hand side is never evaluated, and thus the condition content = content defines that the content of the element is the atom content. The functions lower_case and upper_case can be applied to Right (see example below).
contains(Haystack, Needle)
Succeeds if Needle is a sub-string of Haystack.
XPath
Succeeds if XPath matches in the currently selected sub-DOM. For example, the following expression finds an h3 element inside a div element, where the div element itself contains an h2 child with a strong child.
//div(h2/strong)/h3

This is equivalent to the conjunction of XPath goals below.

   ...,
   xpath(DOM, //(div), Div),
   xpath(Div, h2/strong, _),
   xpath(Div, h3, Result)

Examples:

Match each table-row in DOM:

xpath(DOM, //tr, TR)

Match the last cell of each tablerow in DOM. This example illustrates that a result can be the input of subsequent xpath/3 queries. Using multiple queries on the intermediate TR term guarantee that all results come from the same table-row:

xpath(DOM, //tr, TR),
xpath(TR,  /td(last), TD)

Match each href attribute in an <a> element

xpath(DOM, //a(@href), HREF)

Suppose we have a table containing rows where each first column is the name of a product with a link to details and the second is the price (a number). The following predicate matches the name, URL and price:

product(DOM, Name, URL, Price) :-
    xpath(DOM, //tr, TR),
    xpath(TR, td(1), C1),
    xpath(C1, /self(normalize_space), Name),
    xpath(C1, a(@href), URL),
    xpath(TR, td(2, number), Price).

Suppose we want to select books with genre="thriller" from a tree containing elements <book genre=...>

thriller(DOM, Book) :-
    xpath(DOM, //book(@genre=thiller), Book).

Match the elements <table align="center"> and <table align="CENTER">:

    //table(@align(lower) = center)

Get the width and height of a div element as a number, and the div node itself:

    xpath(DOM, //div(@width(number)=W, @height(number)=H), Div)

Note that div is an infix operator, so parentheses must be used in cases like the following:

    xpath(DOM, //(div), Div)
  261xpath(DOM, Spec, Content) :-
  262    in_dom(Spec, DOM, Content).
  263
  264in_dom(//Spec, DOM, Value) :-
  265    !,
  266    element_spec(Spec, Name, Modifiers),
  267    sub_dom(I, Len, Name, E, DOM),
  268    modifiers(Modifiers, I, Len, E, Value).
  269in_dom(/Spec, E, Value) :-
  270    !,
  271    element_spec(Spec, Name, Modifiers),
  272    (   Name == self
  273    ->  true
  274    ;   element_name(E, Name)
  275    ),
  276    modifiers(Modifiers, 1, 1, E, Value).
  277in_dom(A/B, DOM, Value) :-
  278    !,
  279    in_dom(A, DOM, Value0),
  280    in_dom(B, Value0, Value).
  281in_dom(A//B, DOM, Value) :-
  282    !,
  283    in_dom(A, DOM, Value0),
  284    in_dom(//B, Value0, Value).
  285in_dom(Spec, element(_, _, Content), Value) :-
  286    element_spec(Spec, Name, Modifiers),
  287    count_named_elements(Content, Name, CLen),
  288    CLen > 0,
  289    nth_element(N, Name, E, Content),
  290    modifiers(Modifiers, N, CLen, E, Value).
  291
  292element_spec(Var, _, _) :-
  293    var(Var),
  294    !,
  295    instantiation_error(Var).
  296element_spec(NS:Term, NS:Name, Modifiers) :-
  297    !,
  298    callable_name_arguments(Term, Name0, Modifiers),
  299    star(Name0, Name).
  300element_spec(Term, Name, Modifiers) :-
  301    !,
  302    callable_name_arguments(Term, Name0, Modifiers),
  303    star(Name0, Name).
  304
  305callable_name_arguments(Atom, Name, Arguments) :-
  306    atom(Atom),
  307    !,
  308    Name = Atom, Arguments = [].
  309callable_name_arguments(Compound, Name, Arguments) :-
  310    compound_name_arguments(Compound, Name, Arguments).
  311
  312
  313star(*, _) :- !.
  314star(Name, Name).
 sub_dom(-Index, -Count, +Name, -Sub, +DOM) is nondet
Sub is a node in DOM with Name.
Arguments:
Count- is the total number of nodes in the content list Sub appears that have the same name.
Index- is the 1-based index of Sub of nodes with Name.
  326sub_dom(1, 1, Name, DOM, DOM) :-
  327    element_name(DOM, Name0),
  328    \+ Name \= Name0.
  329sub_dom(N, Len, Name, E, element(_,_,Content)) :-
  330    !,
  331    sub_dom_2(N, Len, Name, E, Content).
  332sub_dom(N, Len, Name, E, Content) :-
  333    is_list(Content),
  334    sub_dom_2(N, Len, Name, E, Content).
  335
  336sub_dom_2(N, Len, Name, Element, Content) :-
  337    (   count_named_elements(Content, Name, Len),
  338        nth_element(N, Name, Element, Content)
  339    ;   member(element(_,_,C2), Content),
  340        sub_dom_2(N, Len, Name, Element, C2)
  341    ).
 count_named_elements(+Content, +Name, -Count) is det
Count is the number of nodes with Name in Content.
  348count_named_elements(Content, Name, Count) :-
  349    count_named_elements(Content, Name, 0, Count).
  350
  351count_named_elements([], _, Count, Count).
  352count_named_elements([element(Name,_,_)|T], Name0, C0, C) :-
  353    \+ Name \= Name0,
  354    !,
  355    C1 is C0+1,
  356    count_named_elements(T, Name0, C1, C).
  357count_named_elements([_|T], Name, C0, C) :-
  358    count_named_elements(T, Name, C0, C).
 nth_element(?N, +Name, -Element, +Content:list) is nondet
True if Element is the N-th element with name in Content.
  365nth_element(N, Name, Element, Content) :-
  366    nth_element_(1, N, Name, Element, Content).
  367
  368nth_element_(I, N, Name, E, [H|T]) :-
  369    element_name(H, Name0),
  370    \+ Name \= Name0,
  371    !,
  372    (   N = I,
  373        E = H
  374    ;   I2 is I + 1,
  375        (   nonvar(N), I2 > N
  376        ->  !, fail
  377        ;   true
  378        ),
  379        nth_element_(I2, N, Name, E, T)
  380    ).
  381nth_element_(I, N, Name, E, [_|T]) :-
  382    nth_element_(I, N, Name, E, T).
 modifiers(+Modifiers, +I, +Clen, +DOM, -Value)
  389modifiers([], _, _, Value, Value).
  390modifiers([H|T], I, L, Value0, Value) :-
  391    modifier(H, I, L, Value0, Value1),
  392    modifiers(T, I, L, Value1, Value).
  393
  394modifier(M, _, _, _, _) :-
  395    var(M),
  396    !,
  397    instantiation_error(M).
  398modifier(Index, I, L, Value0, Value) :-
  399    implicit_index_modifier(Index),
  400    !,
  401    Value = Value0,
  402    index_modifier(Index, I, L).
  403modifier(index(Index), I, L, Value, Value) :-
  404    !,
  405    index_modifier(Index, I, L).
  406modifier(Function, _, _, In, Out) :-
  407    xpath_function(Function),
  408    !,
  409    xpath_function(Function, In, Out).
  410modifier(Function, _, _, In, Out) :-
  411    xpath_condition(Function, In),
  412    Out = In.
  413
  414implicit_index_modifier(I) :-
  415    integer(I),
  416    !.
  417implicit_index_modifier(last).
  418implicit_index_modifier(last-_Expr).
  419
  420index_modifier(Var, I, _L) :-
  421    var(Var),
  422    !,
  423    Var = I.
  424index_modifier(last, I, L) :-
  425    !,
  426    I =:= L.
  427index_modifier(last-Expr, I, L) :-
  428    !,
  429    I =:= L-Expr.
  430index_modifier(N, I, _) :-
  431    N =:= I.
  432
  433xpath_function(self, DOM, Value) :-                            % self
  434    !,
  435    Value = DOM.
  436xpath_function(content, Element, Value) :-                     % content
  437    !,
  438    element_content(Element, Value).
  439xpath_function(text, DOM, Text) :-                             % text
  440    !,
  441    text_of_dom(DOM, atom, Text).
  442xpath_function(text(As), DOM, Text) :-                         % text(As)
  443    !,
  444    text_of_dom(DOM, As, Text).
  445xpath_function(normalize_space, DOM, Text) :-                  % normalize_space
  446    !,
  447    text_of_dom(DOM, string, Text0),
  448    normalize_space(atom(Text), Text0).
  449xpath_function(number, DOM, Number) :-                         % number
  450    !,
  451    text_of_dom(DOM, string, Text0),
  452    normalize_space(string(Text), Text0),
  453    catch(xsd_number_string(Number, Text), _, fail).
  454xpath_function(@Name, element(_, Attrs, _), Value) :-          % @Name
  455    !,
  456    (   atom(Name)
  457    ->  memberchk(Name=Value, Attrs)
  458    ;   compound(Name)
  459    ->  compound_name_arguments(Name, AName, AOps),
  460        memberchk(AName=Value0, Attrs),
  461        translate_attribute(AOps, Value0, Value)
  462    ;   member(Name=Value, Attrs)
  463    ).
  464xpath_function(quote(Value), _, Value).                         % quote(Value)
  465
  466xpath_function(self).
  467xpath_function(content).
  468xpath_function(text).
  469xpath_function(text(_)).
  470xpath_function(normalize_space).
  471xpath_function(number).
  472xpath_function(@_).
  473xpath_function(quote(_)).
  474
  475translate_attribute([], Value, Value).
  476translate_attribute([H|T], Value0, Value) :-
  477    translate_attr(H, Value0, Value1),
  478    translate_attribute(T, Value1, Value).
  479
  480translate_attr(number, Value0, Value) :-
  481    xsd_number_string(Value, Value0).
  482translate_attr(integer, Value0, Value) :-
  483    xsd_number_string(Value1, Value0),
  484    Value is round(Value1).
  485translate_attr(float, Value0, Value) :-
  486    xsd_number_string(Value1, Value0),
  487    Value is float(Value1).
  488translate_attr(string, Value0, Value) :-
  489    atom_string(Value0, Value).
  490translate_attr(lower, Value0, Value) :-
  491    (   atom(Value0)
  492    ->  downcase_atom(Value0, Value)
  493    ;   string_lower(Value0, Value)
  494    ).
  495translate_attr(upper, Value0, Value) :-
  496    (   atom(Value0)
  497    ->  upcase_atom(Value0, Value)
  498    ;   string_upper(Value0, Value)
  499    ).
  500
  501xpath_condition(Left = Right, Value) :-                        % =
  502    !,
  503    var_or_function(Left, Value, LeftValue),
  504    process_equality(LeftValue, Right).
  505xpath_condition(contains(Haystack, Needle), Value) :-          % contains(Haystack, Needle)
  506    !,
  507    val_or_function(Haystack, Value, HaystackValue),
  508    val_or_function(Needle, Value, NeedleValue),
  509    atom(HaystackValue), atom(NeedleValue),
  510    (   sub_atom(HaystackValue, _, _, _, NeedleValue)
  511    ->  true
  512    ).
  513xpath_condition(Spec, Dom) :-
  514    in_dom(Spec, Dom, _).
 process_equality(+Left, +Right) is semidet
Provides (very) partial support for XSLT functions that can be applied according to the XPath 2 specification.

For example the XPath expression in [1], and the equivalent Prolog expression in [2], would both match the HTML element in [3].

[1] //table[align=lower-case(center)]
[2] //table(@align=lower_case(center))
[3] <table align="CENTER">
  532process_equality(Left, Right) :-
  533    var(Right),
  534    !,
  535    Left = Right.
  536process_equality(Left, lower_case(Right)) :-
  537    !,
  538    downcase_atom(Left, Right).
  539process_equality(Left, upper_case(Right)) :-
  540    !,
  541    upcase_atom(Left, Right).
  542process_equality(Left, Right) :-
  543    Left = Right.
  544
  545
  546var_or_function(Arg, _, Arg) :-
  547    var(Arg),
  548    !.
  549var_or_function(Func, Value0, Value) :-
  550    xpath_function(Func),
  551    !,
  552    xpath_function(Func, Value0, Value).
  553var_or_function(Value, _, Value).
  554
  555val_or_function(Arg, _, Arg) :-
  556    var(Arg),
  557    !,
  558    instantiation_error(Arg).
  559val_or_function(Func, Value0, Value) :-                         % TBD
  560    xpath_function(Func, Value0, Value),
  561    !.
  562val_or_function(Value, _, Value).
 text_of_dom(+DOM, +As, -Text:atom) is det
Text is the joined textual content of DOM.
  569text_of_dom(DOM, As, Text) :-
  570    phrase(text_of(DOM), Tokens),
  571    (   As == atom
  572    ->  atomic_list_concat(Tokens, Text)
  573    ;   As == string
  574    ->  atomics_to_string(Tokens, Text)
  575    ;   must_be(oneof([atom,string]), As)
  576    ).
  577
  578text_of(element(_,_,Content)) -->
  579    text_of_list(Content).
  580text_of([]) -->
  581    [].
  582text_of([H|T]) -->
  583    text_of(H),
  584    text_of(T).
  585
  586
  587text_of_list([]) -->
  588    [].
  589text_of_list([H|T]) -->
  590    text_of_1(H),
  591    text_of_list(T).
  592
  593
  594text_of_1(element(_,_,Content)) -->
  595    !,
  596    text_of_list(Content).
  597text_of_1(Data) -->
  598    { assertion(atom_or_string(Data)) },
  599    [Data].
  600
  601atom_or_string(Data) :-
  602    (   atom(Data)
  603    ->  true
  604    ;   string(Data)
  605    )