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

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 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
    graph: G_graph.t;
    history: Command.h list;
    rules: string list;
    big_step: Grew_types.big_step option;
    free_index: int;
    activated_node: Gid.t list;
  }

  let empty = {graph = G_graph.empty; rules=[]; history=[]; big_step=None; free_index=0; activated_node=[];}

  let from_graph graph =
    {empty with
      graph = graph;
      free_index = match (Gid_map.max_binding graph) with
        | (Gid.Old i,_) -> i+1
        | _ -> Error.bug "[Instance.from_graph]"
pj2m's avatar
pj2m committed
31 32
    }

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

39 40 41 42 43 44 45 46 47 48
  let flatten t =
    (* [mapping] is list of couple (node_id, node_id) used to flatten the graph *)
    let (mapping, new_free) = List.fold_left
      (fun (acc_map, next_free) node_id ->
        (
          (node_id, Gid.Old next_free) :: acc_map,
          next_free + 1
        )
      ) ([], t.free_index) t.activated_node in
    { empty with graph = G_graph.rename mapping t.graph; free_index = new_free }
pj2m's avatar
pj2m committed
49

50
  (* comparison is done on the list of commands *)
pj2m's avatar
pj2m committed
51
  (* only graph rewrited from the same init graph can be "compared" *)
52
  let compare t1 t2 = Pervasives.compare t1.history t2.history
pj2m's avatar
pj2m committed
53

54 55
  let to_gr t = G_graph.to_gr t.graph

bguillaum's avatar
bguillaum committed
56
  let save_dot_png ?main_feat base t =
57 58
    ignore (Grew_utils.png_file_from_dot (G_graph.to_dot ?main_feat t.graph) (base^".png"))

pj2m's avatar
pj2m committed
59
IFDEF DEP2PICT THEN
60 61 62 63
  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
64
ENDIF
65
end (* module Instance *)
pj2m's avatar
pj2m committed
66 67

module Instance_set = Set.Make (Instance)
68
(* ================================================================================ *)
pj2m's avatar
pj2m committed
69

bguillaum's avatar
bguillaum committed
70
module Rule = struct
bguillaum's avatar
bguillaum committed
71
  (* the [pid] type is used for pattern identifier *)
72
  type pid = Pid.t
bguillaum's avatar
bguillaum committed
73

bguillaum's avatar
bguillaum committed
74
  (* the [gid] type is used for graph identifier *)
75
  type gid = Gid.t
76

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

80
  type const =
bguillaum's avatar
bguillaum committed
81
    | Cst_out of pid * P_edge.t
82
    | Cst_in of pid * P_edge.t
83
    | Feature_eq of pid * string * pid * string
84
    | 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
85

bguillaum's avatar
bguillaum committed
86 87 88 89 90 91 92 93 94 95 96 97 98 99
  let build_pos_constraint ?locals pos_table const =
    let pid_of_name loc node_name = Pid.Pos (Id.build ~loc node_name pos_table) in
    match const with
      | (Ast.Start (node_name, labels), loc) ->
        Cst_out (pid_of_name loc node_name, P_edge.make ?locals labels)
      | (Ast.Cst_out node_name, loc) ->
        Cst_out (pid_of_name loc node_name, P_edge.all)
      | (Ast.End (node_name, labels),loc) ->
        Cst_in (pid_of_name loc node_name, P_edge.make ?locals labels)
      | (Ast.Cst_in node_name, loc) ->
        Cst_in (pid_of_name loc node_name, P_edge.all)
      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)

bguillaum's avatar
bguillaum committed
100 101 102 103
  type pattern = {
      graph: P_graph.t;
      constraints: const list;
    }
pj2m's avatar
pj2m committed
104

105
  let build_pos_pattern ?pat_vars ?(locals=[||]) pattern_ast =
106
    let (graph, pos_table) =
bguillaum's avatar
bguillaum committed
107
      P_graph.build ?pat_vars ~locals pattern_ast.Ast.pat_nodes pattern_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
108
    (
bguillaum's avatar
bguillaum committed
109 110
      {
        graph = graph;
111
        constraints = List.map (build_pos_constraint ~locals pos_table) pattern_ast.Ast.pat_const
bguillaum's avatar
bguillaum committed
112 113
      },
      pos_table
pj2m's avatar
pj2m committed
114 115
    )

