2 include Set.S with type elt = int
3 val from_list : elt list -> t
8 val mk_state : unit -> state
10 type predicate = [ `Left of (Tree.Binary.t -> bool) | `Right of (Tree.Binary.t -> bool) |
15 val eval_pred : Tree.Binary.t -> predicate -> bool
20 | Or of formula * formula
21 | And of formula * formula
22 | Atom of ([ `Left | `Right | `LLeft | `RRight ] * bool * state)
23 and formula = { fid : int; fkey : int; pos : formula_expr; neg : formula; st : (Ptset.t*Ptset.t)*(Ptset.t*Ptset.t); size: int;}
26 val atom_ : [`Left | `Right | `LLeft | `RRight ] -> bool -> state -> formula
27 val and_ : formula -> formula -> formula
28 val or_ : formula -> formula -> formula
29 val not_ : formula -> formula
30 (*val equal_form : formula -> formula -> bool *)
31 val pr_frm : Format.formatter -> formula -> unit
34 module HTagSet : Hashtbl.S with type key = Ptset.t*Tag.t
38 mutable states : Ptset.t;
40 mutable final : Ptset.t;
42 phi : (state,(TagSet.t*(bool*formula*predicate)) list) Hashtbl.t;
43 delta : (state*Tag.t, (bool*formula*predicate)) Hashtbl.t;
44 (* delta : (state,(bool*formula*predicate) TagMap.t) Hashtbl.t; *)
45 sigma : (bool*formula*(predicate list*predicate list)*bool) HTagSet.t;
48 val dump : Format.formatter -> t -> unit
50 module Transitions : sig
51 type t = state*TagSet.t*bool*formula*predicate
52 (* Doing this avoid the parenthesis *)
53 val ( ?< ) : state -> state
54 val ( >< ) : state -> TagSet.t*bool -> state*(TagSet.t*bool*predicate)
55 val ( ><@ ) : state -> TagSet.t*bool*predicate -> state*(TagSet.t*bool*predicate)
56 val ( >=> ) : state*(TagSet.t*bool*predicate) -> formula -> t
57 val ( +| ) : formula -> formula -> formula
58 val ( *& ) : formula -> formula -> formula
59 val ( ** ) : [`Left | `Right | `LLeft | `RRight ] -> state -> formula
62 type transition = Transitions.t
63 val equal_trans : transition -> transition -> bool
68 val cons : Tree.Binary.t -> t -> t
69 val append : Tree.Binary.t -> t -> t
70 val concat : t -> t -> t
71 val to_list_rev : t -> Tree.Binary.t list
73 val iter : (Tree.Binary.t -> unit) -> t -> unit
74 val rev_iter : (Tree.Binary.t -> unit) -> t -> unit
75 val find : (Tree.Binary.t -> bool) -> t -> Tree.Binary.t
78 (*module BottomUpJumpNew :
80 val run : t -> Tree.Binary.t -> TS.t
81 val run_time : t -> Tree.Binary.t -> TS.t