+and compile_path paths trans states =
+ List.fold_left (fun (aphi, atrans, astates) p ->
+ let phi, ntrans, nstates = compile_single_path p atrans astates in
+ (Ata.SFormula.or_ phi aphi),
+ ntrans,
+ nstates) (Ata.SFormula.false_,trans,states) paths
+
+and compile_single_path p trans states =
+ let steps =
+ match p with
+ | Absolute steps ->
+ (Ancestor false, QNameSet.singleton QName.document, [])::steps
+ | Relative steps -> steps
+ in
+ compile_step_list steps trans states
+
+and compile_step_list l trans states =
+ match l with
+ | [] -> Ata.SFormula.true_, trans, states
+ | (axis, test, elist) :: ll ->
+ let phi0, trans0, states0 = compile_step_list ll trans states in
+ let phi1, trans1, states1 =
+ compile_axis_test axis test phi0 trans0 states0
+ in
+ 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
+
+let compile_top_level_step_list l trans states =
+ let rec loop l trans states block_attr phi_above =
+ match l with
+ | (axis, test, elist) :: [] ->
+ let phi0, trans0, states0 =
+ compile_rev_axis_test
+ block_attr 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 phi' =
+ if axis = Attribute then
+ F.is_attribute
+ else
+ F.not_ F.is_attribute
+ in
+ let _, trans2, states2 =
+ compile_axis_test Self test (phi1 %% phi') 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
+ block_attr 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 (axis != Attribute) 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 true 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