X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=src%2Fcompil.ml;h=720bb98f86b0b0f2043a0a4c00b59167be503d5d;hb=56887cd3c475e6ee16a7ee5953dfc3d687a12452;hp=610360bb9dc37751e24644e9d02911cfffbad301;hpb=e80e269c313952b4d427fa6a5a9729ea15e43f39;p=tatoo.git

diff --git a/src/compil.ml b/src/compil.ml
index 610360b..720bb98 100644
--- a/src/compil.ml
+++ b/src/compil.ml
@@ -16,34 +16,119 @@
 open XPath.Ast
 open Formula.Infix
 
-exception Not_core_XPath of path
+exception Not_core_XPath
 (** Raised whenever the XPath query contains not implemented structures *)
 
+let pr_er = Format.err_formatter
+
 let trans query =
   let asta = Asta.empty in
-  let rec trans = function
+  (* Buidling of the ASTA step by step with a special case for the last
+     step. Then add a top most state. Each function modifies asta. *)
+  let rec trans = function		(* builds asta from the bottom of the query *)
     | [s] -> trans_last s
-    | s :: tl -> trans_step s; trans tl
+    | s :: tl ->  trans tl; trans_step s
     | [] -> ()
       
-  and trans_init () = 			(* add THE top state  *)
+  and trans_init () = 			(* add THE top most state  *)
     let top_st = Asta.new_state () in
     let or_top = 
-      List.fold_left (fun acc x -> (`Left *+ x +| acc))
-	Formula.true_ (Asta.top_states asta)
+      List.fold_left (fun acc x -> ((`Left *+ x) +| acc))
+	(Formula.false_) (Asta.top_states asta)
     in
-    Asta.add_tr asta (top_st, Asta.any_label, or_top)
+    Asta.add_quer asta top_st;
+    Asta.init_top asta;
+    Asta.add_top asta top_st;
+    Asta.add_bot asta top_st;	(* for trees which are leaves *)
+    Asta.add_tr asta (top_st, Asta.any_label, or_top) true
       
   and trans_last (ax,test,pred) =	(* a selecting state is needed *)
-    ()
+    let fo_p = trans_pr pred in
+    let q,q' = Asta.new_state(), Asta.new_state() in
+    Asta.add_selec asta q';
+    Asta.add_quer asta q;
+    Asta.add_quer asta q';
+    Asta.add_top asta q;
+    Asta.add_top asta q';
+    Asta.add_bot asta q;		(* q' \notin B !! *)
+    let Simple lab = test in
+    let tr_selec = (q', lab, fo_p)
+    and tr_q = (q, Asta.any_label, form_propa_selec q q' ax) in
+    Asta.add_tr asta tr_selec true;
+    Asta.add_tr asta tr_q true
+    
+  and trans_step (ax,test,pred) =	(* add a new state for the step *)
+    let fo_p = trans_pr pred
+    and q = Asta.new_state() in
+    let Simple label = test
+    and form_next = (fo_p) *&                    (* (\/ top_next) /\ predicat *)
+      (List.fold_left (fun acc x -> (`Left *+ x ) +| acc)
+	 Formula.false_ (Asta.top_states asta)) 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
+      
+  and trans_pr  = function		(* either we apply De Morgan rules
+					   in xPath.parse or here *)
+    | Expr True -> Formula.true_
+    | Expr False -> Formula.false_
+    | Or (p_1,p_2) -> trans_pr(p_1) +| trans_pr(p_2)
+    | And (p_1,p_2) -> trans_pr(p_1) *& trans_pr(p_2)
+    | Not (Expr Path q) -> (trans_pr_path false q)
+    | Expr Path q -> (trans_pr_path true q)
+    | x -> print_predicate pr_er x; raise Not_core_XPath
       
-  and trans_step (ax,test,pred) =
-    ()
+  and trans_pr_path posi = function		(* builds asta for predicate and gives
+						   the formula which must be satsified *)
+    | Relative [] -> if posi then Formula.true_ else Formula.false_
+    | Relative steps -> List.fold_left
+      (fun acc x -> if posi then (`Left *+ x) +| acc else (`Left *- x) +| acc)
+      Formula.false_ (trans_pr_step_l steps)
+    | AbsoluteDoS steps as x -> print pr_er x; raise Not_core_XPath
+    | Absolute steps as x -> print pr_er x; raise Not_core_XPath
       
-  and trans_pr p = ()
+  and trans_pr_step_l = function	(* builds asta for a predicate query *)
+    | [step] -> trans_pr_step [] step
+    | step :: tl -> let list_top = trans_pr_step_l tl in
+		    trans_pr_step list_top step
+    | [] -> failwith "Can not happened! 1"
+
+  and trans_pr_step list (ax,test,pred) = (* add a step on the top of
+					     list in a predicate *)
+    let form_next =
+      if list = []
+      then trans_pr pred
+      else (trans_pr pred) *&
+	(List.fold_left (fun acc x -> (`Left *+ x) +| acc)
+	   Formula.false_ list)
+    and q = Asta.new_state() 
+    and Simple label = test in
+    let tr_next = (q,label, form_next)
+    and tr_propa = (q, Asta.any_label, form_propa q ax) in
+    Asta.add_reco asta q;
+    Asta.add_tr asta tr_next false;
+    Asta.add_tr asta tr_propa false;
+    [q]					(* always one element here, but not with self
+					   axis*)
 
+  and form_propa q = function		(* gives the propagation formula *)
+    | Child -> `Right *+ q
+    | Descendant -> (`Left *+ q +| `Right *+ q)
+    | x -> print_axis pr_er x; raise Not_core_XPath 
+
+  and form_propa_selec q q' = function	(* the same with a  selecting state *)
+    | Child -> `Right *+ q +| `Right *+ q'
+    | Descendant -> (`Left *+ q +| `Right *+ q) +| (`Left *+ q' +| `Right *+ q')
+    | x -> print_axis pr_er x; raise Not_core_XPath 
+      
   in
-  match query with
-    | Absolute steps -> trans_init(); trans steps; asta
-    | AbsoluteDoS steps as x -> raise (Not_core_XPath x)
-    | Relative steps as x -> raise (Not_core_XPath x)
+  match query with			(* match the top-level query *)
+    | Absolute steps -> trans steps; trans_init(); asta
+    | AbsoluteDoS steps as x -> print pr_er x; raise Not_core_XPath
+    | Relative steps as x -> print pr_er x; raise Not_core_XPath