bguillaum's avatar
bguillaum committed
116
  (* the neg part *)
pj2m's avatar
pj2m committed
117
  let build_neg_constraint ?locals pos_table neg_table const =
bguillaum's avatar
bguillaum committed
118 119 120 121
    let pid_of_name loc node_name =
      match Id.build_opt node_name pos_table with
        | Some i -> Pid.Pos i
        | None -> Pid.Neg (Id.build ~loc node_name neg_table) in
pj2m's avatar
pj2m committed
122
    match const with
bguillaum's avatar
bguillaum committed
123 124 125 126 127 128 129 130 131 132
      | (Ast.Start (node_name, labels),loc) ->
        Cst_out (pid_of_name loc node_name, P_edge.make ?locals labels)
      | (Ast.Cst_out node_name, loc) ->
        Cst_out (pid_of_name loc node_name, P_edge.all)
      | (Ast.End (node_name, labels),loc) ->
        Cst_in (pid_of_name loc node_name, P_edge.make ?locals labels)
      | (Ast.Cst_in node_name, loc) ->
        Cst_in (pid_of_name loc node_name, P_edge.all)
      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
pj2m's avatar
pj2m committed
133

134
  let build_neg_pattern ?(locals=[||]) pos_table pattern_ast =
pj2m's avatar
pj2m committed
135
    let (extension, neg_table) =
136
      P_graph.build_extension ~locals pos_table pattern_ast.Ast.pat_nodes pattern_ast.Ast.pat_edges in
137
    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
138
    {
bguillaum's avatar
bguillaum committed
139 140 141
      graph = extension.P_graph.ext_map;
      constraints = filters @ List.map (build_neg_constraint ~locals pos_table neg_table) pattern_ast.Ast.pat_const ;
    }
pj2m's avatar
pj2m committed
142

143
  let get_edge_ids pattern =
144
    Pid_map.fold
bguillaum's avatar
bguillaum committed
145 146
      (fun _ node acc ->
        Massoc_pid.fold
147 148 149
          (fun acc2 _ edge -> match P_edge.get_id edge with None -> acc2 | Some id -> id::acc2)
          acc (P_node.get_next node)
      ) pattern.graph []
bguillaum's avatar
bguillaum committed
150

pj2m's avatar
pj2m committed
151 152 153 154 155
  type t = {
      name: string;
      pos: pattern;
      neg: pattern list;
      commands: Command.t list;
156
      param: Lex_par.t option;
157
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
158
      loc: Loc.t;
pj2m's avatar
pj2m committed
159 160
    }

bguillaum's avatar
bguillaum committed
161 162
  let get_name t = t.name

163
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
164

165 166 167 168
  let to_dep t =
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

bguillaum's avatar
bguillaum committed
169 170
    let nodes =
      Pid_map.fold
171
        (fun id node acc ->
bguillaum's avatar
bguillaum committed
172 173
          (node, sprintf "  N_%s { word=\"%s\"; subword=\"%s\"}"
            (Pid.to_id id) (P_node.get_name node) (P_fs.to_dep t.param_names (P_node.get_fs node))
174
          )
175 176 177
          :: acc
        ) t.pos.graph [] in

178
    (* nodes are sorted to appear in the same order in dep picture and in input file *)
179
    let sorted_nodes = List.sort (fun (n1,_) (n2,_) -> P_node.compare_pos n1 n2) nodes in
bguillaum's avatar
bguillaum committed
180

181 182 183 184 185 186 187 188
    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
bguillaum's avatar
bguillaum committed
189
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i
190 191 192
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
bguillaum's avatar
bguillaum committed
193

194
    bprintf buff "[EDGES] {\n";
bguillaum's avatar
bguillaum committed
195

