1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2013 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
16 type path = single_path list
17 and single_path = Absolute of step list | Relative of step list
18 and step = axis * test * expr list
19 and axis = Self | Attribute | Child
25 | Preceding | Following
27 and test = QNameSet.t * Tree.NodeKind.t
29 and binop = Eq | Neq | Lt | Gt | Lte | Gte | Or | And | Add | Sub | Mult | Div | Mod
32 | Number of [ `Int of int | `Float of float ]
34 | Fun_call of QName.t * expr list
36 | Binop of expr * binop * expr
42 val print_binop : Format.formatter -> binop -> unit
43 val print_unop : Format.formatter -> unop -> unit
44 val print_path : Format.formatter -> path -> unit
45 val print_single_path : Format.formatter -> single_path -> unit
46 val print_step : Format.formatter -> step -> unit
47 val print_axis : Format.formatter -> axis -> unit
48 val print_test : Format.formatter -> test -> unit
49 val print_expr : Format.formatter -> expr -> unit
51 val invert_axis : axis -> axis