4 type jump_kind = [ `TAG of Tag.t | `CONTAINS of string | `NOTHING ]
6 (* Todo : move elsewhere *)
7 external vb : bool -> int = "%identity"
11 include Sigs.T with type t = int
21 external hash : t -> int = "%identity"
22 let print fmt x = Format.fprintf fmt "%i" x
23 let dump fmt x = print fmt x
25 if x < 0 then failwith (Printf.sprintf "State: Assertion %i < 0 failed" x)
28 module StateSet = struct
31 Format.pp_print_string ppf "{ ";
32 iter (fun i -> Format.fprintf ppf "%i " i) s;
33 Format.pp_print_string ppf "}";
34 Format.pp_print_flush ppf ()
41 | Or of 'hcons * 'hcons
42 | And of 'hcons * 'hcons
43 | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*State.t)
47 st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t);
48 size: int; (* Todo check if this is needed *)
51 external hash_const_variant : [> ] -> int = "%identity"
52 module rec HNode : Hcons.S with type data = Node.t = Hcons.Make (Node)
53 and Node : Hashtbl.HashedType with type t = HNode.t node =
56 let equal x y = x.size == y.size &&
57 match x.pos,y.pos with
60 | Or(xf1,xf2),Or(yf1,yf2)
61 | And(xf1,xf2),And(yf1,yf2) -> (HNode.equal xf1 yf1) && (HNode.equal xf2 yf2)
62 | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2
68 | Or (f1,f2) -> HASHINT3(PRIME2,HNode.uid f1,HNode.uid f2)
69 | And (f1,f2) -> HASHINT3(PRIME3,HNode.uid f1,HNode.uid f2)
70 | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s)
76 let equal = HNode.equal
77 let expr f = (HNode.node f).pos
78 let st f = (HNode.node f ).st
79 let size f = (HNode.node f).size
88 let rec print ?(parent=false) ppf f =
89 if parent then Format.fprintf ppf "(";
90 let _ = match expr f with
91 | True -> Format.fprintf ppf "T"
92 | False -> Format.fprintf ppf "F"
94 print ~parent:(prio f > prio f1) ppf f1;
95 Format.fprintf ppf " ∧ ";
96 print ~parent:(prio f > prio f2) ppf f2;
99 Format.fprintf ppf " ∨ ";
101 | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]"
102 (if b then "" else "¬")
109 if parent then Format.fprintf ppf ")"
111 let print ppf f = print ~parent:false ppf f
113 let is_true f = (expr f) == True
114 let is_false f = (expr f) == False
117 let cons pos neg s1 s2 size1 size2 =
118 let nnode = HNode.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
119 let pnode = HNode.make { pos = pos; neg = nnode ; st = s1; size = size1 }
121 (HNode.node nnode).neg <- pnode; (* works because the neg field isn't taken into
122 account for hashing ! *)
125 let empty_triple = StateSet.empty,StateSet.empty,StateSet.empty
126 let empty_hex = empty_triple,empty_triple
127 let true_,false_ = cons True False empty_hex empty_hex 0 0
129 let si = StateSet.singleton s in
130 let ss = match d with
131 | `Left -> (si,StateSet.empty,si),empty_triple
132 | `Right -> empty_triple,(si,StateSet.empty,si)
133 | `LLeft -> (StateSet.empty,si,si),empty_triple
134 | `RRight -> empty_triple,(StateSet.empty,si,si)
135 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
137 let not_ f = (HNode.node f).neg
138 let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) =
139 (StateSet.mem_union l1 l2 ,StateSet.mem_union ll1 ll2,StateSet.mem_union lll1 lll2),
140 (StateSet.mem_union r1 r2 ,StateSet.mem_union rr1 rr2,StateSet.mem_union rrr1 rrr2)
142 let merge_states f1 f2 =
144 union_hex (st f1) (st f2)
146 union_hex (st (not_ f1)) (st (not_ f2))
150 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
153 (* Tautologies: x|x, x|not(x) *)
155 if equal f1 f2 then f1 else
156 if equal f1 (not_ f2) then true_ else
159 if is_true f1 || is_true f2 then true_ else
160 if is_false f1 && is_false f2 then false_ else
161 if is_false f1 then f2 else
162 if is_false f2 then f1 else
164 (* commutativity of | *)
166 let f1,f2 = order f1 f2 in
167 let psize = (size f1) + (size f2) in
168 let nsize = (size (not_ f1)) + (size (not_ f2)) in
169 let sp,sn = merge_states f1 f2 in
170 fst (cons (Or(f1,f2)) (And(not_ f1,not_ f2)) sp sn psize nsize)
175 (* Tautologies: x&x, x¬(x) *)
177 if equal f1 f2 then f1 else
178 if equal f1 (not_ f2) then false_ else
180 (* simplifications *)
182 if is_true f1 && is_true f2 then true_ else
183 if is_false f1 || is_false f2 then false_ else
184 if is_true f1 then f2 else
185 if is_true f2 then f1 else
187 (* commutativity of & *)
189 let f1,f2 = order f1 f2 in
190 let psize = (size f1) + (size f2) in
191 let nsize = (size (not_ f1)) + (size (not_ f2)) in
192 let sp,sn = merge_states f1 f2 in
193 fst (cons (And(f1,f2)) (Or(not_ f1,not_ f2)) sp sn psize nsize)
194 module Infix = struct
195 let ( +| ) f1 f2 = or_ f1 f2
196 let ( *& ) f1 f2 = and_ f1 f2
197 let ( *+ ) d s = atom_ d true s
198 let ( *- ) d s = atom_ d false s
202 module Transition = struct
204 type node = State.t*bool*Formula.t*bool
205 include Hcons.Make(struct
207 let hash (s,m,f,b) = HASHINT4(s,Formula.uid f,vb m,vb b)
208 let equal (s,b,f,m) (s',b',f',m') =
209 s == s' && b==b' && m==m' && Formula.equal f f'
212 let print ppf f = let (st,mark,form,b) = node f in
213 Format.fprintf ppf "%i %s" st (if mark then "⇒" else "→");
214 Formula.print ppf form;
215 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
218 module Infix = struct
220 let ( >< ) state (l,mark) = state,(l,mark,false)
221 let ( ><@ ) state (l,mark) = state,(l,mark,true)
222 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,mark,form,bur)))
229 type t = Ptset.Int.t*Tag.t
230 let equal (s1,t1) (s2,t2) = (t1 == t2) && Ptset.Int.equal s1 s2
231 let hash (s,t) = HASHINT2(Ptset.Int.uid s, t)
234 module TransTable = Hashtbl
235 module CachedTransTable = Hashtbl.Make(SetTagKey)
237 module Formlist = struct
238 include Hlist.Make(Transition)
240 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
246 mutable states : Ptset.Int.t;
248 starstate : Ptset.Int.t option;
249 (* Transitions of the Alternating automaton *)
250 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
251 query_string: string;
256 Format.fprintf ppf "Automaton (%i) :\n" a.id;
257 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
258 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
259 Format.fprintf ppf "\nAlternating transitions :\n";
260 let l = Hashtbl.fold (fun k t acc ->
261 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
262 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
263 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
264 let maxh,maxt,l_print =
266 fun (maxh,maxt,l) ((ts,q),(_,b,f,_)) ->
268 if TagSet.is_finite ts
269 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
270 else let cts = TagSet.neg ts in
271 if TagSet.is_empty cts then "*" else
272 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
275 let s = Printf.sprintf "(%s,%i)" s q in
277 Formula.print Format.str_formatter f;
278 Format.flush_str_formatter()
280 (max (String.length s) maxh, max (String.length s_frm) maxt,
281 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
283 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
284 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
285 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
286 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
289 module MemoForm = Memoizer.Make(
291 type t = Formula.t*(StateSet.t*StateSet.t)
292 let equal (f1,(s1,t1)) (f2,(s2,t2)) =
293 Formula.equal f1 f2 && StateSet.equal s1 s2 && StateSet.equal t1 t2
295 HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t)
302 fun eval (f, ((s1,s2) as sets)) ->
304 | F.True -> true,true,true
305 | F.False -> false,false,false
306 | F.Atom((`Left|`LLeft),b,q) ->
307 if b == (StateSet.mem q s1)
308 then (true,true,false)
309 else false,false,false
311 if b == (StateSet.mem q s2)
312 then (true,false,true)
313 else false,false,false
315 let b1,rl1,rr1 = eval (f1,sets)
317 if b1 && rl1 && rr1 then (true,true,true) else
318 let b2,rl2,rr2 = eval (f2,sets) in
319 let rl1,rr1 = if b1 then rl1,rr1 else false,false
320 and rl2,rr2 = if b2 then rl2,rr2 else false,false
321 in (b1 || b2, rl1||rl2,rr1||rr2)
324 let b1,rl1,rr1 = eval (f1,sets) in
325 if b1 && rl1 && rr1 then (true,true,true) else
327 let b2,rl2,rr2 = eval (f2,sets) in
328 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
329 else (false,false,false)
332 let eval_form_bool f s1 s2 = eval_form_bool (f,(s1,s2))
335 module MemoFormlist = Memoizer.Make(
337 type t = Formlist.t*(StateSet.t*StateSet.t)
338 let equal (f1,(s1,t1)) (f2,(s2,t2)) =
339 Formlist.equal f1 f2 && StateSet.equal s1 s2 && StateSet.equal t1 t2
341 HASHINT3(Formlist.uid f ,StateSet.uid s,StateSet.uid t)
346 let eval_formlist = MemoFormlist.make_rec (
347 fun eval (fl,((s1,s2)as sets)) ->
348 match Formlist.node fl with
349 | Formlist.Nil -> StateSet.empty,false,false,false,false
350 | Formlist.Cons(f,fll) ->
351 let q,mark,f,_ = Transition.node f in
352 let b,b1,b2 = eval_form_bool f s1 s2 in
353 let s,b',b1',b2',amark = eval (fll,sets) in
354 if b then (StateSet.add q s, b, b1'||b1,b2'||b2,mark||amark)
355 else s,b',b1',b2',amark )
357 let eval_formlist ?(memo=true) s1 s2 fl =
358 eval_formlist (fl,(s1,s2))
361 let tags_of_state a q =
364 if p == q then List.fold_left
366 let _,_,_,aux = Transition.node t in
368 TagSet.cup ts acc) acc l
370 else acc) a.trans TagSet.empty
375 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
377 if TagSet.is_finite ts
378 then `Positive(TagSet.positive ts)
379 else `Negative(TagSet.negative ts)
383 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
384 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
386 let mk_nil_ctx x _ = Tree.mk_nil x
387 let next_sibling_ctx x _ = Tree.next_sibling x
391 module type ResultSet =
395 val cons : Tree.t -> t -> t
396 val concat : t -> t -> t
397 val iter : (Tree.t -> unit) -> t -> unit
398 val fold : (Tree.t -> 'a -> 'a) -> t -> 'a -> 'a
399 val map : (Tree.t -> Tree.t) -> t -> t
400 val length : t -> int
403 module Integer : ResultSet =
408 let concat x y = x + y
409 let iter _ _ = failwith "iter not implemented"
410 let fold _ _ _ = failwith "fold not implemented"
411 let map _ _ = failwith "map not implemented"
415 module IdSet : ResultSet =
418 | Cons of Tree.t * node
419 | Concat of node*node
421 and t = { node : node;
424 let empty = { node = Nil; length = 0 }
426 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
427 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
428 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
431 let rec loop acc t = match t with
433 | Cons (e,t) -> loop (f e acc) t
434 | Concat (t1,t2) -> loop (loop acc t1) t2
438 let length l = l.length
442 let rec loop = function
444 | Cons (e,t) -> f e; loop t
445 | Concat(t1,t2) -> loop t1;loop t2
449 let rec loop = function
451 | Cons(e,t) -> Cons(f e, loop t)
452 | Concat(t1,t2) -> Concat(loop t1,loop t2)
454 { l with node = loop l.node }
459 module Run (RS : ResultSet) =
462 module SList = Hlist.Make (StateSet)
468 module IntSet = Set.Make(struct type t = int let compare = (-) end)
469 INCLUDE "html_trace.ml"
473 let td_trans = Hashtbl.create 4096
474 let mk_fun f s = D_IGNORE_(register_funname f s,f)
475 let mk_app_fun f arg s = let g = f arg in
476 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
478 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
480 let choose_jump tagset qtags1 qtagsn a f_nil f_text f_t1 f_s1 f_tn f_sn f_notext =
481 let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in
482 let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in
483 if (hastext1||hastextn) then f_text (* jumping to text nodes doesn't work really well *)
484 else if (Ptset.Int.is_empty tags1) && (Ptset.Int.is_empty tagsn) then f_nil
485 else if (Ptset.Int.is_empty tagsn) then
486 if (Ptset.Int.is_singleton tags1)
487 then (* TaggedChild/Sibling *)
488 let tag = (Ptset.Int.choose tags1) in mk_app_fun f_t1 tag (Tag.to_string tag)
489 else (* SelectChild/Sibling *)
490 mk_app_fun f_s1 tags1 (string_of_ts tags1)
491 else if (Ptset.Int.is_empty tags1) then
492 if (Ptset.Int.is_singleton tagsn)
493 then (* TaggedDesc/Following *)
494 let tag = (Ptset.Int.choose tagsn) in mk_app_fun f_tn tag (Tag.to_string tag)
495 else (* SelectDesc/Following *)
496 mk_app_fun f_sn tagsn (string_of_ts tagsn)
499 let choose_jump_down a b c d =
501 (mk_fun (Tree.mk_nil) "Tree.mk_nil")
502 (mk_fun (Tree.text_below) "Tree.text_below")
503 (mk_fun (fun _ -> Tree.node_child) "[TaggedChild]Tree.node_child") (* !! no tagged_child in Tree.ml *)
504 (mk_fun (fun _ -> Tree.node_child) "[SelectChild]Tree.node_child") (* !! no select_child in Tree.ml *)
505 (mk_fun (Tree.tagged_desc) "Tree.tagged_desc")
506 (mk_fun (fun _ -> Tree.node_child ) "[SelectDesc]Tree.node_child") (* !! no select_desc *)
507 (mk_fun (Tree.node_child) "Tree.node_child")
509 let choose_jump_next a b c d =
511 (mk_fun (fun t _ -> Tree.mk_nil t) "Tree.mk_nil2")
512 (mk_fun (Tree.text_next) "Tree.text_next")
513 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[TaggedSibling]Tree.node_sibling_ctx")(* !! no tagged_sibling in Tree.ml *)
514 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[SelectSibling]Tree.node_sibling_ctx")(* !! no select_sibling in Tree.ml *)
515 (mk_fun (Tree.tagged_foll_ctx) "Tree.tagged_foll_ctx")
516 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[SelectFoll]Tree.node_sibling_ctx")(* !! no select_foll *)
517 (mk_fun (Tree.node_sibling_ctx) "Tree.node_sibling_ctx")
519 let get_trans slist tag a t =
521 Hashtbl.find td_trans (tag,SList.hash slist)
524 let fl_list,llist,rlist,ca,da,sa,fa =
526 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
527 let fl,ll,rr,ca,da,sa,fa =
531 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
533 if (TagSet.mem tag ts)
535 let _,_,f,_ = Transition.node t in
536 let (child,desc,below),(sibl,foll,after) = Formula.st f in
537 (Formlist.cons t fl_acc,
538 StateSet.union ll_acc below,
539 StateSet.union rl_acc after,
540 StateSet.union child c_acc,
541 StateSet.union desc d_acc,
542 StateSet.union sibl s_acc,
543 StateSet.union foll f_acc)
545 try Hashtbl.find a.trans q
547 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
551 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
552 in fl::fll_acc, (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
553 slist ([],SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
555 (* Logic to chose the first and next function *)
556 let tags_below,tags_after = Tree.tags t tag in
557 let first = choose_jump_down tags_below ca da a
558 and next = choose_jump_next tags_after sa fa a in
559 let v = (fl_list,llist,rlist,first,next) in
560 Hashtbl.add td_trans (tag, SList.hash slist) v; v
562 let merge rb rb1 rb2 mark t res1 res2 =
565 let res1 = if rb1 then res1 else RS.empty
566 and res2 = if rb2 then res2 else RS.empty
568 if mark then RS.cons t (RS.concat res1 res2)
569 else RS.concat res1 res2
573 let rec loop acc = function 0 -> acc
574 | n -> loop (SList.cons StateSet.empty acc) (n-1)
577 let top_down ?(noright=false) a t slist ctx slot_size =
578 let pempty = empty_size slot_size in
579 let eval_fold2_slist fll sl1 sl2 res1 res2 t =
580 let res = Array.copy res1 in
581 let rec fold l1 l2 fll i aq =
582 match SList.node l1,SList.node l2, fll with
583 | SList.Cons(s1,ll1),
586 let r',rb,rb1,rb2,mark = eval_formlist s1 s2 fl in
587 let _ = res.(i) <- merge rb rb1 rb2 mark t res1.(i) res2.(i)
589 fold ll1 ll2 fll (i+1) (SList.cons r' aq)
590 | SList.Nil, SList.Nil,[] -> aq,res
593 fold sl1 sl2 fll 0 SList.nil
595 let null_result() = (pempty,Array.make slot_size RS.empty) in
596 let rec loop t slist ctx =
597 if Tree.is_nil t then null_result()
599 let tag = Tree.tag t in
600 let fl_list,llist,rlist,first,next = get_trans slist tag a t in
601 let sl1,res1 = loop (first t) llist t in
602 let sl2,res2 = loop (next t ctx) rlist ctx in
603 let res = eval_fold2_slist fl_list sl1 sl2 res1 res2 t
606 register_trace t (slist,(fst res),sl1,sl2,fl_list,first,next,ctx),
609 let loop_no_right t slist ctx =
610 if Tree.is_nil t then null_result()
612 let tag = Tree.tag t in
613 let fl_list,llist,rlist,first,next = get_trans slist tag a t in
614 let sl1,res1 = loop (first t) llist t in
615 let sl2,res2 = null_result() in
616 let res = eval_fold2_slist fl_list sl1 sl2 res1 res2 t
619 register_trace t (slist,(fst res),sl1,sl2,fl_list,first,next,ctx),
622 (if noright then loop_no_right else loop) t slist ctx
625 let run_top_down a t =
626 let init = SList.cons a.init SList.nil in
627 let _,res = top_down a t init t 1
630 output_trace a t "trace.html"
631 (RS.fold (fun t a -> IntSet.add (Tree.id t) a) res.(0) IntSet.empty),
635 module Configuration =
637 module Ptss = Set.Make(StateSet)
638 module IMap = Map.Make(StateSet)
639 type t = { hash : int;
641 results : RS.t IMap.t }
642 let empty = { hash = 0;
644 results = IMap.empty;
646 let is_empty c = Ptss.is_empty c.sets
648 if Ptss.mem s c.sets then
649 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
651 { hash = HASHINT2(c.hash,Ptset.Int.uid s);
652 sets = Ptss.add s c.sets;
653 results = IMap.add s r c.results
656 let pr fmt c = Format.fprintf fmt "{";
657 Ptss.iter (fun s -> StateSet.print fmt s;
658 Format.fprintf fmt " ") c.sets;
659 Format.fprintf fmt "}\n%!";
660 IMap.iter (fun k d ->
661 StateSet.print fmt k;
662 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
663 Format.fprintf fmt "\n%!"
666 let acc1 = IMap.fold (fun s r acc ->
669 RS.concat r (IMap.find s acc)
671 | Not_found -> r) acc) c1.results IMap.empty
674 IMap.fold (fun s r acc ->
677 RS.concat r (IMap.find s acc)
679 | Not_found -> r) acc) c2.results acc1
683 (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.uid s),
685 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
693 let h_fold = Hashtbl.create 511
695 let fold_f_conf t slist fl_list conf dir=
696 let rec loop sl fl acc =
697 match SList.node sl,fl with
699 |SList.Cons(s,sll), formlist::fll ->
700 let r',rb,rb1,rb2,mark =
701 let key = SList.hash sl,Formlist.hash formlist,dir in
703 Hashtbl.find h_fold key
705 Not_found -> let res =
706 if dir then eval_formlist s Ptset.Int.empty formlist
707 else eval_formlist Ptset.Int.empty s formlist
708 in (Hashtbl.add h_fold key res;res)
710 if rb && ((dir&&rb1)|| ((not dir) && rb2))
714 try Configuration.IMap.find s conf.Configuration.results
715 with Not_found -> RS.empty
717 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
720 else loop sll fll acc
723 loop slist fl_list Configuration.empty
725 let h_trans = Hashtbl.create 4096
727 let get_up_trans slist ptag a tree =
728 let key = (HASHINT2(SList.uid slist,ptag)) in
730 Hashtbl.find h_trans key
734 Hashtbl.fold (fun q l acc ->
735 List.fold_left (fun fl_acc (ts,t) ->
736 if TagSet.mem ptag ts then Formlist.cons t fl_acc
742 let res = SList.fold (fun _ acc -> f_list::acc) slist []
744 (Hashtbl.add h_trans key res;res)
747 let h_tdconf = Hashtbl.create 511
748 let rec bottom_up a tree conf next jump_fun root dotd init accu =
749 if (not dotd) && (Configuration.is_empty conf ) then
754 let below_right = Tree.is_below_right tree next in
756 let accu,rightconf,next_of_next =
757 if below_right then (* jump to the next *)
758 bottom_up a next conf (jump_fun next) jump_fun (Tree.next_sibling tree) true init accu
759 else accu,Configuration.empty,next
763 if below_right then prepare_topdown a tree true
764 else prepare_topdown a tree false
768 (Configuration.merge rightconf sub, next_of_next)
770 if Tree.equal tree root then accu,conf,next
772 let parent = Tree.binary_parent tree in
773 let ptag = Tree.tag parent in
774 let dir = Tree.is_left tree in
775 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
776 let fl_list = get_up_trans slist ptag a parent in
777 let slist = SList.rev (slist) in
778 let newconf = fold_f_conf parent slist fl_list conf dir in
779 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
780 if Ptset.Int.intersect s init then
781 ( RS.concat res ar ,nc)
782 else (ar,Configuration.add nc s res))
783 (newconf.Configuration.results) (accu,Configuration.empty)
786 bottom_up a parent newconf next jump_fun root false init accu
788 and prepare_topdown a t noright =
789 let tag = Tree.tag t in
790 (* pr "Going top down on tree with tag %s = %s "
791 (if Tree.is_nil t then "###" else (Tag.to_string(Tree.tag t))) (Tree.dump_node t); *)
794 Hashtbl.find h_tdconf tag
797 let res = Hashtbl.fold (fun q l acc ->
798 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
799 then Ptset.Int.add q acc
800 else acc) a.trans Ptset.Int.empty
801 in Hashtbl.add h_tdconf tag res;res
803 (* let _ = pr ", among ";
804 StateSet.print fmt (Ptset.Int.elements r);
807 let r = SList.cons r SList.nil in
808 let set,res = top_down (~noright:noright) a t r t 1 in
809 let set = match SList.node set with
810 | SList.Cons(x,_) ->x
813 (* pr "Result of topdown run is %!";
814 StateSet.print fmt (Ptset.Int.elements set);
815 pr ", number is %i\n%!" (RS.length res.(0)); *)
816 Configuration.add Configuration.empty set res.(0)
820 let run_bottom_up a t k =
821 let trlist = Hashtbl.find a.trans (Ptset.Int.choose a.init)
823 let init = List.fold_left
825 let _,_,f,_ = Transition.node t in
826 let _,_,l = fst ( Formula.st f ) in
827 Ptset.Int.union acc l)
828 Ptset.Int.empty trlist
833 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
834 (Tree.tagged_desc tag t, fun tree -> Tree.tagged_foll_ctx tag tree t)
835 | `CONTAINS(_) -> (Tree.text_below t,fun tree -> Tree.text_next tree t)
838 let tree2 = jump_fun tree1 in
839 let rec loop tree next acc =
840 (* let _ = pr "\n_________________________\nNew iteration\n" in
841 let _ = pr "Jumping to %s\n%!" (Tree.dump_node tree) in *)
842 let acc,conf,next_of_next = bottom_up a tree
843 Configuration.empty next jump_fun (Tree.root tree) true init acc
845 (* let _ = pr "End of first iteration, conf is:\n%!";
846 Configuration.pr fmt conf
848 let acc = Configuration.IMap.fold
849 ( fun s res acc -> if Ptset.Int.intersect init s
850 then RS.concat res acc else acc) conf.Configuration.results acc
852 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
854 else loop next_of_next (jump_fun next_of_next) acc
856 loop tree1 tree2 RS.empty
861 let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
862 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
863 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)