196 197
    Pid_map.iter
      (fun id_src node ->
bguillaum's avatar
bguillaum committed
198
        Massoc_pid.iter
199
          (fun id_tar edge ->
bguillaum's avatar
bguillaum committed
200 201 202
            bprintf buff "  N_%s -> N_%s { label=\"%s\"}\n"
              (Pid.to_id id_src)
              (Pid.to_id id_tar)
203 204 205 206 207 208 209 210 211
              (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) ->
bguillaum's avatar
bguillaum committed
212 213 214 215 216
            bprintf buff "  N_%s -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n"
              (Pid.to_id pid) i (P_edge.to_string edge)
          | Cst_in (pid, edge) ->
            bprintf buff "  C_%d -> N_%s {label = \"%s\"; style=dot; bottom; color=green;}\n"
              i (Pid.to_id pid) (P_edge.to_string edge)
217 218 219 220
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
221

222 223
  let is_filter t = t.commands = []

bguillaum's avatar
bguillaum committed
224
  let build_commands ?param ?(locals=[||]) pos pos_table ast_commands =
225 226 227 228 229
    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 ->
bguillaum's avatar
bguillaum committed
230
          let (command, (new_kni, new_kei)) =
bguillaum's avatar
bguillaum committed
231
            Command.build ?param (kni,kei) pos_table locals ast_command in
232 233 234
          command :: (loop (new_kni,new_kei) tail) in
    loop (known_node_ids, known_edge_ids) ast_commands

bguillaum's avatar
bguillaum committed
235 236 237 238 239 240 241 242 243 244 245 246
  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

bguillaum's avatar
bguillaum committed
247 248 249
  let build ?(locals=[||]) dir rule_ast =

    let (param, pat_vars, cmd_vars) =
bguillaum's avatar
bguillaum committed
250 251
      match rule_ast.Ast.param with
      | None -> (None,[],[])
252
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
253 254 255
          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
256 257 258 259 260 261
          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
            )
bguillaum's avatar
bguillaum committed
262 263
            (match rule_ast.Ast.lp with
              | None -> Lex_par.empty
264 265 266
              | Some lines -> Lex_par.from_lines ~loc:rule_ast.Ast.rule_loc nb_pv nb_cv lines
            )
            files in
267
          (Some param, pat_vars, cmd_vars) in
268

bguillaum's avatar
bguillaum committed
269
    let (pos, pos_table) = build_pos_pattern ~pat_vars ~locals rule_ast.Ast.pos_pattern in
pj2m's avatar
pj2m committed
270
    {
bguillaum's avatar
bguillaum committed
271 272 273 274 275 276 277 278 279
      name = rule_ast.Ast.rule_id;
      pos = pos;
      neg = List.map (fun pattern_ast -> build_neg_pattern ~locals pos_table pattern_ast) rule_ast.Ast.neg_patterns;
      commands = build_commands ~param:(pat_vars,cmd_vars) ~locals pos pos_table rule_ast.Ast.commands;
      loc = rule_ast.Ast.rule_loc;
      param = param;
      param_names = (pat_vars,cmd_vars)
    }

pj2m's avatar
pj2m committed
280
  type matching = {
bguillaum's avatar
bguillaum committed
281
      n_match: gid Pid_map.t;                   (* partial fct: pattern nodes |--> graph nodes *)
pj2m's avatar
pj2m committed
282 283
      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 *)
284
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
285
    }
286

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

pj2m's avatar
pj2m committed
289 290
  let e_comp (e1,_) (e2,_) = compare e1 e2

bguillaum's avatar
bguillaum committed
291
  let e_match_add ?pos edge_id matching =
pj2m's avatar
pj2m committed
292 293
    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
294
    | None -> Error.bug "The edge identifier '%s' is binded twice in the same pattern" (fst edge_id)
bguillaum's avatar
bguillaum committed
295

pj2m's avatar
pj2m committed
296 297
  let a_match_add edge matching = {matching with a_match = edge::matching.a_match }

bguillaum's avatar
bguillaum committed
298
  let up_deco matching =
299 300
    { G_deco.nodes = Pid_map.fold (fun _ gid acc -> gid::acc) matching.n_match [];
      G_deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
pj2m's avatar
pj2m committed
301 302
    }

bguillaum's avatar
bguillaum committed
303
  let find cnode ?loc (matching, created_nodes) =
pj2m's avatar
pj2m committed
304
    match cnode with
bguillaum's avatar
bguillaum committed
305
    | Command.Pid pid ->
