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 (***********************************************************************)
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)"
46 include Set.Make(Transition)
50 mutable reco : StateSet.t;
51 mutable selec : StateSet.t;
52 mutable bottom : StateSet.t;
53 mutable top : StateSet.t;
54 mutable trans : SetT.t;
57 exception Not_found_transition
58 exception Transition_not_injective
60 let transition asta st lab =
62 (State.compare s st = 0) && (QNameSet.compare l lab = 0) in
63 let tr_set = SetT.elements (SetT.filter filter asta.trans) in
65 | [] -> raise Not_found_transition
66 | x::y::z -> raise Transition_not_injective
67 | [l] -> Transition.fo l
69 let transitions asta st =
70 let filter (s,l,f) = State.compare s st = 0 in
71 let rec remove_states l = match l with
73 | (a,s,l) :: tl -> (s,l) :: (remove_states tl) in
74 remove_states (SetT.elements (SetT.filter filter asta.trans))
78 let pp = Format.fprintf fmt in
79 pp "Recognizing states: ";
80 StateSet.print fmt asta.reco;
81 pp "\nSelecting states: ";
82 StateSet.print fmt asta.selec;
83 pp "\nBottom states: ";
84 StateSet.print fmt asta.bottom;
86 StateSet.print fmt asta.top;
87 pp "\nTransitions: \n";
88 Format.fprintf fmt "{@[<hov n> %a @]}" (* todo: check boxes *)
89 (Pretty.print_list ~sep:"@, " (Transition.print))
90 (SetT.elements (asta.trans))
93 let to_file out asta = ()