(***********************************************************************)
(*
- Time-stamp: <Last modified on 2013-03-10 23:31:33 CET by Kim Nguyen>
+ Time-stamp: <Last modified on 2013-03-13 14:56:29 CET by Kim Nguyen>
*)
INCLUDE "utils.ml"
(trs::acct, accs)
) ([], acc) l
- let top_down_run auto tree node cache i =
+ let top_down_run auto tree node cache _i =
let redo = ref false in
let rec loop node =
if node != T.nil then begin
let ps = get cache tree parent in
let fcs = get cache tree fc in
let nss = get cache tree ns in
- eprintf "-- [Iteration % 4d] --\n node: %a\n%!" i T.print_node node;
- List.iter (fun (q, phi) -> eprintf " %a -> %a\n"
- State.print q Ata.SFormula.print phi) trans0;
- eprintf "----------------------\n%!";
let trans1, states1 =
eval_trans trans0 tree node fcs nss ps states0 states0
in