grew_rule.ml 32.2 KB
Newer Older
pj2m's avatar
pj2m committed
1 2 3
open Log
open Printf 

bguillaum's avatar
bguillaum committed
4 5
open Grew_utils
open Grew_ast
pj2m's avatar
pj2m committed
6
open Grew_edge
bguillaum's avatar
bguillaum committed
7
open Grew_fs
pj2m's avatar
pj2m committed
8
open Grew_node
bguillaum's avatar
bguillaum committed
9 10
open Grew_command
open Grew_graph
pj2m's avatar
pj2m committed
11

12
(* ================================================================================ *)
pj2m's avatar
pj2m committed
13 14
module Instance = struct
  type t = {
15
      graph: G_graph.t;
pj2m's avatar
pj2m committed
16 17 18 19 20
      commands: Command.h list;
      rules: string list;
      big_step: Grew_types.big_step option; 
    }

21
  let empty = {graph = G_graph.empty; rules=[]; commands=[]; big_step=None;}
pj2m's avatar
pj2m committed
22 23 24 25

  let from_graph g = {empty with graph = g} 

  let build gr_ast = 
26
    let graph = G_graph.build gr_ast.Ast.nodes gr_ast.Ast.edges in
27
    { empty with graph = graph }
pj2m's avatar
pj2m committed
28

bguillaum's avatar
bguillaum committed
29 30
  let of_conll ?loc lines = 
    { empty with graph = G_graph.of_conll ?loc lines }
bguillaum's avatar
bguillaum committed
31

pj2m's avatar
pj2m committed
32 33 34 35 36 37 38 39 40
  let rev_steps t = 
    { t with big_step = match t.big_step with
    | None -> None
    | Some bs -> Some {bs with Grew_types.small_step = List.rev bs.Grew_types.small_step }
    }

  let clear t = {empty with graph = t.graph } (* FIXME: normalization of node ids ??? *)
  let get_graph t = t.graph

41
  (* comparison is done on the list of commands *)
pj2m's avatar
pj2m committed
42 43 44
  (* only graph rewrited from the same init graph can be "compared" *)
  let compare t1 t2 = Pervasives.compare t1.commands t2.commands

45 46
  let to_gr t = G_graph.to_gr t.graph

47 48 49
  let save_dot_png ?main_feat base t = 
    ignore (Grew_utils.png_file_from_dot (G_graph.to_dot ?main_feat t.graph) (base^".png"))

pj2m's avatar
pj2m committed
50
IFDEF DEP2PICT THEN
51 52 53 54
  let save_dep_png ?main_feat base t =
    ignore (Dep2pict.Dep2pict.fromDepStringToPng (G_graph.to_dep ?main_feat t.graph) (base^".png"))
ELSE
  let save_dep_png ?main_feat base t = ()
pj2m's avatar
pj2m committed
55
ENDIF
56
end (* module Instance *)
pj2m's avatar
pj2m committed
57 58

module Instance_set = Set.Make (Instance)
59
(* ================================================================================ *)
pj2m's avatar
pj2m committed
60 61

module Rule = struct 
bguillaum's avatar
bguillaum committed
62
  (* the [pid] type is used for pattern identifier *)
63
  type pid = Pid.t
bguillaum's avatar
bguillaum committed
64 65
   
  (* the [gid] type is used for graph identifier *)
pj2m's avatar
pj2m committed
66
  type gid = int
67

bguillaum's avatar
bguillaum committed
68
  (* the rewriting depth is bounded to stop rewriting when the system is not terminating *) 
69
  let max_depth = ref 500
pj2m's avatar
pj2m committed
70

71 72 73
  type const =
    | Cst_out of pid * P_edge.t 
    | Cst_in of pid * P_edge.t
74
    | Feature_eq of pid * string * pid * string
75
    | Filter of pid * P_fs.t (* used when a without impose a fs on a node defined by the match pattern *)
pj2m's avatar
pj2m committed
76 77

  let build_constraint ?locals table = function 
78 79 80 81
    | (Ast.Start (node_name, labels), loc) -> Cst_out (Id.build ~loc node_name table, P_edge.make ?locals labels)
    | (Ast.Cst_out node_name, loc) -> Cst_out (Id.build ~loc node_name table, P_edge.all)
    | (Ast.End (node_name, labels),loc) -> Cst_in (Id.build ~loc node_name table, P_edge.make ?locals labels)
    | (Ast.Cst_in node_name, loc) -> Cst_in (Id.build ~loc node_name table, P_edge.all)
82 83
    | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) -> 
        Feature_eq (Id.build ~loc node_name1 table, feat_name1, Id.build ~loc node_name2 table, feat_name2)
bguillaum's avatar
bguillaum committed
84 85 86 87 88
          
  type pattern = {
      graph: P_graph.t;
      constraints: const list;
    }