306
        (try Pid_map.find pid matching.n_match
bguillaum's avatar
bguillaum committed
307 308 309
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%s' not found" (Pid.to_string pid))
    | Command.New name ->
        try List.assoc name created_nodes
310
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name
bguillaum's avatar
bguillaum committed
311

pj2m's avatar
pj2m committed
312 313 314

  let down_deco (matching,created_nodes) commands =
    {
315
     G_deco.nodes = List.fold_left
pj2m's avatar
pj2m committed
316
       (fun acc -> function
317
         | (Command.UPDATE_FEAT (tar_cn,_,_),loc)
bguillaum's avatar
bguillaum committed
318
         | (Command.SHIFT_EDGE (_,tar_cn),loc) ->
319 320
             (find tar_cn (matching, created_nodes)) :: acc
         | _ -> acc
pj2m's avatar
pj2m committed
321
       ) [] commands;
322
     G_deco.edges = List.fold_left
bguillaum's avatar
bguillaum committed
323 324
       (fun acc -> function
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->
325
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
326
         | _ -> acc
pj2m's avatar
pj2m committed
327 328 329 330 331 332
       ) [] commands
   }

  exception Fail
(* ================================================================================ *)
  type partial = {
bguillaum's avatar
bguillaum committed
333
      sub: matching;
pj2m's avatar
pj2m committed
334
      unmatched_nodes: pid list;
335
      unmatched_edges: (pid * P_edge.t * pid) list;
pj2m's avatar
pj2m committed
336 337
      already_matched_gids: gid list; (* to ensure injectivity *)
      check: const list (* constraints to verify at the end of the matching *)
bguillaum's avatar
bguillaum committed
338 339 340 341
    }

        (* PREREQUISITES:
           - all partial matching have the same domain
342 343
           - the domain of the pattern P is the disjoint union of domain([sub]) and [unmatched_nodes]
         *)
pj2m's avatar
pj2m committed
344

bguillaum's avatar
bguillaum committed
345
  let init param pattern =
346
    let roots = P_graph.roots pattern.graph in
pj2m's avatar
pj2m committed
347

348
    let node_list = Pid_map.fold (fun pid _ acc -> pid::acc) pattern.graph [] in
pj2m's avatar
pj2m committed
349 350

    (* put all roots in the front of the list to speed up the algo *)
bguillaum's avatar
bguillaum committed
351
    let sorted_node_list =
pj2m's avatar
pj2m committed
352
      List.sort
353 354 355 356
        (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
357

bguillaum's avatar
bguillaum committed
358
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
359 360 361 362 363 364
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
      check = pattern.constraints;
    }

365 366 367
(* Ocaml < 3.12 doesn't have exists function for maps! *)
  exception True
  let gid_map_exists fct map =
bguillaum's avatar
bguillaum committed
368
    try
369 370 371 372 373 374
      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! *)


bguillaum's avatar
bguillaum committed
375 376
  let fullfill graph matching = function
    | Cst_out (pid,edge) ->
377 378
        let gid = Pid_map.find pid matching.n_match in
        G_graph.edge_out graph gid edge
bguillaum's avatar
bguillaum committed
379
    | Cst_in (pid,edge) ->
380
        let gid = Pid_map.find pid matching.n_match in
381
        gid_map_exists (* should be Gid_map.exists with ocaml 3.12 *)
382
          (fun _ node ->
383
            List.exists (fun e -> P_edge.compatible edge e) (Massoc_gid.assoc gid (G_node.get_next node))
384
          ) graph
385
    | Feature_eq (pid1, feat_name1, pid2, feat_name2) ->
386 387
        let gnode1 = Gid_map.find (Pid_map.find pid1 matching.n_match) graph in
        let gnode2 = Gid_map.find (Pid_map.find pid2 matching.n_match) graph in
388 389
        (match (G_fs.get_atom feat_name1 (G_node.get_fs gnode1),
                G_fs.get_atom feat_name2 (G_node.get_fs gnode2)
390
               ) with
bguillaum's avatar
bguillaum committed
391 392
        | Some fv1, Some fv2 when fv1 = fv2 -> true
        | _ -> false)
pj2m's avatar
pj2m committed
393
    | Filter (pid, fs) ->
394
        let gid = Pid_map.find pid matching.n_match in
395
        let gnode = Gid_map.find gid graph in
396
        P_fs.filter fs (G_node.get_fs gnode)
pj2m's avatar
pj2m committed
397

bguillaum's avatar
bguillaum committed
398
  (* returns all extension of the partial input matching *)
399
  let rec extend_matching (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
400
    match (partial.unmatched_edges, partial.unmatched_nodes) with
bguillaum's avatar
bguillaum committed
401 402
    | [], [] ->
        if List.for_all (fun const -> fullfill graph partial.sub const) partial.check
403 404
        then [partial.sub, partial.already_matched_gids]
        else []
pj2m's avatar
pj2m committed
405
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
406 407
        begin
          try (* is the tar already found in the matching ? *)
bguillaum's avatar
bguillaum committed
408
            let new_partials =
409 410 411
              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
412
              let g_edges = Massoc_gid.assoc tar_gid (G_node.get_next src_gnode) in
bguillaum's avatar
bguillaum committed
413

414 415
              match P_edge.match_list p_edge g_edges with
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
416
                  []
417
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
bguillaum's avatar
bguillaum committed
418
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ]
419
              | 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) *)
