1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2013 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 (***********************************************************************)
17 Time-stamp: <Last modified on 2013-04-04 18:45:19 CEST by Kim Nguyen>
23 module Make (T : Tree.S) :
25 val eval : Ata.t -> T.t -> T.node -> T.node list
39 type cache = StateSet.t Cache.N1.t
40 let get c t n = Cache.N1.find c (T.preorder t n)
42 let set c t n v = Cache.N1.add c (T.preorder t n) v
45 let top_down_run auto tree node cache _i =
46 let redo = ref false in
48 if node != T.nil then begin
49 let parent = T.parent tree node in
50 let fc = T.first_child tree node in
51 let ns = T.next_sibling tree node in
52 let tag = T.tag tree node in
53 let states0 = get cache tree node in
54 let trans0 = Ata.get_trans auto tag auto.Ata.states in
56 TRACE(Html.trace (T.preorder tree node) _i "Pre States: %a<br/>Pre Trans: %a<br/>"
57 StateSet.print states0 (Ata.TransList.print ~sep:"<br/>") trans0)
59 let ps = get cache tree parent in
60 let fcs = get cache tree fc in
61 let nss = get cache tree ns in
62 let is_left = node == T.first_child tree parent
63 and is_right = node == T.next_sibling tree parent
64 and has_left = fc != T.nil
65 and has_right = ns != T.nil
66 and kind = T.kind tree node
69 Ata.eval_trans auto trans0
71 is_left is_right has_left has_right kind
74 TRACE(Html.trace (T.preorder tree node) _i "TD States: %a<br/>TD Trans: %a<br/>" StateSet.print states1 (Ata.TransList.print ~sep:"<br/>") trans1)
76 if states1 != states0 then set cache tree node states1;
78 let fcs1 = get cache tree fc in
80 Ata.eval_trans auto trans1
82 is_left is_right has_left has_right kind
85 TRACE(Html.trace (T.preorder tree node) _i "Left BU States: %a<br/>Left BU Trans: %a<br/>" StateSet.print states2 (Ata.TransList.print ~sep:"<br/>") trans2)
87 if states2 != states1 then set cache tree node states2;
89 let _trans3, states3 =
90 Ata.eval_trans auto trans2
91 fcs1 (get cache tree ns) ps states2
92 is_left is_right has_left has_right kind
95 TRACE(Html.trace (T.preorder tree node) _i "Right BU States: %a<br/>Right BU Trans: %a<br/>" StateSet.print states3 (Ata.TransList.print ~sep:"<br/>") _trans3)
97 if states3 != states2 then set cache tree node states3;
98 if states0 != states3 && (not !redo) then redo := true
104 let get_results auto tree node cache =
105 let rec loop node acc =
106 if node == T.nil then acc
108 let acc0 = loop (T.next_sibling tree node) acc in
109 let acc1 = loop (T.first_child tree node) acc0 in
111 if StateSet.intersect (get cache tree node) auto.Ata.selection_states then
118 let eval auto tree node =
119 let cache = Cache.N1.create StateSet.empty in
120 let redo = ref true in
124 redo := top_down_run auto tree node cache !iter;
127 let r = get_results auto tree node cache in
128 TRACE(Html.gen_trace (module T : Tree.Sig.S with type t = T.t) (tree));