pj2m's avatar
pj2m committed
89

90 91
  let build_pos_pattern ?pat_vars ?(locals=[||]) pattern_ast =
    let (graph,table,filter_nodes) = P_graph.build ?pat_vars ~locals pattern_ast.Ast.pat_nodes pattern_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
92 93 94
    (
     {
      graph = graph;
95 96 97
      constraints = 
      List.map (build_constraint ~locals table) pattern_ast.Ast.pat_const 
      @ (List.map (fun (pid, fs) -> Filter (pid, fs)) filter_nodes);
pj2m's avatar
pj2m committed
98 99 100 101
    }, 
     table
    )

bguillaum's avatar
bguillaum committed
102 103


104
      (* the neg part *)
pj2m's avatar
pj2m committed
105 106 107 108
  let build_neg_constraint ?locals pos_table neg_table const =
    let id_build loc string_id = 
      match Id.build_opt string_id pos_table with Some i -> i | None -> -1-(Id.build ~loc string_id neg_table) in
    match const with
109 110 111 112
    | (Ast.Start (node_name, labels),loc) -> Cst_out (id_build loc node_name, P_edge.make ?locals labels)
    | (Ast.Cst_out node_name, loc) -> Cst_out (id_build loc node_name, P_edge.all)
    | (Ast.End (node_name, labels),loc) -> Cst_in (id_build loc node_name, P_edge.make ?locals labels)
    | (Ast.Cst_in node_name, loc) -> Cst_in (id_build loc node_name, P_edge.all)
113 114
    | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) -> 
        Feature_eq (id_build loc node_name1, feat_name1, id_build loc node_name2, feat_name2)
pj2m's avatar
pj2m committed
115

116
  let build_neg_pattern ?(locals=[||]) pos_table pattern_ast =
pj2m's avatar
pj2m committed
117
    let (extension, neg_table) =
118
      P_graph.build_extension ~locals pos_table pattern_ast.Ast.pat_nodes pattern_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
119

120
    let filters = Pid_map.fold (fun id node acc -> Filter (id, P_node.get_fs node) :: acc) extension.P_graph.old_map [] in
pj2m's avatar
pj2m committed
121 122

    {
123
     graph = extension.P_graph.ext_map;
pj2m's avatar
pj2m committed
124 125 126
     constraints = filters @ List.map (build_neg_constraint ~locals pos_table neg_table) pattern_ast.Ast.pat_const ;
   }

127
  let get_edge_ids pattern =
128
    Pid_map.fold
129 130
      (fun _ node acc -> 
        Massoc.fold_left
131 132 133
          (fun acc2 _ edge -> match P_edge.get_id edge with None -> acc2 | Some id -> id::acc2)
          acc (P_node.get_next node)
      ) pattern.graph []
134
      
pj2m's avatar
pj2m committed
135 136 137 138 139
  type t = {
      name: string;
      pos: pattern;
      neg: pattern list;
      commands: Command.t list;
140
      param: Lex_par.t option;
141
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
142
      loc: Loc.t;
pj2m's avatar
pj2m committed
143 144
    }

bguillaum's avatar
bguillaum committed
145 146
  let get_name t = t.name

147
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
148

149 150 151 152 153 154 155
  let to_dep t =
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

    let nodes = 
      Pid_map.fold 
        (fun id node acc ->
156 157 158
          (node, sprintf "  N_%d { word=\"%s\"; subword=\"%s\"}" 
            id (P_node.get_name node) (P_fs.to_dep t.param_names (P_node.get_fs node))
          )
159 160 161
          :: acc
        ) t.pos.graph [] in

162
    (* nodes are sorted to appear in the same order in dep picture and in input file *)