bguillaum's avatar
bguillaum committed
420
                  List.map
421 422
                    (fun label ->
                      {partial with sub = e_match_add (id,(src_gid,label,tar_gid)) partial.sub; unmatched_edges = tail_ue }
bguillaum's avatar
bguillaum committed
423
                    ) labels
424 425 426
            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 *)
bguillaum's avatar
bguillaum committed
427
              let (src_gid : Gid.t) = Pid_map.find src_pid partial.sub.n_match in
428
              let src_gnode = G_graph.find src_gid graph in
429
              Massoc_gid.fold
430
                (fun acc gid_next g_edge ->
431 432
                  match P_edge.match_ p_edge g_edge with
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
433
                      acc
434
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
bguillaum's avatar
bguillaum committed
435
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc
436
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
437
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
438 439
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
440
            List_.flat_map
bguillaum's avatar
bguillaum committed
441
              (fun (gid_next, matching) ->
442 443 444 445
                extend_matching_from (positive,neg) graph tar_pid gid_next
                  {partial with sub=matching; unmatched_edges = tail_ue}
              ) candidates
        end
bguillaum's avatar
bguillaum committed
446 447
    | [], pid :: _ ->
        Gid_map.fold
448 449
          (fun gid _ acc ->
            (extend_matching_from (positive,neg) graph pid gid partial) @ acc
450
          ) graph []
bguillaum's avatar
bguillaum committed
451 452

  and extend_matching_from (positive,neg) (graph:G_graph.t) pid (gid : Gid.t) partial =
pj2m's avatar
pj2m committed
453 454 455
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
bguillaum's avatar
bguillaum committed
456 457 458 459 460 461 462 463 464 465
      let p_node =
        try P_graph.find pid positive
        with Not_found ->
          try P_graph.find pid neg
          with Not_found -> Error.bug "[Grew_rule.extend_matching_from] cannot find node" in

      (* let p_node =  *)
      (*   if pid >= 0  *)
      (*   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 *)
466
      let g_node = try G_graph.find gid graph with Not_found -> failwith "INS" in
bguillaum's avatar
bguillaum committed
467

bguillaum's avatar
bguillaum committed
468
      try
469 470 471

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

472
        (* add all out-edges from pid in pattern *)
bguillaum's avatar
bguillaum committed
473 474
        let new_unmatched_edges =
          Massoc_pid.fold
475
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
476
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
477 478

        let new_partial =
bguillaum's avatar
bguillaum committed
479
          { partial with
bguillaum's avatar
bguillaum committed
480
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> failwith "List_.rm");
bguillaum's avatar
bguillaum committed
481 482 483 484
            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
485
        extend_matching (positive,neg) graph new_partial
486
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
487 488

(* the exception below is added to handle unification failure in merge!! *)
489
  exception Command_execution_fail
pj2m's avatar
pj2m committed
490 491

(** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
492 493 494 495
  let apply_command (command,loc) instance matching created_nodes =
    let node_find cnode = find ~loc cnode (matching, created_nodes) in

    match command with
bguillaum's avatar
bguillaum committed
496
    | Command.ADD_EDGE (src_cn,tar_cn,edge) ->
497 498 499
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
500
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
bguillaum's avatar
bguillaum committed
501
          | Some new_graph ->
502
              (
bguillaum's avatar
bguillaum committed
503 504
               {instance with
                Instance.graph = new_graph;
505
                history = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.history
506 507 508
              },
               created_nodes
              )
bguillaum's avatar
bguillaum committed
509
          | None ->
510
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string edge) (Loc.to_string loc)
511 512
        end

bguillaum's avatar
bguillaum committed
513
    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) ->
514 515 516
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
517 518
         {instance with
          Instance.graph = G_graph.del_edge loc instance.Instance.graph src_gid edge tar_gid;
519
           history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
520 521 522 523 524
        },
         created_nodes
        )

    | Command.DEL_EDGE_NAME edge_ident ->
