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 (***********************************************************************)
18 type label = QNameSet.t
20 type formula = Formula.t
24 type t = state * label * formula
26 let compare (st,la,f) (st',la',f') =
27 let x_1 = State.compare st st' in
29 else let x_2 = QNameSet.compare la la' in
31 else Formula.compare f f'
35 let print fmt (st,la,f) =
36 Format.fprintf fmt "(%a,%s,%a)"
38 (QNameSet.to_string la)
44 include Set.Make(Transition)
47 type transition = Transition.t
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))
77 reco = StateSet.empty;
78 selec = StateSet.empty;
79 bottom = StateSet.empty;
84 let any_label = QNameSet.complement (QNameSet.empty)
86 let new_state () = State.make()
88 let add_tr ast tr = ast.trans <- (SetT.add tr (ast.trans))
90 let add_reco ast st = ast.reco <- (StateSet.add st (ast.reco))
92 let add_selec ast st = ast.selec <- (StateSet.add st (ast.selec))
94 let add_bot ast st = ast.bottom <- (StateSet.add st (ast.bottom))
96 let add_top ast st = ast.top <- (StateSet.add st (ast.top))
98 let top_states ast = StateSet.elements ast.top
101 let pp = Format.fprintf fmt in
102 pp "Recognizing states: ";
103 StateSet.print fmt asta.reco;
104 pp "\nSelecting states: ";
105 StateSet.print fmt asta.selec;
106 pp "\nBottom states: ";
107 StateSet.print fmt asta.bottom;
109 StateSet.print fmt asta.top;
110 pp "\nTransitions: \n";
111 Format.fprintf fmt "{@[<hov 2> %a @]}" (* todo: check boxes *)
112 (Pretty.print_list ~sep:"@, " (Transition.print))
113 (SetT.elements (asta.trans))
116 let to_file out asta = ()