163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
    let sorted_nodes = List.sort (fun (n1,_) (n2,_) -> P_node.compare_pos n1 n2) nodes in
    
    bprintf buff "[WORDS] {\n";
    List.iter
      (fun (_, dep_line) -> bprintf buff "%s\n" dep_line
      ) sorted_nodes;

    List_.iteri
      (fun i cst ->
        match cst with
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i 
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
    
    bprintf buff "[EDGES] {\n";
    
    Pid_map.iter
      (fun id_src node ->
        Massoc.iter 
          (fun id_tar edge ->
            bprintf buff "  N_%d -> N_%d { label=\"%s\"}\n"
              id_src id_tar 
              (P_edge.to_string edge)
          )
          (P_node.get_next node)
      ) t.pos.graph;

    List_.iteri
      (fun i cst ->
        match cst with
          | Cst_out (pid, edge) ->
            bprintf buff "  N_%d -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n" 
              pid i (P_edge.to_string edge)
          | Cst_in (pid, edge) -> 
            bprintf buff "  C_%d -> N_%d {label = \"%s\"; style=dot; bottom; color=green;}\n" 
              i pid (P_edge.to_string edge)
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
204

205 206
  let is_filter t = t.commands = []

bguillaum's avatar
bguillaum committed
207
  let build_commands ?param ?(locals=[||]) pos pos_table ast_commands =
208 209 210 211 212 213
    let known_node_ids = Array.to_list pos_table in
    let known_edge_ids = get_edge_ids pos in
    let rec loop (kni,kei) = function
      | [] -> []
      | ast_command :: tail ->
          let (command, (new_kni, new_kei)) = 
bguillaum's avatar
bguillaum committed
214
            Command.build ?param (kni,kei) pos_table locals ast_command in
215 216 217
          command :: (loop (new_kni,new_kei) tail) in
    loop (known_node_ids, known_edge_ids) ast_commands

bguillaum's avatar
bguillaum committed
218 219 220 221 222 223 224 225 226 227 228 229
  let parse_vars loc vars =
    let rec parse_cmd_vars = function
      | [] -> []
      | x::t when x.[0] = '@' -> x :: parse_cmd_vars t
      | x::t -> Error.bug ~loc "Illegal feature definition '%s' in the lexical rule" x in
    let rec parse_pat_vars = function
      | [] -> ([],[])
      | x::t when x.[0] = '@' -> ([],parse_cmd_vars (x::t))
      | x::t when x.[0] = '$' -> let (pv,cv) = parse_pat_vars t in (x::pv, cv)
      | x::t -> Error.bug ~loc "Illegal feature definition '%s' in the lexical rule" x in
    parse_pat_vars vars
    
230
  let build ?(locals=[||]) dir rule_ast = 
bguillaum's avatar
bguillaum committed
231 232 233 234

    let (param, pat_vars, cmd_vars) = 
      match rule_ast.Ast.param with
      | None -> (None,[],[])
235
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
236 237 238
          let (pat_vars, cmd_vars) = parse_vars rule_ast.Ast.rule_loc vars in
          let nb_pv = List.length pat_vars in
          let nb_cv = List.length cmd_vars in
239 240 241 242 243 244 245 246 247 248 249
          let param = List.fold_left
            (fun acc file ->
              Lex_par.append
                (Lex_par.load ~loc:rule_ast.Ast.rule_loc dir nb_pv nb_cv file)
                acc
            )
            (match rule_ast.Ast.lp with 
              | None -> Lex_par.empty 
              | Some lines -> Lex_par.from_lines ~loc:rule_ast.Ast.rule_loc nb_pv nb_cv lines
            )
            files in
250
          (Some param, pat_vars, cmd_vars) in
251

252
    let (pos,pos_table) = build_pos_pattern ~pat_vars ~locals rule_ast.Ast.pos_pattern in
pj2m's avatar
pj2m committed
253 254

    {
bguillaum's avatar
bguillaum committed
255
     name = rule_ast.Ast.rule_id;
pj2m's avatar
pj2m committed
256
     pos = pos;
257
     neg = List.map (fun p -> build_neg_pattern ~locals pos_table p) rule_ast.Ast.neg_patterns;
bguillaum's avatar
bguillaum committed
258
     commands = build_commands ~param:(pat_vars,cmd_vars) ~locals pos pos_table rule_ast.Ast.commands;
259
     loc = rule_ast.Ast.rule_loc;
bguillaum's avatar
bguillaum committed
260
     param = param; 
261
     param_names = (pat_vars,cmd_vars)
262
   };
bguillaum's avatar
bguillaum committed
263
      
pj2m's avatar
pj2m committed
264
  type matching = {
bguillaum's avatar
bguillaum committed
265
      n_match: gid Pid_map.t;                   (* partial fct: pattern nodes |--> graph nodes *)
pj2m's avatar
pj2m committed
266 267
      e_match: (string*(gid*Label.t*gid)) list; (* edge matching: edge ident  |--> (src,label,tar) *)
      a_match: (gid*Label.t*gid) list;          (* anonymous edge mached *)
268
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
269
    }
270

bguillaum's avatar
bguillaum committed
271
  let empty_matching param = { n_match = Pid_map.empty; e_match = []; a_match = []; m_param = param;}
272

pj2m's avatar
pj2m committed
273 274
  let e_comp (e1,_) (e2,_) = compare e1 e2

bguillaum's avatar
bguillaum committed
275
  let e_match_add ?pos edge_id matching =
pj2m's avatar
pj2m committed
276 277
    match List_.usort_insert ~compare:e_comp edge_id matching.e_match with
    | Some new_e_match -> { matching with e_match = new_e_match }
bguillaum's avatar
bguillaum committed
278
    | None -> Error.bug "The edge identifier '%s' is binded twice in the same pattern" (fst edge_id)
279
          
pj2m's avatar
pj2m committed
280 281 282
  let a_match_add edge matching = {matching with a_match = edge::matching.a_match }

  let up_deco matching = 
283
    { Deco.nodes = Pid_map.fold (fun _ gid acc -> gid::acc) matching.n_match [];
pj2m's avatar
pj2m committed
284 285 286
      Deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
    }

bguillaum's avatar
bguillaum committed
287
  let find cnode ?loc (matching, created_nodes) =
pj2m's avatar
pj2m committed
288 289
    match cnode with
    | Command.Pid pid -> 
290
        (try Pid_map.find pid matching.n_match
291
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%d' not found" pid)
pj2m's avatar
pj2m committed
292
    | Command.New name -> 
293 294 295
        try List.assoc name created_nodes 
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name
            
pj2m's avatar
pj2m committed
296 297 298 299 300

  let down_deco (matching,created_nodes) commands =
    {
     Deco.nodes = List.fold_left
       (fun acc -> function
301
         | (Command.UPDATE_FEAT (tar_cn,_,_),loc)
302 303 304
         | (Command.SHIFT_EDGE (_,tar_cn),loc) -> 
             (find tar_cn (matching, created_nodes)) :: acc
         | _ -> acc
pj2m's avatar
pj2m committed
305 306 307
       ) [] commands;
     Deco.edges = List.fold_left
       (fun acc -> function 
308
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->  
309
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
310
         | _ -> acc
pj2m's avatar
pj2m committed
311 312 313 314 315 316 317 318
       ) [] commands
   }

  exception Fail
(* ================================================================================ *)
  type partial = {
      sub: matching; 
      unmatched_nodes: pid list;
319
      unmatched_edges: (pid * P_edge.t * pid) list;
pj2m's avatar
pj2m committed
320 321 322
      already_matched_gids: gid list; (* to ensure injectivity *)
      check: const list (* constraints to verify at the end of the matching *)
    }    
323 324 325 326 327
        
        (* PREREQUISITES: 
           - all partial matching have the same domain 
           - the domain of the pattern P is the disjoint union of domain([sub]) and [unmatched_nodes]
         *)
pj2m's avatar
pj2m committed
328

bguillaum's avatar
bguillaum committed
329
  let init param pattern =
330
    let roots = P_graph.roots pattern.graph in
pj2m's avatar
pj2m committed
331

332
    let node_list = Pid_map.fold (fun pid _ acc -> pid::acc) pattern.graph [] in
pj2m's avatar
pj2m committed
333 334 335 336

    (* put all roots in the front of the list to speed up the algo *)
    let sorted_node_list = 
      List.sort
337 338 339 340 341
        (fun n1 n2 -> match (List.mem n1 roots, List.mem n2 roots) with
        | true, false -> -1
        | false, true -> 1
        | _ -> 0) node_list in
    
bguillaum's avatar
bguillaum committed
342
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
343 344 345 346 347 348
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
      check = pattern.constraints;
    }

349 350 351 352 353 354 355 356 357 358
(* Ocaml < 3.12 doesn't have exists function for maps! *)
  exception True
  let gid_map_exists fct map =
    try 
      Gid_map.iter (fun k v -> if fct k v then raise True) map;
      false
    with True -> true
(* Ocaml < 3.12 doesn't have exists function for maps! *)


pj2m's avatar
pj2m committed
359
  let fullfill graph matching = function 
360
    | Cst_out (pid,edge) -> 
361 362
        let gid = Pid_map.find pid matching.n_match in
        G_graph.edge_out graph gid edge
363
    | Cst_in (pid,edge) -> 
364
        let gid = Pid_map.find pid matching.n_match in
365
        gid_map_exists (* should be Gid_map.exists with ocaml 3.12 *)
366
          (fun _ node ->
367 368
            List.exists (fun e -> P_edge.compatible edge e) (Massoc.assoc gid (G_node.get_next node))
          ) graph.G_graph.map
369
    | Feature_eq (pid1, feat_name1, pid2, feat_name2) ->
370 371
        let gnode1 = Gid_map.find (Pid_map.find pid1 matching.n_match) graph.G_graph.map in
        let gnode2 = Gid_map.find (Pid_map.find pid2 matching.n_match) graph.G_graph.map in
372 373
        (match (G_fs.get_atom feat_name1 (G_node.get_fs gnode1),
                G_fs.get_atom feat_name2 (G_node.get_fs gnode2)
374
               ) with
bguillaum's avatar
bguillaum committed
375 376
        | Some fv1, Some fv2 when fv1 = fv2 -> true
        | _ -> false)
pj2m's avatar
pj2m committed
377
    | Filter (pid, fs) ->
378 379
        let gid = Pid_map.find pid matching.n_match in
        let gnode = Gid_map.find gid graph.G_graph.map in
380
        P_fs.filter fs (G_node.get_fs gnode)
pj2m's avatar
pj2m committed
381

bguillaum's avatar
bguillaum committed
382
  (* returns all extension of the partial input matching *)
383
  let rec extend_matching (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
384 385
    match (partial.unmatched_edges, partial.unmatched_nodes) with
    | [], [] -> 
386 387 388
        if List.for_all (fun const -> fullfill graph partial.sub const) partial.check 
        then [partial.sub, partial.already_matched_gids]
        else []
pj2m's avatar
pj2m committed
389
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
390 391 392
        begin
          try (* is the tar already found in the matching ? *)
            let new_partials = 
393 394 395 396
              let src_gid = Pid_map.find src_pid partial.sub.n_match in
              let tar_gid = Pid_map.find tar_pid partial.sub.n_match in
              let src_gnode = G_graph.find src_gid graph in
              let g_edges = Massoc.assoc tar_gid (G_node.get_next src_gnode) in
397
              
398 399
              match P_edge.match_list p_edge g_edges with
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
400
                  []
401
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
402
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ] 
403
              | P_edge.Binds (id,labels) -> (* n edges in the graph match the identified p_edge -> make copies of the [k] matchings (and returns n*k matchings) *)
404 405 406 407 408 409 410
                  List.map 
                    (fun label ->
                      {partial with sub = e_match_add (id,(src_gid,label,tar_gid)) partial.sub; unmatched_edges = tail_ue }
                    ) labels 
            in List_.flat_map (extend_matching (positive,neg) graph) new_partials
          with Not_found -> (* p_edge goes to an unmatched node *)
            let candidates = (* candidates (of type (gid, matching)) for m(tar_pid) = gid) with new partial matching m *)
411 412
              let src_gid = Pid_map.find src_pid partial.sub.n_match in
              let src_gnode = G_graph.find src_gid graph in
413 414
              Massoc.fold_left 
                (fun acc gid_next g_edge ->
415 416
                  match P_edge.match_ p_edge g_edge with
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
417
                      acc
418
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
419
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc 
420
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
421
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
422 423
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
424 425 426 427 428 429
            List_.flat_map
              (fun (gid_next, matching) -> 
                extend_matching_from (positive,neg) graph tar_pid gid_next
                  {partial with sub=matching; unmatched_edges = tail_ue}
              ) candidates
        end
pj2m's avatar
pj2m committed
430
    | [], pid :: _ -> 
431
        Gid_map.fold          
432 433
          (fun gid _ acc ->
            (extend_matching_from (positive,neg) graph pid gid partial) @ acc
434
          ) graph.G_graph.map []
435
          
436
  and extend_matching_from (positive,neg) (graph:G_graph.t) pid gid partial =
pj2m's avatar
pj2m committed
437 438 439 440
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
      let p_node = 
441
        if pid >= 0 
442 443 444
        then try P_graph.find pid positive with Not_found -> failwith "POS"
        else try P_graph.find pid neg with Not_found -> failwith "NEG" in
      let g_node = try G_graph.find gid graph with Not_found -> failwith "INS" in
bguillaum's avatar
bguillaum committed
445 446
      
      try
447 448 449

        let new_param = P_node.match_ ?param: partial.sub.m_param p_node g_node in

450 451 452 453
        (* add all out-edges from pid in pattern *)
        let new_unmatched_edges = 
          Massoc.fold_left
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
454
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
455 456 457 458 459 460 461 462
        
        let new_partial = 
          { partial with
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> failwith "List_.rm"); 
            unmatched_edges = new_unmatched_edges;
            already_matched_gids = gid :: partial.already_matched_gids;
            sub = {partial.sub with n_match = Pid_map.add pid gid partial.sub.n_match; m_param = new_param};
          } in
463
        extend_matching (positive,neg) graph new_partial
464
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
465 466

(* the exception below is added to handle unification failure in merge!! *)
467
  exception Command_execution_fail
pj2m's avatar
pj2m committed
468 469

(** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
470 471 472 473 474 475 476 477
  let apply_command (command,loc) instance matching created_nodes =
    let node_find cnode = find ~loc cnode (matching, created_nodes) in

    match command with
    | Command.ADD_EDGE (src_cn,tar_cn,edge) -> 
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
478
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
479 480 481 482 483 484 485 486 487
          | Some new_graph -> 
              (
               {instance with 
                Instance.graph = new_graph; 
                commands = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.commands
              },
               created_nodes
              )
          | None -> 
488
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string edge) (Loc.to_string loc)
489 490 491 492 493 494 495
        end

    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) -> 
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
         {instance with 
496
          Instance.graph = G_graph.del_edge loc instance.Instance.graph src_gid edge tar_gid; 
497 498 499 500 501 502
          commands = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.commands
        },
         created_nodes
        )

    | Command.DEL_EDGE_NAME edge_ident ->
503
        let (src_gid,edge,tar_gid) = 
504 505 506 507
          try List.assoc edge_ident matching.e_match 
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
         {instance with 
508
          Instance.graph = G_graph.del_edge ~edge_ident loc instance.Instance.graph src_gid edge tar_gid; 
509 510 511 512 513 514 515 516 517
          commands = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.commands
        },
         created_nodes
        )    

    | Command.DEL_NODE node_cn -> 
        let node_gid = node_find node_cn in
        (
         {instance with 
518
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
519 520 521 522 523 524 525 526
          commands = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.commands
        },
         created_nodes
        )

    | Command.MERGE_NODE (src_cn, tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
527
        (match G_graph.merge_node loc instance.Instance.graph src_gid tar_gid with
528 529 530 531 532 533 534 535 536 537 538
        | Some new_graph -> 
            (
             {instance with 
              Instance.graph = new_graph;
              commands = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.commands
            },
             created_nodes
            )
        | None -> raise Command_execution_fail
        )
          
539
    | Command.UPDATE_FEAT (tar_cn,tar_feat_name, item_list) ->
bguillaum's avatar
bguillaum committed
540
        let tar_gid = node_find tar_cn in
541 542
        let rule_items = List.map
            (function
543 544
              | Command.Feat (cnode, feat_name) -> G_graph.Feat (node_find cnode, feat_name)
              | Command.String s -> G_graph.String s
bguillaum's avatar
bguillaum committed
545 546 547 548 549 550
              | Command.Param_out index -> 
                  (match matching.m_param with
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
                  | Some param -> G_graph.String (Lex_par.get_command_value index param))
              | Command.Param_in index -> 
                  (match matching.m_param with
551
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
552
                  | Some param -> G_graph.String (Lex_par.get_param_value index param))
553
            ) item_list in
554

555
        let (new_graph, new_feature_value) = 
556
          G_graph.update_feat ~loc instance.Instance.graph tar_gid tar_feat_name rule_items in
bguillaum's avatar
bguillaum committed
557
        (
558 559 560 561
         {instance with
          Instance.graph = new_graph;
          commands = List_.sort_insert
            (Command.H_UPDATE_FEAT (tar_gid,tar_feat_name,new_feature_value))
bguillaum's avatar
bguillaum committed
562 563 564
            instance.Instance.commands
        },
         created_nodes
565
        )
566 567 568 569 570

    | Command.DEL_FEAT (tar_cn,feat_name) ->
        let tar_gid = node_find tar_cn in
        (
         {instance with 
571
          Instance.graph = G_graph.del_feat instance.Instance.graph tar_gid feat_name;
572 573 574 575 576 577
          commands = List_.sort_insert (Command.H_DEL_FEAT (tar_gid,feat_name)) instance.Instance.commands
        },
         created_nodes
        )     

    | Command.NEW_NEIGHBOUR (created_name,edge,base_pid) ->
578 579
        let base_gid = Pid_map.find base_pid matching.n_match in
        let (new_gid,new_graph) = G_graph.add_neighbour loc instance.Instance.graph base_gid edge in
580 581 582 583 584 585 586 587
        (
         {instance with 
          Instance.graph = new_graph;
          commands = List_.sort_insert (Command.H_NEW_NEIGHBOUR (created_name,edge,new_gid)) instance.Instance.commands
        },
         (created_name,new_gid) :: created_nodes
        )

588 589 590 591 592
    | Command.SHIFT_IN (src_cn,tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
         {instance with 
593
          Instance.graph = G_graph.shift_in loc instance.Instance.graph src_gid tar_gid; 
594 595 596 597 598 599 600 601 602 603
          commands = List_.sort_insert (Command.H_SHIFT_IN (src_gid,tar_gid)) instance.Instance.commands
        },
         created_nodes
        )

    | Command.SHIFT_OUT (src_cn,tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
         {instance with 
604
          Instance.graph = G_graph.shift_out loc instance.Instance.graph src_gid tar_gid; 
605 606 607 608 609
          commands = List_.sort_insert (Command.H_SHIFT_OUT (src_gid,tar_gid)) instance.Instance.commands
        },
         created_nodes
        )

bguillaum's avatar
bguillaum committed
610
    | Command.SHIFT_EDGE (src_cn,tar_cn) ->
611 612 613 614
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
         {instance with 
615
          Instance.graph = G_graph.shift_edges loc instance.Instance.graph src_gid tar_gid; 
616 617 618 619
          commands = List_.sort_insert (Command.H_SHIFT_EDGE (src_gid,tar_gid)) instance.Instance.commands
        },
         created_nodes
        )