bguillaum's avatar
bguillaum committed
525 526
        let (src_gid,edge,tar_gid) =
          try List.assoc edge_ident matching.e_match
527 528
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
bguillaum's avatar
bguillaum committed
529 530
         {instance with
          Instance.graph = G_graph.del_edge ~edge_ident loc instance.Instance.graph src_gid edge tar_gid;
531
          history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
532 533
        },
         created_nodes
bguillaum's avatar
bguillaum committed
534
        )
535

bguillaum's avatar
bguillaum committed
536
    | Command.DEL_NODE node_cn ->
537 538
        let node_gid = node_find node_cn in
        (
bguillaum's avatar
bguillaum committed
539
         {instance with
540
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
541
          history = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.history
542 543 544 545 546 547 548
        },
         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
549
        (match G_graph.merge_node loc instance.Instance.graph src_gid tar_gid with
bguillaum's avatar
bguillaum committed
550
        | Some new_graph ->
551
            (
bguillaum's avatar
bguillaum committed
552
             {instance with
553
              Instance.graph = new_graph;
554
              history = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.history
555 556 557 558 559
            },
             created_nodes
            )
        | None -> raise Command_execution_fail
        )
bguillaum's avatar
bguillaum committed
560

561
    | Command.UPDATE_FEAT (tar_cn,tar_feat_name, item_list) ->
bguillaum's avatar
bguillaum committed
562
        let tar_gid = node_find tar_cn in
563 564
        let rule_items = List.map
            (function
bguillaum's avatar
bguillaum committed
565 566
              | Command.Feat (cnode, feat_name) -> Concat_item.Feat (node_find cnode, feat_name)
              | Command.String s -> Concat_item.String s
bguillaum's avatar
bguillaum committed
567
              | Command.Param_out index ->
bguillaum's avatar
bguillaum committed
568 569
                  (match matching.m_param with
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
570
                  | Some param -> Concat_item.String (Lex_par.get_command_value index param))
bguillaum's avatar
bguillaum committed
571
              | Command.Param_in index ->
bguillaum's avatar
bguillaum committed
572
                  (match matching.m_param with
573
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
574
                  | Some param -> Concat_item.String (Lex_par.get_param_value index param))
575
            ) item_list in
576

bguillaum's avatar
bguillaum committed
577
        let (new_graph, new_feature_value) =
578
          G_graph.update_feat ~loc instance.Instance.graph tar_gid tar_feat_name rule_items in
bguillaum's avatar
bguillaum committed
579
        (
580 581
         {instance with
          Instance.graph = new_graph;
582
          history = List_.sort_insert (Command.H_UPDATE_FEAT (tar_gid,tar_feat_name,new_feature_value)) instance.Instance.history
bguillaum's avatar
bguillaum committed
583 584
        },
         created_nodes
585
        )
586 587 588 589

    | Command.DEL_FEAT (tar_cn,feat_name) ->
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
590
         {instance with
591
          Instance.graph = G_graph.del_feat instance.Instance.graph tar_gid feat_name;
592
          history = List_.sort_insert (Command.H_DEL_FEAT (tar_gid,feat_name)) instance.Instance.history
593 594
        },
         created_nodes
bguillaum's avatar
bguillaum committed
595
        )
596 597

    | Command.NEW_NEIGHBOUR (created_name,edge,base_pid) ->
598 599
        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
600
        (
bguillaum's avatar
bguillaum committed
601
         {instance with
602
          Instance.graph = new_graph;
603 604
          history = List_.sort_insert (Command.H_NEW_NEIGHBOUR (created_name,edge,new_gid)) instance.Instance.history;
          activated_node = new_gid :: instance.Instance.activated_node;
605 606 607 608
        },
         (created_name,new_gid) :: created_nodes
        )

