6 type jump_kind = [ `TAG of Tag.t | `CONTAINS of string | `NOTHING ]
8 (* Todo : move elsewhere *)
9 external vb : bool -> int = "%identity"
13 include Sigs.T with type t = int
23 external hash : t -> int = "%identity"
24 let print fmt x = Format.fprintf fmt "%i" x
25 let dump fmt x = print fmt x
27 if x < 0 then failwith (Printf.sprintf "State: Assertion %i < 0 failed" x)
30 module StateSet = struct
33 Format.pp_print_string ppf "{ ";
34 iter (fun i -> Format.fprintf ppf "%i " i) s;
35 Format.pp_print_string ppf "}";
36 Format.pp_print_flush ppf ()
43 | Or of 'hcons * 'hcons
44 | And of 'hcons * 'hcons
45 | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*State.t)
49 st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t);
50 size: int; (* Todo check if this is needed *)
53 external hash_const_variant : [> ] -> int = "%identity"
54 module rec HNode : Hcons.S with type data = Node.t = Hcons.Make (Node)
55 and Node : Hashtbl.HashedType with type t = HNode.t node =
58 let equal x y = x.size == y.size &&
59 match x.pos,y.pos with
62 | Or(xf1,xf2),Or(yf1,yf2)
63 | And(xf1,xf2),And(yf1,yf2) -> (HNode.equal xf1 yf1) && (HNode.equal xf2 yf2)
64 | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2
70 | Or (f1,f2) -> HASHINT3(PRIME2,HNode.hash f1,HNode.hash f2)
71 | And (f1,f2) -> HASHINT3(PRIME3,HNode.hash f1,HNode.hash f2)
72 | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s)
78 let equal = HNode.equal
79 let expr f = (HNode.node f).pos
80 let st f = (HNode.node f ).st
81 let size f = (HNode.node f).size
90 let rec print ?(parent=false) ppf f =
91 if parent then Format.fprintf ppf "(";
92 let _ = match expr f with
93 | True -> Format.fprintf ppf "T"
94 | False -> Format.fprintf ppf "F"
96 print ~parent:(prio f > prio f1) ppf f1;
97 Format.fprintf ppf " ∧ ";
98 print ~parent:(prio f > prio f2) ppf f2;
101 Format.fprintf ppf " ∨ ";
103 | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]"
104 (if b then "" else "¬")
111 if parent then Format.fprintf ppf ")"
113 let print ppf f = print ~parent:false ppf f
115 let is_true f = (expr f) == True
116 let is_false f = (expr f) == False
119 let cons pos neg s1 s2 size1 size2 =
120 let nnode = HNode.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
121 let pnode = HNode.make { pos = pos; neg = nnode ; st = s1; size = size1 }
123 (HNode.node nnode).neg <- pnode; (* works because the neg field isn't taken into
124 account for hashing ! *)
127 let empty_triple = StateSet.empty,StateSet.empty,StateSet.empty
128 let empty_hex = empty_triple,empty_triple
129 let true_,false_ = cons True False empty_hex empty_hex 0 0
131 let si = StateSet.singleton s in
132 let ss = match d with
133 | `Left -> (si,StateSet.empty,si),empty_triple
134 | `Right -> empty_triple,(si,StateSet.empty,si)
135 | `LLeft -> (StateSet.empty,si,si),empty_triple
136 | `RRight -> empty_triple,(StateSet.empty,si,si)
137 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
139 let not_ f = (HNode.node f).neg
140 let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) =
141 (StateSet.mem_union l1 l2 ,StateSet.mem_union ll1 ll2,StateSet.mem_union lll1 lll2),
142 (StateSet.mem_union r1 r2 ,StateSet.mem_union rr1 rr2,StateSet.mem_union rrr1 rrr2)
144 let merge_states f1 f2 =
146 union_hex (st f1) (st f2)
148 union_hex (st (not_ f1)) (st (not_ f2))
152 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
155 (* Tautologies: x|x, x|not(x) *)
157 if equal f1 f2 then f1 else
158 if equal f1 (not_ f2) then true_ else
161 if is_true f1 || is_true f2 then true_ else
162 if is_false f1 && is_false f2 then false_ else
163 if is_false f1 then f2 else
164 if is_false f2 then f1 else
166 (* commutativity of | *)
168 let f1,f2 = order f1 f2 in
169 let psize = (size f1) + (size f2) in
170 let nsize = (size (not_ f1)) + (size (not_ f2)) in
171 let sp,sn = merge_states f1 f2 in
172 fst (cons (Or(f1,f2)) (And(not_ f1,not_ f2)) sp sn psize nsize)
177 (* Tautologies: x&x, x¬(x) *)
179 if equal f1 f2 then f1 else
180 if equal f1 (not_ f2) then false_ else
182 (* simplifications *)
184 if is_true f1 && is_true f2 then true_ else
185 if is_false f1 || is_false f2 then false_ else
186 if is_true f1 then f2 else
187 if is_true f2 then f1 else
189 (* commutativity of & *)
191 let f1,f2 = order f1 f2 in
192 let psize = (size f1) + (size f2) in
193 let nsize = (size (not_ f1)) + (size (not_ f2)) in
194 let sp,sn = merge_states f1 f2 in
195 fst (cons (And(f1,f2)) (Or(not_ f1,not_ f2)) sp sn psize nsize)
196 module Infix = struct
197 let ( +| ) f1 f2 = or_ f1 f2
198 let ( *& ) f1 f2 = and_ f1 f2
199 let ( *+ ) d s = atom_ d true s
200 let ( *- ) d s = atom_ d false s
204 module Transition = struct
206 type node = State.t*bool*Formula.t*bool
207 include Hcons.Make(struct
209 let hash (s,m,f,b) = HASHINT4(s,Formula.uid f,vb m,vb b)
210 let equal (s,b,f,m) (s',b',f',m') =
211 s == s' && b==b' && m==m' && Formula.equal f f'
214 let print ppf f = let (st,mark,form,b) = node f in
215 Format.fprintf ppf "%i %s" st (if mark then "⇒" else "→");
216 Formula.print ppf form;
217 Format.fprintf ppf "%s%!" (if b then " (b)" else "")
220 module Infix = struct
222 let ( >< ) state (l,mark) = state,(l,mark,false)
223 let ( ><@ ) state (l,mark) = state,(l,mark,true)
224 let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,mark,form,bur)))
231 type t = Ptset.Int.t*Tag.t
232 let equal (s1,t1) (s2,t2) = (t1 == t2) && Ptset.Int.equal s1 s2
233 let hash (s,t) = HASHINT2(Ptset.Int.hash s,Tag.hash t)
236 module TransTable = Hashtbl
237 module CachedTransTable = Hashtbl.Make(SetTagKey)
239 module Formlist = struct
240 include Hlist.Make(Transition)
242 iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl
248 mutable states : Ptset.Int.t;
250 starstate : Ptset.Int.t option;
251 (* Transitions of the Alternating automaton *)
252 trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t;
253 query_string: string;
258 Format.fprintf ppf "Automaton (%i) :\n" a.id;
259 Format.fprintf ppf "States : "; StateSet.print ppf a.states;
260 Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init;
261 Format.fprintf ppf "\nAlternating transitions :\n";
262 let l = Hashtbl.fold (fun k t acc ->
263 (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in
264 let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) ->
265 if y-x == 0 then TagSet.compare tsy tsx else y-x) l in
266 let maxh,maxt,l_print =
268 fun (maxh,maxt,l) ((ts,q),(_,b,f,_)) ->
270 if TagSet.is_finite ts
271 then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }"
272 else let cts = TagSet.neg ts in
273 if TagSet.is_empty cts then "*" else
274 (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{"
277 let s = Printf.sprintf "(%s,%i)" s q in
279 Formula.print Format.str_formatter f;
280 Format.flush_str_formatter()
282 (max (String.length s) maxh, max (String.length s_frm) maxt,
283 (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l
285 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_');
286 List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in
287 Format.fprintf ppf "%s %s %s\n" s m f) l_print;
288 Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_')
291 module MemoForm = Memoizer.Make(
293 type t = Formula.t*(StateSet.t*StateSet.t)
294 let equal (f1,(s1,t1)) (f2,(s2,t2)) =
295 Formula.equal f1 f2 && StateSet.equal s1 s2 && StateSet.equal t1 t2
297 HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t)
304 fun eval (f, ((s1,s2) as sets)) ->
306 | F.True -> true,true,true
307 | F.False -> false,false,false
308 | F.Atom((`Left|`LLeft),b,q) ->
309 if b == (StateSet.mem q s1)
310 then (true,true,false)
311 else false,false,false
313 if b == (StateSet.mem q s2)
314 then (true,false,true)
315 else false,false,false
317 let b1,rl1,rr1 = eval (f1,sets)
319 if b1 && rl1 && rr1 then (true,true,true) else
320 let b2,rl2,rr2 = eval (f2,sets) in
321 let rl1,rr1 = if b1 then rl1,rr1 else false,false
322 and rl2,rr2 = if b2 then rl2,rr2 else false,false
323 in (b1 || b2, rl1||rl2,rr1||rr2)
326 let b1,rl1,rr1 = eval (f1,sets) in
327 if b1 && rl1 && rr1 then (true,true,true) else
329 let b2,rl2,rr2 = eval (f2,sets) in
330 if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false)
331 else (false,false,false)
334 let eval_form_bool f s1 s2 = eval_form_bool (f,(s1,s2))
337 module MemoFormlist = Memoizer.Make(
339 type t = Formlist.t*(StateSet.t*StateSet.t)
340 let equal (f1,(s1,t1)) (f2,(s2,t2)) =
341 Formlist.equal f1 f2 && StateSet.equal s1 s2 && StateSet.equal t1 t2
343 HASHINT3(Formlist.uid f ,StateSet.uid s,StateSet.uid t)
348 let eval_formlist = MemoFormlist.make_rec (
349 fun eval (fl,((s1,s2)as sets)) ->
350 match Formlist.node fl with
351 | Formlist.Nil -> StateSet.empty,false,false,false,false
352 | Formlist.Cons(f,fll) ->
353 let q,mark,f,_ = Transition.node f in
354 let b,b1,b2 = eval_form_bool f s1 s2 in
355 let s,b',b1',b2',amark = eval (fll,sets) in
356 if b then (StateSet.add q s, b, b1'||b1,b2'||b2,mark||amark)
357 else s,b',b1',b2',amark )
359 let eval_formlist ?(memo=true) s1 s2 fl =
360 eval_formlist (fl,(s1,s2))
363 let tags_of_state a q =
366 if p == q then List.fold_left
368 let _,_,_,aux = Transition.node t in
370 TagSet.cup ts acc) acc l
372 else acc) a.trans TagSet.empty
377 let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty
379 if TagSet.is_finite ts
380 then `Positive(TagSet.positive ts)
381 else `Negative(TagSet.negative ts)
385 | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true)
386 | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false)
388 let mk_nil_ctx x _ = Tree.mk_nil x
389 let next_sibling_ctx x _ = Tree.next_sibling x
393 module type ResultSet =
397 val cons : Tree.t -> t -> t
398 val concat : t -> t -> t
399 val iter : (Tree.t -> unit) -> t -> unit
400 val fold : (Tree.t -> 'a -> 'a) -> t -> 'a -> 'a
401 val map : (Tree.t -> Tree.t) -> t -> t
402 val length : t -> int
405 module Integer : ResultSet =
410 let concat x y = x + y
411 let iter _ _ = failwith "iter not implemented"
412 let fold _ _ _ = failwith "fold not implemented"
413 let map _ _ = failwith "map not implemented"
417 module IdSet : ResultSet =
420 | Cons of Tree.t * node
421 | Concat of node*node
423 and t = { node : node;
426 let empty = { node = Nil; length = 0 }
428 let cons e t = { node = Cons(e,t.node); length = t.length+1 }
429 let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length }
430 let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 }
433 let rec loop acc t = match t with
435 | Cons (e,t) -> loop (f e acc) t
436 | Concat (t1,t2) -> loop (loop acc t1) t2
440 let length l = l.length
444 let rec loop = function
446 | Cons (e,t) -> f e; loop t
447 | Concat(t1,t2) -> loop t1;loop t2
451 let rec loop = function
453 | Cons(e,t) -> Cons(f e, loop t)
454 | Concat(t1,t2) -> Concat(loop t1,loop t2)
456 { l with node = loop l.node }
461 module Run (RS : ResultSet) =
464 module SList = Hlist.Make (StateSet)
470 module IntSet = Set.Make(struct type t = int let compare = (-) end)
471 INCLUDE "html_trace.ml"
475 let td_trans = Hashtbl.create 4096
476 let mk_fun f s = D_IGNORE_(register_funname f s,f)
477 let mk_app_fun f arg s = let g = f arg in
478 D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g)
480 let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }"
482 let choose_jump tagset qtags1 qtagsn a f_nil f_text f_t1 f_s1 f_tn f_sn f_notext =
483 let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in
484 let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in
485 if (hastext1||hastextn) then f_text (* jumping to text nodes doesn't work really well *)
486 else if (Ptset.Int.is_empty tags1) && (Ptset.Int.is_empty tagsn) then f_nil
487 else if (Ptset.Int.is_empty tagsn) then
488 if (Ptset.Int.is_singleton tags1)
489 then (* TaggedChild/Sibling *)
490 let tag = (Ptset.Int.choose tags1) in mk_app_fun f_t1 tag (Tag.to_string tag)
491 else (* SelectChild/Sibling *)
492 mk_app_fun f_s1 tags1 (string_of_ts tags1)
493 else if (Ptset.Int.is_empty tags1) then
494 if (Ptset.Int.is_singleton tagsn)
495 then (* TaggedDesc/Following *)
496 let tag = (Ptset.Int.choose tagsn) in mk_app_fun f_tn tag (Tag.to_string tag)
497 else (* SelectDesc/Following *)
498 mk_app_fun f_sn tagsn (string_of_ts tagsn)
501 let choose_jump_down a b c d =
503 (mk_fun (Tree.mk_nil) "Tree.mk_nil")
504 (mk_fun (Tree.text_below) "Tree.text_below")
505 (mk_fun (fun _ -> Tree.node_child) "[TaggedChild]Tree.node_child") (* !! no tagged_child in Tree.ml *)
506 (mk_fun (fun _ -> Tree.node_child) "[SelectChild]Tree.node_child") (* !! no select_child in Tree.ml *)
507 (mk_fun (Tree.tagged_desc) "Tree.tagged_desc")
508 (mk_fun (fun _ -> Tree.node_child ) "[SelectDesc]Tree.node_child") (* !! no select_desc *)
509 (mk_fun (Tree.node_child) "Tree.node_child")
511 let choose_jump_next a b c d =
513 (mk_fun (fun t _ -> Tree.mk_nil t) "Tree.mk_nil2")
514 (mk_fun (Tree.text_next) "Tree.text_next")
515 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[TaggedSibling]Tree.node_sibling_ctx")(* !! no tagged_sibling in Tree.ml *)
516 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[SelectSibling]Tree.node_sibling_ctx")(* !! no select_sibling in Tree.ml *)
517 (mk_fun (Tree.tagged_foll_ctx) "Tree.tagged_foll_ctx")
518 (mk_fun (fun _ -> Tree.node_sibling_ctx) "[SelectFoll]Tree.node_sibling_ctx")(* !! no select_foll *)
519 (mk_fun (Tree.node_sibling_ctx) "Tree.node_sibling_ctx")
521 let get_trans slist tag a t =
523 Hashtbl.find td_trans (tag,SList.hash slist)
526 let fl_list,llist,rlist,ca,da,sa,fa =
528 (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *)
529 let fl,ll,rr,ca,da,sa,fa =
533 (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc)
535 if (TagSet.mem tag ts)
537 let _,_,f,_ = Transition.node t in
538 let (child,desc,below),(sibl,foll,after) = Formula.st f in
539 (Formlist.cons t fl_acc,
540 StateSet.union ll_acc below,
541 StateSet.union rl_acc after,
542 StateSet.union child c_acc,
543 StateSet.union desc d_acc,
544 StateSet.union sibl s_acc,
545 StateSet.union foll f_acc)
547 try Hashtbl.find a.trans q
549 Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!"
553 ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa)
554 in fl::fll_acc, (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa)
555 slist ([],SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty)
557 (* Logic to chose the first and next function *)
558 let tags_below,tags_after = Tree.tags t tag in
559 let first = choose_jump_down tags_below ca da a
560 and next = choose_jump_next tags_after sa fa a in
561 let v = (fl_list,llist,rlist,first,next) in
562 Hashtbl.add td_trans (tag, SList.hash slist) v; v
564 let merge rb rb1 rb2 mark t res1 res2 =
567 let res1 = if rb1 then res1 else RS.empty
568 and res2 = if rb2 then res2 else RS.empty
570 if mark then RS.cons t (RS.concat res1 res2)
571 else RS.concat res1 res2
575 let rec loop acc = function 0 -> acc
576 | n -> loop (SList.cons StateSet.empty acc) (n-1)
579 let top_down ?(noright=false) a t slist ctx slot_size =
580 let pempty = empty_size slot_size in
581 let eval_fold2_slist fll sl1 sl2 res1 res2 t =
582 let res = Array.copy res1 in
583 let rec fold l1 l2 fll i aq =
584 match SList.node l1,SList.node l2, fll with
585 | SList.Cons(s1,ll1),
588 let r',rb,rb1,rb2,mark = eval_formlist s1 s2 fl in
589 let _ = res.(i) <- merge rb rb1 rb2 mark t res1.(i) res2.(i)
591 fold ll1 ll2 fll (i+1) (SList.cons r' aq)
592 | SList.Nil, SList.Nil,[] -> aq,res
595 fold sl1 sl2 fll 0 SList.nil
597 let null_result() = (pempty,Array.make slot_size RS.empty) in
598 let rec loop t slist ctx =
599 if Tree.is_nil t then null_result()
601 let tag = Tree.tag t in
602 let fl_list,llist,rlist,first,next = get_trans slist tag a t in
603 let sl1,res1 = loop (first t) llist t in
604 let sl2,res2 = loop (next t ctx) rlist ctx in
605 let res = eval_fold2_slist fl_list sl1 sl2 res1 res2 t
608 register_trace t (slist,(fst res),sl1,sl2,fl_list,first,next,ctx),
611 let loop_no_right t slist ctx =
612 if Tree.is_nil t then null_result()
614 let tag = Tree.tag t in
615 let fl_list,llist,rlist,first,next = get_trans slist tag a t in
616 let sl1,res1 = loop (first t) llist t in
617 let sl2,res2 = null_result() in
618 let res = eval_fold2_slist fl_list sl1 sl2 res1 res2 t
621 register_trace t (slist,(fst res),sl1,sl2,fl_list,first,next,ctx),
624 (if noright then loop_no_right else loop) t slist ctx
627 let run_top_down a t =
628 let init = SList.cons a.init SList.nil in
629 let _,res = top_down a t init t 1
632 output_trace a t "trace.html"
633 (RS.fold (fun t a -> IntSet.add (Tree.id t) a) res.(0) IntSet.empty),
637 module Configuration =
639 module Ptss = Set.Make(StateSet)
640 module IMap = Map.Make(StateSet)
641 type t = { hash : int;
643 results : RS.t IMap.t }
644 let empty = { hash = 0;
646 results = IMap.empty;
648 let is_empty c = Ptss.is_empty c.sets
650 if Ptss.mem s c.sets then
651 { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results}
653 { hash = HASHINT2(c.hash,Ptset.Int.hash s);
654 sets = Ptss.add s c.sets;
655 results = IMap.add s r c.results
658 let pr fmt c = Format.fprintf fmt "{";
659 Ptss.iter (fun s -> StateSet.print fmt s;
660 Format.fprintf fmt " ") c.sets;
661 Format.fprintf fmt "}\n%!";
662 IMap.iter (fun k d ->
663 StateSet.print fmt k;
664 Format.fprintf fmt "-> %i\n" (RS.length d)) c.results;
665 Format.fprintf fmt "\n%!"
668 let acc1 = IMap.fold (fun s r acc ->
671 RS.concat r (IMap.find s acc)
673 | Not_found -> r) acc) c1.results IMap.empty
676 IMap.fold (fun s r acc ->
679 RS.concat r (IMap.find s acc)
681 | Not_found -> r) acc) c2.results acc1
685 (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.hash s),
687 (Ptss.union c1.sets c2.sets) (0,Ptss.empty)
695 let h_fold = Hashtbl.create 511
697 let fold_f_conf t slist fl_list conf dir=
698 let rec loop sl fl acc =
699 match SList.node sl,fl with
701 |SList.Cons(s,sll), formlist::fll ->
702 let r',rb,rb1,rb2,mark =
703 let key = SList.hash sl,Formlist.hash formlist,dir in
705 Hashtbl.find h_fold key
707 Not_found -> let res =
708 if dir then eval_formlist s Ptset.Int.empty formlist
709 else eval_formlist Ptset.Int.empty s formlist
710 in (Hashtbl.add h_fold key res;res)
712 if rb && ((dir&&rb1)|| ((not dir) && rb2))
716 try Configuration.IMap.find s conf.Configuration.results
717 with Not_found -> RS.empty
719 Configuration.add acc r' (if mark then RS.cons t old_r else old_r)
722 else loop sll fll acc
725 loop slist fl_list Configuration.empty
727 let h_trans = Hashtbl.create 4096
729 let get_up_trans slist ptag a tree =
730 let key = (HASHINT2(SList.hash slist,Tag.hash ptag)) in
732 Hashtbl.find h_trans key
736 Hashtbl.fold (fun q l acc ->
737 List.fold_left (fun fl_acc (ts,t) ->
738 if TagSet.mem ptag ts then Formlist.cons t fl_acc
744 let res = SList.fold (fun _ acc -> f_list::acc) slist []
746 (Hashtbl.add h_trans key res;res)
749 let h_tdconf = Hashtbl.create 511
750 let rec bottom_up a tree conf next jump_fun root dotd init accu =
751 if (not dotd) && (Configuration.is_empty conf ) then
756 let below_right = Tree.is_below_right tree next in
758 let accu,rightconf,next_of_next =
759 if below_right then (* jump to the next *)
760 bottom_up a next conf (jump_fun next) jump_fun (Tree.next_sibling tree) true init accu
761 else accu,Configuration.empty,next
765 if below_right then prepare_topdown a tree true
766 else prepare_topdown a tree false
770 (Configuration.merge rightconf sub, next_of_next)
772 if Tree.equal tree root then accu,conf,next
774 let parent = Tree.binary_parent tree in
775 let ptag = Tree.tag parent in
776 let dir = Tree.is_left tree in
777 let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in
778 let fl_list = get_up_trans slist ptag a parent in
779 let slist = SList.rev (slist) in
780 let newconf = fold_f_conf parent slist fl_list conf dir in
781 let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) ->
782 if Ptset.Int.intersect s init then
783 ( RS.concat res ar ,nc)
784 else (ar,Configuration.add nc s res))
785 (newconf.Configuration.results) (accu,Configuration.empty)
788 bottom_up a parent newconf next jump_fun root false init accu
790 and prepare_topdown a t noright =
791 let tag = Tree.tag t in
792 (* pr "Going top down on tree with tag %s = %s "
793 (if Tree.is_nil t then "###" else (Tag.to_string(Tree.tag t))) (Tree.dump_node t); *)
796 Hashtbl.find h_tdconf tag
799 let res = Hashtbl.fold (fun q l acc ->
800 if List.exists (fun (ts,_) -> TagSet.mem tag ts) l
801 then Ptset.Int.add q acc
802 else acc) a.trans Ptset.Int.empty
803 in Hashtbl.add h_tdconf tag res;res
805 (* let _ = pr ", among ";
806 StateSet.print fmt (Ptset.Int.elements r);
809 let r = SList.cons r SList.nil in
810 let set,res = top_down (~noright:noright) a t r t 1 in
811 let set = match SList.node set with
812 | SList.Cons(x,_) ->x
815 (* pr "Result of topdown run is %!";
816 StateSet.print fmt (Ptset.Int.elements set);
817 pr ", number is %i\n%!" (RS.length res.(0)); *)
818 Configuration.add Configuration.empty set res.(0)
822 let run_bottom_up a t k =
823 let trlist = Hashtbl.find a.trans (Ptset.Int.choose a.init)
825 let init = List.fold_left
827 let _,_,f,_ = Transition.node t in
828 let _,_,l = fst ( Formula.st f ) in
829 Ptset.Int.union acc l)
830 Ptset.Int.empty trlist
835 (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*)
836 (Tree.tagged_desc tag t, fun tree -> Tree.tagged_foll_ctx tag tree t)
837 | `CONTAINS(_) -> (Tree.text_below t,fun tree -> Tree.text_next tree t)
840 let tree2 = jump_fun tree1 in
841 let rec loop tree next acc =
842 (* let _ = pr "\n_________________________\nNew iteration\n" in
843 let _ = pr "Jumping to %s\n%!" (Tree.dump_node tree) in *)
844 let acc,conf,next_of_next = bottom_up a tree
845 Configuration.empty next jump_fun (Tree.root tree) true init acc
847 (* let _ = pr "End of first iteration, conf is:\n%!";
848 Configuration.pr fmt conf
850 let acc = Configuration.IMap.fold
851 ( fun s res acc -> if Ptset.Int.intersect init s
852 then RS.concat res acc else acc) conf.Configuration.results acc
854 if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then
856 else loop next_of_next (jump_fun next_of_next) acc
858 loop tree1 tree2 RS.empty
863 let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
864 let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
865 let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)