pj2m's avatar
pj2m committed
620 621 622 623

(** [apply_rule instance matching rule] returns a new instance after the application of the rule 
    [Command_execution_fail] is raised if some merge unification fails
 *)
624
  let apply_rule instance matching rule = 
pj2m's avatar
pj2m committed
625

bguillaum's avatar
bguillaum committed
626 627 628
    (* Timeout check *)
    (try Timeout.check () with Timeout.Stop -> Error.run "Time out");

629 630 631 632 633 634 635 636 637 638 639 640 641 642 643
    (* limit the rewriting depth to avoid looping rewriting *)
    begin
      if List.length instance.Instance.rules >= !max_depth 
      then Error.run "Bound reached (when applying rule %s)" rule.name
    end;
    
    let (new_instance, created_nodes) =
      List.fold_left 
        (fun (instance, created_nodes) command ->
          apply_command command instance matching created_nodes
        ) 
        (instance, []) 
        rule.commands in

    let rule_app = {Grew_types.rule_name = rule.name; up = up_deco matching; down = down_deco (matching,created_nodes) rule.commands } in
pj2m's avatar
pj2m committed
644

645 646 647 648 649 650
    {new_instance with 
     Instance.rules = rule.name :: new_instance.Instance.rules;
     big_step = match new_instance.Instance.big_step with
     | None -> Some { Grew_types.first = rule_app; small_step = [] }
     | Some bs -> Some { bs with Grew_types.small_step = (instance.Instance.graph, rule_app) :: bs.Grew_types.small_step }
   } 
