+
+let compile_top_level_step_list l trans states =
+ let rec loop l trans states phi_above =
+ match l with
+ | (axis, test, elist) :: [] ->
+ let phi0, trans0, states0 =
+ compile_rev_axis_test axis QNameSet.any phi_above trans states
+ in
+ let phi1, trans1, states1 =
+ List.fold_left (fun (aphi, atrans, astates) e ->
+ let ephi, etrans, estates = compile_expr e atrans astates in
+ aphi %% ephi, etrans, estates) (phi0, trans0, states0) elist
+ in
+ let _, trans2, states2 =
+ compile_axis_test Self test phi1 trans1 states1
+ in
+ let marking_state =
+ StateSet.choose (StateSet.diff states2 states1)
+ in
+ marking_state, trans2, states2
+ | (axis, test, elist) :: ll ->
+ let phi0, trans0, states0 =
+ compile_rev_axis_test axis QNameSet.any phi_above trans states
+ in
+ let phi1, trans1, states1 =
+ compile_axis_test Self test phi0 trans0 states0
+ in
+ let phi2, trans2, states2 =
+ List.fold_left (fun (aphi, atrans, astates) e ->
+ let ephi, etrans, estates = compile_expr e atrans astates in
+ aphi %% ephi, etrans, estates) (phi1, trans1, states1) elist
+ in
+ loop ll trans2 states2 phi2
+ | _ -> assert false
+ in
+ let phi0, trans0, states0 =
+ compile_axis_test
+ Self
+ (QNameSet.singleton QName.document)
+ Ata.SFormula.true_
+ trans
+ states
+ in
+ loop l trans0 states0 phi0
+;;
+
+
+let path p =
+ let mstates, trans, states = List.fold_left (fun (ams, atrs, asts) p ->
+ let ms, natrs, nasts =
+ match p with
+ | Absolute l | Relative l -> compile_top_level_step_list l atrs asts
+ in
+ (StateSet.add ms ams), natrs, nasts) (StateSet.empty, [], StateSet.empty) p
+ in
+ let a = Ata.create () in
+ a.Ata.states <- states;
+ a.Ata.selection_states <- mstates;
+ List.iter (fun (q, l) ->
+ List.iter (fun (lab, phi) ->
+ Ata.add_trans a q lab phi
+ ) l) trans;
+ Ata.complete_transitions a;
+ Ata.normalize_negations a;
+ a