609 610 611 612
    | Command.SHIFT_IN (src_cn,tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
613 614
         {instance with
          Instance.graph = G_graph.shift_in loc instance.Instance.graph src_gid tar_gid;
615
          history = List_.sort_insert (Command.H_SHIFT_IN (src_gid,tar_gid)) instance.Instance.history
616 617 618 619 620 621 622 623
        },
         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
        (
bguillaum's avatar
bguillaum committed
624 625
         {instance with
          Instance.graph = G_graph.shift_out loc instance.Instance.graph src_gid tar_gid;
626
          history = List_.sort_insert (Command.H_SHIFT_OUT (src_gid,tar_gid)) instance.Instance.history
627 628 629 630
        },
         created_nodes
        )

bguillaum's avatar
bguillaum committed
631
    | Command.SHIFT_EDGE (src_cn,tar_cn) ->
632 633 634
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
635 636 637 638 639
          {instance with
            Instance.graph = G_graph.shift_edges loc instance.Instance.graph src_gid tar_gid;
            history = List_.sort_insert (Command.H_SHIFT_EDGE (src_gid,tar_gid)) instance.Instance.history
          },
          created_nodes
640
        )
pj2m's avatar
pj2m committed
641

bguillaum's avatar
bguillaum committed
642
(** [apply_rule instance matching rule] returns a new instance after the application of the rule
pj2m's avatar
pj2m committed
643 644
    [Command_execution_fail] is raised if some merge unification fails
 *)
bguillaum's avatar
bguillaum committed
645
  let apply_rule instance matching rule =
pj2m's avatar
pj2m committed
646

bguillaum's avatar
bguillaum committed
647 648 649
    (* Timeout check *)
    (try Timeout.check () with Timeout.Stop -> Error.run "Time out");

650 651
    (* limit the rewriting depth to avoid looping rewriting *)
    begin
bguillaum's avatar
bguillaum committed
652
      if List.length instance.Instance.rules >= !max_depth
653 654
      then Error.run "Bound reached (when applying rule %s)" rule.name
    end;
bguillaum's avatar
bguillaum committed
655

656
    let (new_instance, created_nodes) =
bguillaum's avatar
bguillaum committed
657
      List.fold_left
658 659
        (fun (instance, created_nodes) command ->
          apply_command command instance matching created_nodes
bguillaum's avatar
bguillaum committed
660 661
        )
        (instance, [])
662 663 664
        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
665

bguillaum's avatar
bguillaum committed
666
    {new_instance with
667 668 669 670
     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 }
bguillaum's avatar
bguillaum committed
671
   }
pj2m's avatar
pj2m committed
672 673 674

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

bguillaum's avatar
bguillaum committed
675
  let update_partial pos_graph without (sub, already_matched_gids) =
676
    let neg_graph = without.graph in
bguillaum's avatar
bguillaum committed
677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696
    let unmatched_nodes =
      Pid_map.fold
        (fun pid _ acc -> match pid with Pid.Neg _ -> pid::acc | _ -> acc)
        neg_graph [] in
    let unmatched_edges =
      Pid_map.fold
        (fun pid node acc ->
          match pid with
            | Pid.Neg _ -> acc
            | Pid.Pos i ->
          (* if pid < 0  *)
          (* then acc *)
          (* else  *)
              Massoc_pid.fold
                (fun acc2 pid_next p_edge -> (pid, p_edge, pid_next) :: acc2)
                acc (P_node.get_next node)

            (* Massoc.fold_left  *)
            (*   (fun acc2 pid_next p_edge -> (pid, p_edge, pid_next) :: acc2) *)
            (*   acc (P_node.get_next node) *)
697
        ) neg_graph [] in
698 699 700 701 702 703 704
    {
     sub = sub;
     unmatched_nodes = unmatched_nodes;
     unmatched_edges = unmatched_edges;
     already_matched_gids = already_matched_gids;
     check = without.constraints;
   }
bguillaum's avatar
bguillaum committed
705

pj2m's avatar
pj2m committed
706

707 708 709
  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 *)
bguillaum's avatar
bguillaum committed
710
    | x -> false
pj2m's avatar
pj2m committed
711 712 713


(** [one_step instance rules] computes the list of one-step reduct with rules *)
714
  let one_step instance rules =