pj2m's avatar
pj2m committed
651 652 653

(*-----------------------------*)

654 655
  let update_partial pos_graph without (sub, already_matched_gids) = 
    let neg_graph = without.graph in
656
    let unmatched_nodes = Pid_map.fold (fun pid _ acc -> if pid < 0 then pid::acc else acc) neg_graph [] in
657
    let unmatched_edges = 
658
      Pid_map.fold 
659 660 661 662 663 664
        (fun pid node acc -> 
          if pid < 0 
          then acc
          else 
            Massoc.fold_left 
              (fun acc2 pid_next p_edge -> (pid, p_edge, pid_next) :: acc2)
665 666
              acc (P_node.get_next node)
        ) neg_graph [] in
667 668 669 670 671 672 673 674
    {
     sub = sub;
     unmatched_nodes = unmatched_nodes;
     unmatched_edges = unmatched_edges;
     already_matched_gids = already_matched_gids;
     check = without.constraints;
   }
      
pj2m's avatar
pj2m committed
675

676 677 678 679
  let fulfill (pos_graph,neg_graph) graph new_partial_matching  =
    match extend_matching (pos_graph, neg_graph) graph new_partial_matching with
    | [] -> true (* the without pattern in not found -> OK *)
    | x -> false 
pj2m's avatar
pj2m committed
680 681 682


