(***********************************************************************)
(*
- Time-stamp: <Last modified on 2013-03-09 09:22:47 CET by Kim Nguyen>
+ Time-stamp: <Last modified on 2013-03-13 14:56:29 CET by Kim Nguyen>
*)
INCLUDE "utils.ml"
node == (T.first_child tree (T.parent tree node))
| Is_next_sibling ->
node == (T.next_sibling tree (T.parent tree node))
- | Is_attribute ->
- QName.has_attribute_prefix (T.tag tree node)
+ | Is k -> k == (T.kind tree node)
| Has_first_child ->
T.nil != T.first_child tree node
| Has_next_sibling ->
(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