bguillaum's avatar
bguillaum committed
715 716
    List.fold_left
      (fun acc rule ->
717 718 719
        let pos_graph = rule.pos.graph in

        (* get the list of partial matching for positive part of the pattern *)
bguillaum's avatar
bguillaum committed
720 721 722 723
        let matching_list =
          extend_matching
            (pos_graph,P_graph.empty)
            instance.Instance.graph
bguillaum's avatar
bguillaum committed
724
            (init rule.param rule.pos) in
725 726 727 728

        let filtered_matching_list =
          List.filter
            (fun (sub, already_matched_gids) ->
bguillaum's avatar
bguillaum committed
729 730
              List.for_all
                (fun without ->
731 732 733 734 735
                  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
bguillaum's avatar
bguillaum committed
736 737 738 739

        List.fold_left
          (fun acc1 (matching,_) ->
            try (apply_rule instance matching rule) :: acc1
740 741
            with Command_execution_fail -> Printf.printf "******\n%!"; acc1
          ) acc filtered_matching_list
bguillaum's avatar
bguillaum committed
742
      ) [] rules
pj2m's avatar
pj2m committed
743 744

(** [conf_one_step instance rules] computes one Some (one-step reduct) with rules, None if no rule apply *)
745 746 747 748 749 750
  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 *)
bguillaum's avatar
bguillaum committed
751 752 753 754
        let matching_list =
          extend_matching
            (pos_graph,P_graph.empty)
            instance.Instance.graph
bguillaum's avatar
bguillaum committed
755
            (init rule.param rule.pos) in
bguillaum's avatar
bguillaum committed
756 757

        try
758 759 760
          let (first_matching_where_all_witout_are_fulfilled,_) =
            List.find
              (fun (sub, already_matched_gids) ->
bguillaum's avatar
bguillaum committed
761 762
                List.for_all
                  (fun without ->
763 764 765 766 767 768 769
                    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
770 771 772


(** filter nfs being equal *)
773
  let rec filter_equal_nfs nfs =
bguillaum's avatar
bguillaum committed
774
    Instance_set.fold
775 776 777 778 779
      (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
bguillaum's avatar
bguillaum committed
780

pj2m's avatar
pj2m committed
781 782
(** normalize [t] according to the [rules]
 * [t] is a raw graph
783
 * Info about the commands applied on [t] are kept
pj2m's avatar
pj2m committed
784 785
 *)

786
  (* type: Instance.t -> t list -> Instance_set.t *)
787
  let normalize_instance modul_name instance rules =
bguillaum's avatar
bguillaum committed
788
    let rec loop to_do nf =
pj2m's avatar
pj2m committed
789
      if to_do = Instance_set.empty
790 791
      then nf
      else
bguillaum's avatar
bguillaum committed
792 793
        let (new_to_do,new_nf) =
          Instance_set.fold
794 795 796 797 798 799 800 801
            (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
bguillaum's avatar
bguillaum committed
802
    let nfs = loop (Instance_set.singleton instance) Instance_set.empty in
803
    let reduced_nfs = filter_equal_nfs nfs in
bguillaum's avatar
bguillaum committed
804

805 806
    let reduced_nfs_card = Instance_set.cardinal reduced_nfs in
    let nfs_card = Instance_set.cardinal nfs in
bguillaum's avatar
bguillaum committed
807
    if reduced_nfs_card < nfs_card
808 809 810
    then Log.fwarning "In module \"%s\", %d nf are produced, only %d different ones" modul_name nfs_card reduced_nfs_card;

    reduced_nfs
bguillaum's avatar
bguillaum committed
811

812 813 814 815 816 817 818
  (* [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
bguillaum's avatar
bguillaum committed
819

820
          (* get the list of partial matching for positive part of the pattern *)
bguillaum's avatar
bguillaum committed
821 822 823 824
          let matching_list =
            extend_matching
              (pos_graph,P_graph.empty)
              instance.Instance.graph
825
              (init filter.param filter.pos) in
bguillaum's avatar
bguillaum committed
826

827 828
          if List.exists
              (fun (sub, already_matched_gids) ->
bguillaum's avatar
bguillaum committed
829 830
                List.for_all
                  (fun without ->
831 832 833 834 835 836 837 838 839 840
                    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
841

842 843 844 845 846
  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

847
  let normalize modul_name ?(confluent=false) rules filters instance =
848 849 850
    if confluent
    then
      let output = conf_normalize instance rules in
bguillaum's avatar
bguillaum committed
851
      if filter_instance filters output
852 853 854
      then (Instance_set.singleton output, Instance_set.empty)
      else (Instance_set.empty, Instance_set.singleton output)
    else
bguillaum's avatar
bguillaum committed
855
      let output_set = normalize_instance modul_name instance rules in
856
      let (good_set, bad_set) = Instance_set.partition (filter_instance filters) output_set in
857
      (good_set, bad_set)
858

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