(** [one_step instance rules] computes the list of one-step reduct with rules *)
683 684 685 686 687 688 689 690
  let one_step instance rules =
    List.fold_left 
      (fun acc rule -> 
        let pos_graph = rule.pos.graph in

        (* get the list of partial matching for positive part of the pattern *)
        let matching_list = 
          extend_matching 
691
            (pos_graph,P_graph.empty) 
692
            instance.Instance.graph 
bguillaum's avatar
bguillaum committed
693
            (init rule.param rule.pos) in
694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711

        let filtered_matching_list =
          List.filter
            (fun (sub, already_matched_gids) ->
              List.for_all 
                (fun without -> 
                  let neg_graph = without.graph in
                  let new_partial_matching = update_partial pos_graph without (sub, already_matched_gids) in
                  fulfill (pos_graph,neg_graph) instance.Instance.graph new_partial_matching
                ) rule.neg
            ) matching_list in
        
        List.fold_left 
          (fun acc1 (matching,_) -> 
            try (apply_rule instance matching rule) :: acc1 
            with Command_execution_fail -> Printf.printf "******\n%!"; acc1
          ) acc filtered_matching_list
      ) [] rules 
pj2m's avatar
pj2m committed
712 713

(** [conf_one_step instance rules] computes one Some (one-step reduct) with rules, None if no rule apply *)
714 715 716 717 718 719 720 721
  let rec conf_one_step (instance : Instance.t) = function
    | [] -> None
    | rule::rule_tail ->
        let pos_graph = rule.pos.graph in

        (* get the list of partial matching for positive part of the pattern *)
        let matching_list = 
          extend_matching 
