1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2013 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
17 Time-stamp: <Last modified on 2013-03-15 23:42:43 CET by Kim Nguyen>
24 type predicate = | First_child
31 | Is of (Tree.Common.NodeKind.t)
35 let is_move p = match p with
36 | First_child | Next_sibling
37 | Parent | Previous_sibling | Stay -> true
41 type atom = predicate * bool * State.t
43 module Atom : (Formula.ATOM with type data = atom) =
49 let equal n1 n2 = n1 = n2
50 let hash n = Hashtbl.hash n
53 include Hcons.Make(Node)
56 let p, b, q = a.node in
57 if not b then fprintf ppf "%s" Pretty.lnot;
59 | First_child -> fprintf ppf "FC(%a)" State.print q
60 | Next_sibling -> fprintf ppf "NS(%a)" State.print q
61 | Parent -> fprintf ppf "FC%s(%a)" Pretty.inverse State.print q
62 | Previous_sibling -> fprintf ppf "NS%s(%a)" Pretty.inverse State.print q
63 | Stay -> fprintf ppf "%s(%a)" Pretty.epsilon State.print q
64 | Is_first_child -> fprintf ppf "FC%s?" Pretty.inverse
65 | Is_next_sibling -> fprintf ppf "NS%s?" Pretty.inverse
66 | Is k -> fprintf ppf "is-%a?" Tree.Common.NodeKind.print k
67 | Has_first_child -> fprintf ppf "FC?"
68 | Has_next_sibling -> fprintf ppf "NS?"
71 let p, b, q = a.node in
79 include Formula.Make(Atom)
80 open Tree.Common.NodeKind
81 let mk_atom a b c = atom_ (Atom.make (a,b,c))
82 let mk_kind k = mk_atom (Is k) true State.dummy
84 (mk_atom Has_first_child true State.dummy)
86 let has_next_sibling =
87 (mk_atom Has_next_sibling true State.dummy)
90 (mk_atom Is_first_child true State.dummy)
93 (mk_atom Is_next_sibling true State.dummy)
96 (mk_atom (Is Attribute) true State.dummy)
99 (mk_atom (Is Element) true State.dummy)
101 let is_processing_instruction =
102 (mk_atom (Is ProcessingInstruction) true State.dummy)
105 (mk_atom (Is Comment) true State.dummy)
109 (mk_atom First_child true q)
114 (mk_atom Next_sibling true q)
119 (mk_atom Parent true q)
122 let previous_sibling q =
124 (mk_atom Previous_sibling true q)
128 (mk_atom Stay true q)
133 | Formula.Atom a -> let _, _, q = Atom.node a in
134 if q != State.dummy then StateSet.add q acc else acc
141 module Transition = Hcons.Make (struct
142 type t = State.t * QNameSet.t * SFormula.t
143 let equal (a, b, c) (d, e, f) =
144 a == d && b == e && c == f
146 HASHINT4 (PRIME1, a, ((QNameSet.uid b) :> int), ((SFormula.uid c) :> int))
150 module TransList : sig
151 include Hlist.S with type elt = Transition.t
152 val print : Format.formatter -> ?sep:string -> t -> unit
155 include Hlist.Make(Transition)
156 let print ppf ?(sep="\n") l =
158 let q, lab, f = Transition.node t in
159 fprintf ppf "%a, %a -> %a%s" State.print q QNameSet.print lab SFormula.print f sep) l
165 mutable states : StateSet.t;
166 mutable selection_states: StateSet.t;
167 transitions: (State.t, (QNameSet.t*SFormula.t) list) Hashtbl.t;
168 mutable cache2 : TransList.t Cache.N2.t;
169 mutable cache6 : (TransList.t*StateSet.t) Cache.N6.t;
172 let next = Uid.make_maker ()
174 let dummy2 = TransList.cons
175 (Transition.make (State.dummy,QNameSet.empty, SFormula.false_))
178 let dummy6 = (dummy2, StateSet.empty)
182 let auto = { id = next ();
184 selection_states = ss;
185 transitions = Hashtbl.create 17;
186 cache2 = Cache.N2.create dummy2;
187 cache6 = Cache.N6.create dummy6;
193 Cache.N2.iteri (fun _ _ _ b -> if b then incr n2) auto.cache2;
194 Cache.N6.iteri (fun _ _ _ _ _ _ _ b -> if b then incr n6) auto.cache6;
195 Format.eprintf "INFO: automaton %i, cache2: %i entries, cache6: %i entries\n%!"
196 (auto.id :> int) !n2 !n6
201 a.cache2 <- Cache.N2.create dummy2;
202 a.cache6 <- Cache.N6.create dummy6
205 let get_trans_aux a tag states =
206 StateSet.fold (fun q acc0 ->
208 let trs = Hashtbl.find a.transitions q in
209 List.fold_left (fun acc1 (labs, phi) ->
210 if QNameSet.mem tag labs then TransList.cons (Transition.make (q, labs, phi)) acc1 else acc1) acc0 trs
211 with Not_found -> acc0
212 ) states TransList.nil
215 let get_trans a tag states =
217 Cache.N2.find a.cache2
218 (tag.QName.id :> int) (states.StateSet.id :> int)
220 if trs == dummy2 then
221 let trs = get_trans_aux a tag states in
224 (tag.QName.id :> int)
225 (states.StateSet.id :> int) trs; trs)
230 let eval_form phi fcs nss ps ss is_left is_right has_left has_right kind =
232 begin match SFormula.expr phi with
233 Formula.True | Formula.False -> phi
235 let p, b, q = Atom.node a in begin
238 if b == StateSet.mem q fcs then SFormula.true_ else phi
240 if b == StateSet.mem q nss then SFormula.true_ else phi
241 | Parent | Previous_sibling ->
242 if b == StateSet.mem q ps then SFormula.true_ else phi
244 if b == StateSet.mem q ss then SFormula.true_ else phi
245 | Is_first_child -> SFormula.of_bool (b == is_left)
246 | Is_next_sibling -> SFormula.of_bool (b == is_right)
247 | Is k -> SFormula.of_bool (b == (k == kind))
248 | Has_first_child -> SFormula.of_bool (b == has_left)
249 | Has_next_sibling -> SFormula.of_bool (b == has_right)
251 | Formula.And(phi1, phi2) -> SFormula.and_ (loop phi1) (loop phi2)
252 | Formula.Or (phi1, phi2) -> SFormula.or_ (loop phi1) (loop phi2)
257 let int_of_conf is_left is_right has_left has_right kind =
258 ((Obj.magic kind) lsl 4) lor
259 ((Obj.magic is_left) lsl 3) lor
260 ((Obj.magic is_right) lsl 2) lor
261 ((Obj.magic has_left) lsl 1) lor
262 (Obj.magic has_right)
264 let eval_trans auto ltrs fcs nss ps ss is_left is_right has_left has_right kind =
265 let i = int_of_conf is_left is_right has_left has_right kind
266 and k = (fcs.StateSet.id :> int)
267 and l = (nss.StateSet.id :> int)
268 and m = (ps.StateSet.id :> int)
271 let rec loop ltrs ss =
272 let j = (ltrs.TransList.id :> int)
273 and n = (ss.StateSet.id :> int) in
274 let (new_ltrs, new_ss) as res =
275 let res = Cache.N6.find auto.cache6 i j k l m n in
276 if res == dummy6 then
278 TransList.fold (fun trs (acct, accs) ->
279 let q, lab, phi = Transition.node trs in
280 if StateSet.mem q accs then (acct, accs) else
284 is_left is_right has_left has_right kind
286 if SFormula.is_true new_phi then
287 (acct, StateSet.add q accs)
288 else if SFormula.is_false new_phi then
291 let new_tr = Transition.make (q, lab, new_phi) in
292 (TransList.cons new_tr acct, accs)
293 ) ltrs (TransList.nil, ss)
295 Cache.N6.add auto.cache6 i j k l m n res; res
299 if new_ss == ss then res else
309 [add_trans a q labels f] adds a transition [(q,labels) -> f] to the
310 automaton [a] but ensures that transitions remains pairwise disjoint
313 let add_trans a q s f =
314 let trs = try Hashtbl.find a.transitions q with Not_found -> [] in
316 List.fold_left (fun (acup, atrs) (labs, phi) ->
317 let lab1 = QNameSet.inter labs s in
318 let lab2 = QNameSet.diff labs s in
320 if QNameSet.is_empty lab1 then []
321 else [ (lab1, SFormula.or_ phi f) ]
324 if QNameSet.is_empty lab2 then []
325 else [ (lab2, SFormula.or_ phi f) ]
327 (QNameSet.union acup labs, tr1@ tr2 @ atrs)
328 ) (QNameSet.empty, []) trs
330 let rem = QNameSet.diff s cup in
331 let ntrs = if QNameSet.is_empty rem then ntrs
332 else (rem, f) :: ntrs
334 Hashtbl.replace a.transitions q ntrs
336 let _pr_buff = Buffer.create 50
337 let _str_fmt = formatter_of_buffer _pr_buff
338 let _flush_str_fmt () = pp_print_flush _str_fmt ();
339 let s = Buffer.contents _pr_buff in
340 Buffer.clear _pr_buff; s
344 "\nInternal UID: %i@\n\
346 Selection states: %a@\n\
347 Alternating transitions:@\n"
349 StateSet.print a.states
350 StateSet.print a.selection_states;
353 (fun q t acc -> List.fold_left (fun acc (s , f) -> (q,s,f)::acc) acc t)
357 let sorted_trs = List.stable_sort (fun (q1, s1, _) (q2, s2, _) ->
358 let c = State.compare q1 q2 in - (if c == 0 then QNameSet.compare s1 s2 else c))
361 let _ = _flush_str_fmt () in
362 let strs_strings, max_pre, max_all = List.fold_left (fun (accl, accp, acca) (q, s, f) ->
363 let s1 = State.print _str_fmt q; _flush_str_fmt () in
364 let s2 = QNameSet.print _str_fmt s; _flush_str_fmt () in
365 let s3 = SFormula.print _str_fmt f; _flush_str_fmt () in
366 let pre = Pretty.length s1 + Pretty.length s2 in
367 let all = Pretty.length s3 in
368 ( (q, s1, s2, s3) :: accl, max accp pre, max acca all)
369 ) ([], 0, 0) sorted_trs
371 let line = Pretty.line (max_all + max_pre + 6) in
372 let prev_q = ref State.dummy in
373 List.iter (fun (q, s1, s2, s3) ->
374 if !prev_q != q && !prev_q != State.dummy then fprintf fmt " %s\n%!" line;
376 fprintf fmt " %s, %s" s1 s2;
377 fprintf fmt "%s" (Pretty.padding (max_pre - Pretty.length s1 - Pretty.length s2));
378 fprintf fmt " %s %s@\n%!" Pretty.right_arrow s3;
380 fprintf fmt " %s\n%!" line
383 [complete transitions a] ensures that for each state q
384 and each symbols s in the alphabet, a transition q, s exists.
385 (adding q, s -> F when necessary).
388 let complete_transitions a =
389 StateSet.iter (fun q ->
390 let qtrans = Hashtbl.find a.transitions q in
392 List.fold_left (fun rem (labels, _) ->
393 QNameSet.diff rem labels) QNameSet.any qtrans
396 if QNameSet.is_empty rem then qtrans
398 (rem, SFormula.false_) :: qtrans
400 Hashtbl.replace a.transitions q nqtrans
403 let cleanup_states a =
404 let memo = ref StateSet.empty in
406 if not (StateSet.mem q !memo) then begin
407 memo := StateSet.add q !memo;
408 let trs = try Hashtbl.find a.transitions q with Not_found -> [] in
409 List.iter (fun (_, phi) ->
410 StateSet.iter loop (SFormula.get_states phi)) trs
413 StateSet.iter loop a.selection_states;
414 let unused = StateSet.diff a.states !memo in
415 eprintf "Unused states %a\n%!" StateSet.print unused;
416 StateSet.iter (fun q -> Hashtbl.remove a.transitions q) unused;
419 (* [normalize_negations a] removes negative atoms in the formula
420 complementing the sub-automaton in the negative states.
421 [TODO check the meaning of negative upward arrows]
424 let normalize_negations auto =
425 eprintf "Automaton before normalize_trans:\n";
426 print err_formatter auto;
427 eprintf "--------------------\n%!";
429 let memo_state = Hashtbl.create 17 in
430 let todo = Queue.create () in
432 match SFormula.expr f with
433 Formula.True | Formula.False -> if b then f else SFormula.not_ f
434 | Formula.Or(f1, f2) -> (if b then SFormula.or_ else SFormula.and_)(flip b f1) (flip b f2)
435 | Formula.And(f1, f2) -> (if b then SFormula.and_ else SFormula.or_)(flip b f1) (flip b f2)
436 | Formula.Atom(a) -> begin
437 let l, b', q = Atom.node a in
438 if q == State.dummy then if b then f else SFormula.not_ f
440 if b == b' then begin
441 (* a appears positively, either no negation or double negation *)
442 if not (Hashtbl.mem memo_state (q,b)) then Queue.add (q,true) todo;
443 SFormula.atom_ (Atom.make (l, true, q))
445 (* need to reverse the atom
446 either we have a positive state deep below a negation
447 or we have a negative state in a positive formula
448 b' = sign of the state
449 b = sign of the enclosing formula
453 (* does the inverted state of q exist ? *)
454 Hashtbl.find memo_state (q, false)
457 (* create a new state and add it to the todo queue *)
458 let nq = State.make () in
459 auto.states <- StateSet.add nq auto.states;
460 Hashtbl.add memo_state (q, false) nq;
461 Queue.add (q, false) todo; nq
463 SFormula.atom_ (Atom.make (l, true, not_q))
467 (* states that are not reachable from a selection stat are not interesting *)
468 StateSet.iter (fun q -> Queue.add (q, true) todo) auto.selection_states;
470 while not (Queue.is_empty todo) do
471 let (q, b) as key = Queue.pop todo in
474 Hashtbl.find memo_state key
477 let nq = if b then q else
478 let nq = State.make () in
479 auto.states <- StateSet.add nq auto.states;
482 Hashtbl.add memo_state key nq; nq
484 let trans = Hashtbl.find auto.transitions q in
485 let trans' = List.map (fun (lab, f) -> lab, flip b f) trans in
486 Hashtbl.replace auto.transitions q' trans';