1 (***********************************************************************)
8 (* Copyright 2010-2012 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 (* utils.ml-> INCLUDE "utils.ml" HASHINT2 () *)
20 type label = QNameSet.t
22 type formula = Formula.t
26 type t = state * label * formula
28 let compare (st,la,f) (st',la',f') =
29 let x_1 = State.compare st st' in
31 else let x_2 = QNameSet.compare la la' in
33 else Formula.compare f f'
37 let print fmt (st,la,f) =
38 Format.fprintf fmt "%a ----%s---> %a"
40 (QNameSet.to_string la)
46 include Set.Make(Transition)
49 type transition = Transition.t
52 mutable quer : StateSet.t;
53 mutable reco : StateSet.t;
54 mutable selec : StateSet.t;
55 mutable bottom : StateSet.t;
56 mutable top : StateSet.t;
57 mutable trans_q : SetT.t;
58 mutable trans_r : SetT.t;
61 exception Not_found_transition
62 exception Transition_not_injective
64 let transition asta st lab =
66 (State.compare s st = 0) && (QNameSet.compare l lab = 0) in
67 let tr_set = (SetT.elements (SetT.filter filter asta.trans_q)) @
68 (SetT.elements (SetT.filter filter asta.trans_r))
71 | [] -> raise Not_found_transition
72 | x::y::z -> raise Transition_not_injective
73 | [l] -> Transition.fo l
75 let transitions asta st =
76 let filter (s,l,f) = State.compare s st = 0 in
77 let rec remove_states l = match l with
79 | (a,s,l) :: tl -> (s,l) :: (remove_states tl) in
80 (remove_states (SetT.elements (SetT.filter filter asta.trans_q)),
81 (remove_states (SetT.elements (SetT.filter filter asta.trans_r))))
84 quer = StateSet.empty;
85 reco = StateSet.empty;
86 selec = StateSet.empty;
87 bottom = StateSet.empty;
93 let any_label = QNameSet.complement (QNameSet.empty)
95 let new_state () = State.make()
97 let add_tr ast tr flag =
99 then ast.trans_q <- (SetT.add tr (ast.trans_q))
100 else ast.trans_r <- (SetT.add tr (ast.trans_r))
102 let add_quer ast st = ast.quer <- (StateSet.add st (ast.quer))
104 let add_reco ast st = ast.reco <- (StateSet.add st (ast.reco))
106 let add_selec ast st = ast.selec <- (StateSet.add st (ast.selec))
108 let add_bot ast st = ast.bottom <- (StateSet.add st (ast.bottom))
110 let add_top ast st = ast.top <- (StateSet.add st (ast.top))
112 let init_top ast = ast.top <- (StateSet.empty)
114 let top_states ast = StateSet.elements ast.top
117 let print_box fmt flag =
118 let pp = Format.fprintf fmt in
119 pp "@[<v 0># Query states: %a@ @]"
120 StateSet.print asta.quer;
121 pp "@[<v 0># Recognizing states: %a@ @]"
122 StateSet.print asta.reco;
123 pp "@[<v 0># Selecting states: %a@ @]"
124 StateSet.print asta.selec;
125 pp "@[<v 0># Bottom states: %a@ @]"
126 StateSet.print asta.bottom;
127 pp "@[<v 0># Top states: %a@ @]"
128 StateSet.print asta.top;
129 let print_list_tr fmt z =
131 then Format.fprintf fmt "ø"
133 SetT.iter (fun x -> Format.fprintf fmt "| %a @ " Transition.print x) z in
134 let print_box_list fmt trans =
135 Format.fprintf fmt " @[<hov 0>%a @]" print_list_tr trans in
136 Format.fprintf fmt "@[<v 0># Queries transitions:@ %a@ @]"
137 print_box_list asta.trans_q;
138 Format.fprintf fmt "@[<v 0># Recognizing transitions:@ %a@]"
139 print_box_list asta.trans_r in
140 Format.fprintf fmt "@[<v 1>##### ASTA #####@, %a@ @]@." print_box 0
142 let to_file out asta = ()