722
            (pos_graph,P_graph.empty) 
723
            instance.Instance.graph 
bguillaum's avatar
bguillaum committed
724
            (init rule.param rule.pos) in
725 726 727 728 729 730 731 732 733 734 735 736 737 738
        
        try 
          let (first_matching_where_all_witout_are_fulfilled,_) =
            List.find
              (fun (sub, already_matched_gids) ->
                List.for_all 
                  (fun without -> 
                    let neg_graph = without.graph in
                    let new_partial_matching = update_partial pos_graph without (sub, already_matched_gids) in
                    fulfill (pos_graph,neg_graph) instance.Instance.graph new_partial_matching
                  ) rule.neg
              ) matching_list in
          Some (apply_rule instance first_matching_where_all_witout_are_fulfilled rule)
        with Not_found -> (* try another rule *) conf_one_step instance rule_tail
pj2m's avatar
pj2m committed
739 740 741


(** filter nfs being equal *)
742
  let rec filter_equal_nfs nfs =
743 744 745 746 747 748
    Instance_set.fold 
      (fun nf acc ->
        if Instance_set.exists (fun e -> G_graph.equals e.Instance.graph nf.Instance.graph) acc
        then acc
        else Instance_set.add nf acc
      ) nfs Instance_set.empty
749
      
