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 (***********************************************************************)
17 Time-stamp: <Last modified on 2013-04-04 18:41:03 CEST by Kim Nguyen>
20 type path = single_path list
21 and single_path = Absolute of step list | Relative of step list
22 and step = axis * test * expr list
23 and axis = Self | Attribute | Child
29 | Preceding | Following
31 and test = QNameSet.t * Tree.NodeKind.t
33 and binop = Eq | Neq | Lt | Gt | Lte | Gte | Or | And | Add | Sub | Mult | Div | Mod
36 | Number of [ `Int of int | `Float of float ]
38 | Fun_call of QName.t * expr list
40 | Binop of expr * binop * expr
46 val print_binop : Format.formatter -> binop -> unit
47 val print_unop : Format.formatter -> unop -> unit
48 val print_path : Format.formatter -> path -> unit
49 val print_single_path : Format.formatter -> single_path -> unit
50 val print_step : Format.formatter -> step -> unit
51 val print_axis : Format.formatter -> axis -> unit
52 val print_test : Format.formatter -> test -> unit
53 val print_expr : Format.formatter -> expr -> unit
55 val invert_axis : axis -> axis