- Asta.add_tr asta tr_selec;
- Asta.add_tr asta tr_q
-
- and trans_step (ax,test,pred) =
- ()
-
- and trans_pr = function (* either we apply De Morgan rules
- in xPath:parse or here *)
+ Asta.add_tr asta tr_selec true;
+ Asta.add_tr asta tr_q true
+
+ and form_next_step ax_next top_states_next form_pred =
+ match ax_next with
+ | Self -> (form_pred) *& (* (\/ top_next) /\ predicate *)
+ (List.fold_left (fun acc x -> (`Self *+ x ) +| acc)
+ Formula.false_ top_states_next)
+ | FollowingSibling -> (form_pred) *& (* (\/ top_next) /\ predicate *)
+ (List.fold_left (fun acc x -> (`Right *+ x ) +| acc)
+ Formula.false_ top_states_next)
+ | _ -> (form_pred) *& (* (\/ top_next) /\ predicate *)
+ (List.fold_left (fun acc x -> (`Left *+ x ) +| acc)
+ Formula.false_ top_states_next)
+
+ (* Add a new state and its transitions for the step *)
+ and trans_step (ax,test,pred) ax_next =
+ let fo_p = trans_pr pred
+ and q = Asta.new_state() in
+ let Simple label = test
+ and form_next = form_next_step ax_next (Asta.top_states asta) fo_p in
+ let tr_next = (q, label, form_next)
+ and tr_propa = (q, Asta.any_label, form_propa q ax) in
+ Asta.add_quer asta q;
+ Asta.add_top asta q;
+ Asta.add_bot asta q;
+ Asta.add_tr asta tr_next true;
+ Asta.add_tr asta tr_propa true;
+ Asta.init_top asta;
+ Asta.add_top asta q
+
+ (* Translating of predicates. Either we apply De Morgan rules
+ in xPath.parse or here *)
+ and trans_pr = function