pj2m's avatar
pj2m committed
750 751
(** normalize [t] according to the [rules]
 * [t] is a raw graph
752
 * Info about the commands applied on [t] are kept
pj2m's avatar
pj2m committed
753 754
 *)

755
  (* type: Instance.t -> t list -> Instance_set.t *)
756
  let normalize_instance modul_name instance rules =
pj2m's avatar
pj2m committed
757 758
    let rec loop to_do nf = 
      if to_do = Instance_set.empty
759 760 761 762 763 764 765 766 767 768 769 770
      then nf
      else
        let (new_to_do,new_nf) =  
          Instance_set.fold 
            (fun v (to_do1,nf1) ->
              let step_of_v = one_step v rules in
              if step_of_v = [] (* nothing came out of v*)
              then (to_do1,Instance_set.add (Instance.rev_steps v) nf1)
              else (List.fold_left (fun acc v1 -> Instance_set.add v1 acc) to_do1 step_of_v,nf1)
            )
            to_do (Instance_set.empty,nf) in
        loop new_to_do new_nf in
pj2m's avatar
pj2m committed
771
    let nfs = loop (Instance_set.singleton instance) Instance_set.empty in 
772 773 774 775 776 777 778 779
    let reduced_nfs = filter_equal_nfs nfs in
    
    let reduced_nfs_card = Instance_set.cardinal reduced_nfs in
    let nfs_card = Instance_set.cardinal nfs in
    if reduced_nfs_card < nfs_card 
    then Log.fwarning "In module \"%s\", %d nf are produced, only %d different ones" modul_name nfs_card reduced_nfs_card;

    reduced_nfs
780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
      
  (* [filter_instance instance filters] return a boolean:
     - true iff the instance does NOT match any pattern in [filters] *)
  let filter_instance filters instance =
    let rec loop = function
      | [] -> true (* no more filter to check *)
      | filter::filter_tail ->
          let pos_graph = filter.pos.graph in
          
          (* get the list of partial matching for positive part of the pattern *)
          let matching_list = 
            extend_matching 
              (pos_graph,P_graph.empty) 
              instance.Instance.graph 
              (init filter.param filter.pos) in
          
          if List.exists
              (fun (sub, already_matched_gids) ->
                List.for_all 
                  (fun without -> 
                    let neg_graph = without.graph in
                    let new_partial_matching = update_partial pos_graph without (sub, already_matched_gids) in
                    fulfill (pos_graph,neg_graph) instance.Instance.graph new_partial_matching
                  ) filter.neg
              ) matching_list
          then (* one of the matching can be extended *) false
          else loop filter_tail in
    loop filters


pj2m's avatar
pj2m committed
810

811 812 813 814 815
  let rec conf_normalize instance rules =
    match conf_one_step instance rules with
    | Some new_instance -> conf_normalize new_instance rules
    | None -> Instance.rev_steps instance

816
  let normalize modul_name ?(confluent=false) rules filters instance =
bguillaum's avatar
bguillaum committed
817
    Timeout.start ();
818 819 820
    if confluent
    then
      let output = conf_normalize instance rules in
821
      if filter_instance filters output 
822 823 824
      then (Instance_set.singleton output, Instance_set.empty)
      else (Instance_set.empty, Instance_set.singleton output)
    else
825
      let output_set = normalize_instance modul_name instance rules in 
826
      let (good_set, bad_set) = Instance_set.partition (filter_instance filters) output_set in
827
      (good_set, bad_set)
828

bguillaum's avatar
bguillaum committed
829
end (* module Rule *)