grew_rule.ml 41 KB
Newer Older
bguillaum's avatar
bguillaum committed
1 2 3 4 5 6 7 8 9 10
(**********************************************************************************)
(*    Libcaml-grew - a Graph Rewriting library dedicated to NLP applications      *)
(*                                                                                *)
(*    Copyright 2011-2013 Inria, Université de Lorraine                           *)
(*                                                                                *)
(*    Webpage: http://grew.loria.fr                                               *)
(*    License: CeCILL (see LICENSE folder or "http://www.cecill.info")            *)
(*    Authors: see AUTHORS file                                                   *)
(**********************************************************************************)

pj2m's avatar
pj2m committed
11
open Log
bguillaum's avatar
bguillaum committed
12
open Printf
pj2m's avatar
pj2m committed
13

14
open Grew_base
15 16
open Grew_types

bguillaum's avatar
bguillaum committed
17
open Grew_ast
pj2m's avatar
pj2m committed
18
open Grew_edge
bguillaum's avatar
bguillaum committed
19
open Grew_fs
pj2m's avatar
pj2m committed
20
open Grew_node
bguillaum's avatar
bguillaum committed
21 22
open Grew_command
open Grew_graph
pj2m's avatar
pj2m committed
23

24
(* ================================================================================ *)
pj2m's avatar
pj2m committed
25 26
module Instance = struct
  type t = {
27 28 29
    graph: G_graph.t;
    history: Command.h list;
    rules: string list;
30
    big_step: Libgrew_types.big_step option;
31 32 33 34 35 36 37 38 39
    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;
40
      free_index = (G_graph.max_binding graph) + 1;
pj2m's avatar
pj2m committed
41 42
    }

bguillaum's avatar
bguillaum committed
43
  let rev_steps t =
pj2m's avatar
pj2m committed
44
    { t with big_step = match t.big_step with
45
      | None -> None
46
      | Some bs -> Some {bs with Libgrew_types.small_step = List.rev bs.Libgrew_types.small_step }
pj2m's avatar
pj2m committed
47 48
    }

49 50 51 52 53 54 55 56 57 58
  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
59

60
  (* comparison is done on the list of commands *)
bguillaum's avatar
bguillaum committed
61
  (* only graph rewritten from the same init graph can be "compared" *)
62
  let compare t1 t2 = Pervasives.compare t1.history t2.history
pj2m's avatar
pj2m committed
63

64 65
  let to_gr t = G_graph.to_gr t.graph

bguillaum's avatar
bguillaum committed
66 67
  let to_conll t = G_graph.to_conll t.graph

68
  let save_dot_png ?filter ?main_feat base t =
bguillaum's avatar
bguillaum committed
69
    ignore (Dot.to_png_file (G_graph.to_dot ?main_feat t.graph) (base^".png"))
70

bguillaum's avatar
bguillaum committed
71
  IFDEF DEP2PICT THEN
72
  let save_dep_png ?filter ?main_feat base t =
73 74 75 76 77 78 79 80 81 82 83
    let (_,_,highlight_position) =
      Dep2pict.Dep2pict.fromDepStringToPng_with_pos
        (G_graph.to_dep ?filter ?main_feat t.graph) (base^".png") in
    highlight_position

  let save_dep_svg ?filter ?main_feat base t =
    let (_,_,highlight_position) =
      Dep2pict.Dep2pict.fromDepStringToSvgFile_with_pos
        (G_graph.to_dep ?filter ?main_feat t.graph) (base^".svg") in
    highlight_position

bguillaum's avatar
bguillaum committed
84
  ELSE
85 86
  let save_dep_png ?filter ?main_feat base t = None
  let save_dep_svg ?filter ?main_feat base t = None
bguillaum's avatar
bguillaum committed
87
  ENDIF
88
end (* module Instance *)
pj2m's avatar
pj2m committed
89

90
(* ================================================================================ *)
91
module Instance_set = Set.Make (Instance)
pj2m's avatar
pj2m committed
92

93
(* ================================================================================ *)
bguillaum's avatar
bguillaum committed
94 95
module Rule = struct
  (* the rewriting depth is bounded to stop rewriting when the system is not terminating *)
96
  let max_depth = ref 500
pj2m's avatar
pj2m committed
97

98
  type const =
bguillaum's avatar
bguillaum committed
99 100
    | Cst_out of Pid.t * Label_cst.t
    | Cst_in of Pid.t * Label_cst.t
101
    | Feature_eq of Pid.t * string * Pid.t * string
102
    | Feature_diseq of Pid.t * string * Pid.t * string
bguillaum's avatar
bguillaum committed
103

104
    | Feature_ineq of Ast.ineq * Pid.t * string * Pid.t * string
105 106
    | Feature_ineq_cst of Ast.ineq * Pid.t * string * float

bguillaum's avatar
bguillaum committed
107
    | Filter of Pid.t * P_fs.t (* used when a without impose a fs on a node defined by the match basic *)
pj2m's avatar
pj2m committed
108

bguillaum's avatar
bguillaum committed
109 110 111
  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
112 113 114 115
      | (Ast.Cst_out (id,label_cst), loc) ->
        Cst_out (pid_of_name loc id, Label_cst.build ~loc ?locals label_cst)
      | (Ast.Cst_in (id,label_cst), loc) ->
        Cst_in (pid_of_name loc id, Label_cst.build ~loc ?locals label_cst)
116 117

      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
118
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
119
      | (Ast.Feature_diseq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
120
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
121
      | (Ast.Feature_ineq (ineq, (node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
122
        Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
123 124 125
      | (Ast.Feature_ineq_cst (ineq, (node_name1, feat_name1), constant), loc) ->
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)

bguillaum's avatar
bguillaum committed
126

bguillaum's avatar
bguillaum committed
127
  type basic = {
128 129 130
    graph: P_graph.t;
    constraints: const list;
  }
pj2m's avatar
pj2m committed
131

bguillaum's avatar
bguillaum committed
132
  let build_pos_basic ?pat_vars ?(locals=[||]) basic_ast =
133
    let (graph, pos_table) =
bguillaum's avatar
bguillaum committed
134
      P_graph.build ?pat_vars ~locals basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
135
    (
bguillaum's avatar
bguillaum committed
136 137
      {
        graph = graph;
bguillaum's avatar
bguillaum committed
138
        constraints = List.map (build_pos_constraint ~locals pos_table) basic_ast.Ast.pat_const
bguillaum's avatar
bguillaum committed
139 140
      },
      pos_table
pj2m's avatar
pj2m committed
141 142
    )

bguillaum's avatar
bguillaum committed
143
  (* the neg part *)
pj2m's avatar
pj2m committed
144
  let build_neg_constraint ?locals pos_table neg_table const =
bguillaum's avatar
bguillaum committed
145 146 147 148
    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
149
    match const with
150 151 152 153
      | (Ast.Cst_out (id,label_cst), loc) ->
        Cst_out (pid_of_name loc id, Label_cst.build ~loc ?locals label_cst)
      | (Ast.Cst_in (id,label_cst), loc) ->
        Cst_in (pid_of_name loc id, Label_cst.build ~loc ?locals label_cst)
154

155 156 157
      | (Ast.Feature_eq (feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
158

bguillaum's avatar
bguillaum committed
159
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
160 161 162
      | (Ast.Feature_diseq (feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
bguillaum's avatar
bguillaum committed
163
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
164 165 166
      | (Ast.Feature_ineq (ineq, feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
bguillaum's avatar
bguillaum committed
167
        Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
168 169 170
      | (Ast.Feature_ineq_cst (ineq, feat_id1, constant), loc) ->
        let (node_name1, feat_name1) = feat_id1 in
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)
pj2m's avatar
pj2m committed
171

bguillaum's avatar
bguillaum committed
172
  (* It may raise [P_fs.Fail_unif] in case of contradiction on constraints *)
bguillaum's avatar
bguillaum committed
173
  let build_neg_basic ?pat_vars ?(locals=[||]) pos_table basic_ast =
pj2m's avatar
pj2m committed
174
    let (extension, neg_table) =
bguillaum's avatar
bguillaum committed
175
      P_graph.build_extension ?pat_vars ~locals pos_table basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
bguillaum's avatar
bguillaum committed
176

177
    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
178
    {
bguillaum's avatar
bguillaum committed
179
      graph = extension.P_graph.ext_map;
bguillaum's avatar
bguillaum committed
180
      constraints = filters @ List.map (build_neg_constraint ~locals pos_table neg_table) basic_ast.Ast.pat_const ;
bguillaum's avatar
bguillaum committed
181
    }
pj2m's avatar
pj2m committed
182

bguillaum's avatar
bguillaum committed
183
  let get_edge_ids basic =
184
    Pid_map.fold
bguillaum's avatar
bguillaum committed
185 186
      (fun _ node acc ->
        Massoc_pid.fold
187 188
          (fun acc2 _ edge -> match P_edge.get_id edge with None -> acc2 | Some id -> id::acc2)
          acc (P_node.get_next node)
bguillaum's avatar
bguillaum committed
189
      ) basic.graph []
bguillaum's avatar
bguillaum committed
190

191 192 193
  (* a [pattern] is described by the positive basic and a list of negative basics. *)
  type pattern = basic * basic list

pj2m's avatar
pj2m committed
194 195
  type t = {
      name: string;
196
      pattern: pattern;
pj2m's avatar
pj2m committed
197
      commands: Command.t list;
198
      param: Lex_par.t option;
199
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
200
      loc: Loc.t;
pj2m's avatar
pj2m committed
201 202
    }

bguillaum's avatar
bguillaum committed
203 204
  let get_name t = t.name

205
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
206

207 208 209
  let is_filter t = t.commands = []

  (* ====================================================================== *)
210
  let to_dep t =
211
    let pos_basic = fst t.pattern in
212 213 214
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

bguillaum's avatar
bguillaum committed
215 216
    let nodes =
      Pid_map.fold
217
        (fun id node acc ->
bguillaum's avatar
bguillaum committed
218 219
          (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))
220
          )
221
          :: acc
222
        ) pos_basic.graph [] in
223

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

227 228 229 230 231 232 233 234
    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
235
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i
236
          | _ -> ()
237
      ) pos_basic.constraints;
238
    bprintf buff "}\n";
bguillaum's avatar
bguillaum committed
239

240
    bprintf buff "[EDGES] {\n";
bguillaum's avatar
bguillaum committed
241

242 243
    Pid_map.iter
      (fun id_src node ->
bguillaum's avatar
bguillaum committed
244
        Massoc_pid.iter
245
          (fun id_tar edge ->
bguillaum's avatar
bguillaum committed
246 247 248
            bprintf buff "  N_%s -> N_%s { label=\"%s\"}\n"
              (Pid.to_id id_src)
              (Pid.to_id id_tar)
249 250 251
              (P_edge.to_string edge)
          )
          (P_node.get_next node)
252
      ) pos_basic.graph;
253 254 255 256

    List_.iteri
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
257
          | Cst_out (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
258
            bprintf buff "  N_%s -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n"
bguillaum's avatar
bguillaum committed
259 260
              (Pid.to_id pid) i (Label_cst.to_string label_cst)
          | Cst_in (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
261
            bprintf buff "  C_%d -> N_%s {label = \"%s\"; style=dot; bottom; color=green;}\n"
bguillaum's avatar
bguillaum committed
262
              i (Pid.to_id pid) (Label_cst.to_string label_cst)
263
          | _ -> ()
264
      ) pos_basic.constraints;
265 266
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
267

268
  (* ====================================================================== *)
269
  let build_commands ?param ?(locals=[||]) suffixes pos pos_table ast_commands =
270
    let known_act_ids = List.map (fun x -> (Ast.No_sharp x)) (Array.to_list pos_table) in
271
    let known_edge_ids = get_edge_ids pos in
272

273
    let rec loop (kai,kei) = function
274 275
      | [] -> []
      | ast_command :: tail ->
276
          let (command, (new_kai, new_kei)) =
277 278
            Command.build
              ?param
279
              (kai,kei)
280 281
              pos_table
              locals
282
              suffixes
283
              ast_command in
284 285
          command :: (loop (new_kai,new_kei) tail) in
    loop (known_act_ids, known_edge_ids) ast_commands
286 287

  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
288 289 290 291 292 293 294 295 296 297 298 299
  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

300
  (* ====================================================================== *)
301
  let build ?(locals=[||]) suffixes dir rule_ast =
bguillaum's avatar
bguillaum committed
302 303

    let (param, pat_vars, cmd_vars) =
bguillaum's avatar
bguillaum committed
304 305
      match rule_ast.Ast.param with
      | None -> (None,[],[])
306
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
307 308 309
          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
bguillaum's avatar
bguillaum committed
310 311 312 313 314 315

          let local_param = match rule_ast.Ast.lex_par with
          | None -> None
          | Some lines -> Some (Lex_par.from_lines ~loc:rule_ast.Ast.rule_loc nb_pv nb_cv lines) in

          let full_param = List.fold_left
316
            (fun acc file ->
bguillaum's avatar
bguillaum committed
317 318 319 320 321 322
              match acc with
              | None -> Some (Lex_par.load ~loc:rule_ast.Ast.rule_loc dir nb_pv nb_cv file)
              | Some lp -> Some (Lex_par.append (Lex_par.load ~loc:rule_ast.Ast.rule_loc dir nb_pv nb_cv file) lp)
            ) local_param files in

          (full_param, pat_vars, cmd_vars) in
323

bguillaum's avatar
bguillaum committed
324
    let (pos, pos_table) = build_pos_basic ~pat_vars ~locals rule_ast.Ast.pos_basic in
bguillaum's avatar
bguillaum committed
325 326 327 328 329 330 331 332 333
    let (negs,_) =
      List.fold_left
      (fun (acc,pos) basic_ast ->
        try ((build_neg_basic ~pat_vars ~locals pos_table basic_ast) :: acc, pos+1)
        with P_fs.Fail_unif ->
          Log.fwarning "In rule \"%s\" [%s], the wihtout number %d cannot be satisfied, it is skipped"
            rule_ast.Ast.rule_id (Loc.to_string rule_ast.Ast.rule_loc) pos;
          (acc, pos+1)
      ) ([],1) rule_ast.Ast.neg_basics in
pj2m's avatar
pj2m committed
334
    {
bguillaum's avatar
bguillaum committed
335
      name = rule_ast.Ast.rule_id;
336
      pattern = (pos, negs);
337
      commands = build_commands ~param:(pat_vars,cmd_vars) ~locals suffixes pos pos_table rule_ast.Ast.commands;
bguillaum's avatar
bguillaum committed
338 339 340 341 342
      loc = rule_ast.Ast.rule_loc;
      param = param;
      param_names = (pat_vars,cmd_vars)
    }

343 344
  let build_pattern pattern_ast =
    let (pos, pos_table) = build_pos_basic pattern_ast.Ast.pat_pos in
bguillaum's avatar
bguillaum committed
345
    let negs = List_.try_map P_fs.Fail_unif (fun basic_ast -> build_neg_basic pos_table basic_ast) pattern_ast.Ast.pat_negs in
bguillaum's avatar
bguillaum committed
346 347
    (pos, negs)

348
  (* ====================================================================== *)
pj2m's avatar
pj2m committed
349
  type matching = {
350
      n_match: Gid.t Pid_map.t;                     (* partial fct: pattern nodes |--> graph nodes *)
351
      e_match: (string*(Gid.t*Label.t*Gid.t)) list; (* edge matching: edge ident  |--> (src,label,tar) *)
bguillaum's avatar
bguillaum committed
352
      a_match: (Gid.t*Label.t*Gid.t) list;          (* anonymous edge matched *)
353
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
354
    }
355

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

pj2m's avatar
pj2m committed
358 359
  let e_comp (e1,_) (e2,_) = compare e1 e2

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

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

367
  let match_deco pattern matching =
368 369 370
    { G_deco.nodes =
        Pid_map.fold
          (fun pid gid acc ->
371
            let pnode = P_graph.find pid (fst pattern).graph in
372 373
            (gid, (P_node.get_name pnode, P_fs.feat_list (P_node.get_fs pnode))) ::acc
          ) matching.n_match [];
374
      G_deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
pj2m's avatar
pj2m committed
375 376
    }

bguillaum's avatar
bguillaum committed
377
  let find cnode ?loc (matching, (created_nodes,activated_nodes)) =
pj2m's avatar
pj2m committed
378
    match cnode with
379
    | Command.Pat pid ->
380
        (try Pid_map.find pid matching.n_match
bguillaum's avatar
bguillaum committed
381 382
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%s' not found" (Pid.to_string pid))
    | Command.New name ->
bguillaum's avatar
bguillaum committed
383 384
        (try List.assoc name created_nodes
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name)
bguillaum's avatar
bguillaum committed
385 386 387 388
    | Command.Act (pid, new_name) ->
        (try List.assoc (pid, new_name) activated_nodes
        with Not_found -> Error.run ?loc "Activated identifier with suffix '%s' not found" new_name)

bguillaum's avatar
bguillaum committed
389

pj2m's avatar
pj2m committed
390 391

  let down_deco (matching,created_nodes) commands =
392 393 394 395 396 397 398 399 400 401
    let feat_to_highlight = List.fold_left
      (fun acc -> function
        | (Command.UPDATE_FEAT (tar_cn,feat_name,_),loc) ->
          (* | (Command.SHIFT_EDGE (_,tar_cn),loc) *)
          let gid = find tar_cn (matching, created_nodes) in
          let old_feat_list = try Gid_map.find gid acc with Not_found -> [] in
          Gid_map.add gid (feat_name :: old_feat_list) acc
        | _ -> acc
      ) Gid_map.empty commands in

pj2m's avatar
pj2m committed
402
    {
403
     G_deco.nodes = List.map (fun (gid,feat_list) -> (gid, ("",feat_list))) (Gid_map.bindings feat_to_highlight);
404
     G_deco.edges = List.fold_left
bguillaum's avatar
bguillaum committed
405 406
       (fun acc -> function
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->
407
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
408
         | _ -> acc
pj2m's avatar
pj2m committed
409 410 411 412 413
       ) [] commands
   }

  exception Fail
  type partial = {
bguillaum's avatar
bguillaum committed
414
      sub: matching;
415 416 417
      unmatched_nodes: Pid.t list;
      unmatched_edges: (Pid.t * P_edge.t * Pid.t) list;
      already_matched_gids: Gid.t list; (* to ensure injectivity *)
pj2m's avatar
pj2m committed
418
      check: const list (* constraints to verify at the end of the matching *)
bguillaum's avatar
bguillaum committed
419 420 421 422
    }

        (* PREREQUISITES:
           - all partial matching have the same domain
423 424
           - the domain of the pattern P is the disjoint union of domain([sub]) and [unmatched_nodes]
         *)
bguillaum's avatar
bguillaum committed
425
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
426 427
  let init param basic =
    let roots = P_graph.roots basic.graph in
pj2m's avatar
pj2m committed
428

bguillaum's avatar
bguillaum committed
429
    let node_list = Pid_map.fold (fun pid _ acc -> pid::acc) basic.graph [] in
pj2m's avatar
pj2m committed
430 431

    (* put all roots in the front of the list to speed up the algo *)
bguillaum's avatar
bguillaum committed
432
    let sorted_node_list =
pj2m's avatar
pj2m committed
433
      List.sort
434 435 436 437
        (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
438

bguillaum's avatar
bguillaum committed
439
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
440 441 442
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
bguillaum's avatar
bguillaum committed
443
      check = basic.constraints;
pj2m's avatar
pj2m committed
444 445
    }

bguillaum's avatar
bguillaum committed
446
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
447
  let apply_cst graph matching cst =
bguillaum's avatar
bguillaum committed
448
    let get_node pid = G_graph.find (Pid_map.find pid matching.n_match) graph in
449 450 451 452 453 454
    let get_string_feat pid = function
      | "position" -> Some (sprintf "%g" (G_node.get_position (get_node pid)))
      | feat_name -> G_fs.get_string_atom feat_name (G_node.get_fs (get_node pid)) in
    let get_float_feat pid = function
      | "position" -> Some (G_node.get_position (get_node pid))
      | feat_name -> G_fs.get_float_feat feat_name (G_node.get_fs (get_node pid)) in
bguillaum's avatar
bguillaum committed
455 456

    match cst with
bguillaum's avatar
bguillaum committed
457
      | Cst_out (pid,label_cst) ->
458
        let gid = Pid_map.find pid matching.n_match in
bguillaum's avatar
bguillaum committed
459
        if G_graph.edge_out graph gid label_cst
bguillaum's avatar
bguillaum committed
460 461
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
462
      | Cst_in (pid,label_cst) ->
463
        let gid = Pid_map.find pid matching.n_match in
bguillaum's avatar
bguillaum committed
464
        if G_graph.node_exists
465
          (fun node ->
bguillaum's avatar
bguillaum committed
466
            List.exists (fun e -> Label_cst.match_ e label_cst) (Massoc_gid.assoc gid (G_node.get_next node))
467
          ) graph
bguillaum's avatar
bguillaum committed
468 469
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
470
      | Filter (pid, fs) ->
bguillaum's avatar
bguillaum committed
471 472 473 474 475 476 477 478
        begin
          try
            let gid = Pid_map.find pid matching.n_match in
            let gnode = G_graph.find gid graph in
            let new_param = P_fs.match_ ?param:matching.m_param fs (G_node.get_fs gnode) in
            {matching with m_param = new_param }
          with P_fs.Fail -> raise Fail
        end
bguillaum's avatar
bguillaum committed
479 480 481
      | Feature_eq (pid1, feat_name1, pid2, feat_name2) ->
        begin
          match (get_string_feat pid1 feat_name1, get_string_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
482 483
            | Some fv1, Some fv2 when fv1 = fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
484 485 486 487
        end
      | Feature_diseq (pid1, feat_name1, pid2, feat_name2) ->
        begin
          match (get_string_feat pid1 feat_name1, get_string_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
488 489
            | Some fv1, Some fv2 when fv1 <> fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
490 491
        end
      | Feature_ineq (ineq, pid1, feat_name1, pid2, feat_name2) ->
492 493
        begin
          match (ineq, get_float_feat pid1 feat_name1, get_float_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
494 495 496 497 498
            | (Ast.Lt, Some fv1, Some fv2) when fv1 < fv2 -> matching
            | (Ast.Gt, Some fv1, Some fv2) when fv1 > fv2 -> matching
            | (Ast.Le, Some fv1, Some fv2) when fv1 <= fv2 -> matching
            | (Ast.Ge, Some fv1, Some fv2) when fv1 >= fv2 -> matching
            | _ -> raise Fail
499 500 501 502 503 504 505 506 507 508
          end
      | Feature_ineq_cst (ineq, pid1, feat_name1, constant) ->
        begin
          match (ineq, get_float_feat pid1 feat_name1) with
            | (Ast.Lt, Some fv1) when fv1 < constant -> matching
            | (Ast.Gt, Some fv1) when fv1 > constant -> matching
            | (Ast.Le, Some fv1) when fv1 <= constant -> matching
            | (Ast.Ge, Some fv1) when fv1 >= constant -> matching
            | _ -> raise Fail
          end
pj2m's avatar
pj2m committed
509

bguillaum's avatar
bguillaum committed
510
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
511
  (* returns all extension of the partial input matching *)
512
  let rec extend_matching (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
513
    match (partial.unmatched_edges, partial.unmatched_nodes) with
bguillaum's avatar
bguillaum committed
514
    | [], [] ->
bguillaum's avatar
bguillaum committed
515 516 517 518 519 520 521 522 523 524
      begin
        try
          let new_matching =
            List.fold_left
              (fun acc const ->
                apply_cst graph acc const
              ) partial.sub partial.check in
          [new_matching, partial.already_matched_gids]
        with Fail -> []
      end
pj2m's avatar
pj2m committed
525
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
526 527
        begin
          try (* is the tar already found in the matching ? *)
bguillaum's avatar
bguillaum committed
528
            let new_partials =
529 530 531
              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
532
              let g_edges = Massoc_gid.assoc tar_gid (G_node.get_next src_gnode) in
bguillaum's avatar
bguillaum committed
533

534 535
              match P_edge.match_list p_edge g_edges with
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
536
                  []
537
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
bguillaum's avatar
bguillaum committed
538
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ]
539
              | 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
540
                  List.map
541 542
                    (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
543
                    ) labels
544 545 546
            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
547
              let (src_gid : Gid.t) = Pid_map.find src_pid partial.sub.n_match in
548
              let src_gnode = G_graph.find src_gid graph in
549
              Massoc_gid.fold
550
                (fun acc gid_next g_edge ->
551 552
                  match P_edge.match_ p_edge g_edge with
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
553
                      acc
554
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
bguillaum's avatar
bguillaum committed
555
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc
556
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
557
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
558 559
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
560
            List_.flat_map
bguillaum's avatar
bguillaum committed
561
              (fun (gid_next, matching) ->
562 563 564 565
                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
566
    | [], pid :: _ ->
567 568
        G_graph.fold_gid
          (fun gid acc ->
569
            (extend_matching_from (positive,neg) graph pid gid partial) @ acc
570
          ) graph []
bguillaum's avatar
bguillaum committed
571

bguillaum's avatar
bguillaum committed
572
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
573
  and extend_matching_from (positive,neg) (graph:G_graph.t) pid (gid : Gid.t) partial =
pj2m's avatar
pj2m committed
574 575 576
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
bguillaum's avatar
bguillaum committed
577 578 579 580 581 582 583 584 585 586
      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 *)
587
      let g_node = try G_graph.find gid graph with Not_found -> failwith "INS" in
bguillaum's avatar
bguillaum committed
588

bguillaum's avatar
bguillaum committed
589
      try
590
        let new_param = P_node.match_ ?param: partial.sub.m_param p_node g_node in
591
        (* add all out-edges from pid in pattern *)
bguillaum's avatar
bguillaum committed
592 593
        let new_unmatched_edges =
          Massoc_pid.fold
594
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
595
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
596 597

        let new_partial =
bguillaum's avatar
bguillaum committed
598
          { partial with
bguillaum's avatar
bguillaum committed
599
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> failwith "List_.rm");
bguillaum's avatar
bguillaum committed
600 601 602 603
            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
604
        extend_matching (positive,neg) graph new_partial
605
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
606

bguillaum's avatar
bguillaum committed
607 608
  (*  ---------------------------------------------------------------------- *)
  (* the exception below is added to handle unification failure in merge!! *)
609
  exception Command_execution_fail
pj2m's avatar
pj2m committed
610

bguillaum's avatar
bguillaum committed
611 612
  (*  ---------------------------------------------------------------------- *)
  (** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
bguillaum's avatar
bguillaum committed
613 614
  let apply_command (command,loc) instance matching (created_nodes, (activated_nodes:((Pid.t * string) * Gid.t) list)) =
    let node_find cnode = find ~loc cnode (matching, (created_nodes, activated_nodes)) in
615 616

    match command with
bguillaum's avatar
bguillaum committed
617
    | Command.ADD_EDGE (src_cn,tar_cn,edge) ->
618 619 620
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
621
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
bguillaum's avatar
bguillaum committed
622
          | Some new_graph ->
623
              (
bguillaum's avatar
bguillaum committed
624 625
               {instance with
                Instance.graph = new_graph;
626
                history = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.history
627
              },
bguillaum's avatar
bguillaum committed
628
               (created_nodes, activated_nodes)
629
              )
bguillaum's avatar
bguillaum committed
630
          | None ->
631
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string edge) (Loc.to_string loc)
632 633
        end

bguillaum's avatar
bguillaum committed
634
    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) ->
635 636 637
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
638 639
         {instance with
          Instance.graph = G_graph.del_edge loc instance.Instance.graph src_gid edge tar_gid;
640
           history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
641
        },
bguillaum's avatar
bguillaum committed
642
         (created_nodes, activated_nodes)
643 644 645
        )

    | Command.DEL_EDGE_NAME edge_ident ->
bguillaum's avatar
bguillaum committed
646 647
        let (src_gid,edge,tar_gid) =
          try List.assoc edge_ident matching.e_match
648 649
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
bguillaum's avatar
bguillaum committed
650 651
         {instance with
          Instance.graph = G_graph.del_edge ~edge_ident loc instance.Instance.graph src_gid edge tar_gid;
652
          history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
653
        },
bguillaum's avatar
bguillaum committed
654
         (created_nodes, activated_nodes)
bguillaum's avatar
bguillaum committed
655
        )
656

bguillaum's avatar
bguillaum committed
657
    | Command.DEL_NODE node_cn ->
658 659
        let node_gid = node_find node_cn in
        (
bguillaum's avatar
bguillaum committed
660
         {instance with
661
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
662
          history = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.history
663
        },
bguillaum's avatar
bguillaum committed
664
         (created_nodes, activated_nodes)
665 666 667 668 669
        )

    | Command.MERGE_NODE (src_cn, tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
670
        (match G_graph.merge_node loc instance.Instance.graph src_gid tar_gid with
bguillaum's avatar
bguillaum committed
671
        | Some new_graph ->
672
            (
bguillaum's avatar
bguillaum committed
673
             {instance with
674
              Instance.graph = new_graph;
675
              history = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.history
676
            },
bguillaum's avatar
bguillaum committed
677
             (created_nodes, activated_nodes)
678 679 680
            )
        | None -> raise Command_execution_fail
        )
bguillaum's avatar
bguillaum committed
681

682
    | Command.UPDATE_FEAT (tar_cn,tar_feat_name, item_list) ->
bguillaum's avatar
bguillaum committed
683
        let tar_gid = node_find tar_cn in
684 685
        let rule_items = List.map
            (function
bguillaum's avatar
bguillaum committed
686 687
              | 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
688
              | Command.Param_out index ->
bguillaum's avatar
bguillaum committed
689 690
                  (match matching.m_param with
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
691
                  | Some param -> Concat_item.String (Lex_par.get_command_value index param))
bguillaum's avatar
bguillaum committed
692
              | Command.Param_in index ->
bguillaum's avatar
bguillaum committed
693
                  (match matching.m_param with
694
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
695
                  | Some param -> Concat_item.String (Lex_par.get_param_value index param))
696
            ) item_list in
697

bguillaum's avatar
bguillaum committed
698
        let (new_graph, new_feature_value) =
699
          G_graph.update_feat ~loc instance.Instance.graph tar_gid tar_feat_name rule_items in
bguillaum's avatar
bguillaum committed
700
        (
701 702
         {instance with
          Instance.graph = new_graph;
703
          history = List_.sort_insert (Command.H_UPDATE_FEAT (tar_gid,tar_feat_name,new_feature_value)) instance.Instance.history
bguillaum's avatar
bguillaum committed
704
        },
bguillaum's avatar
bguillaum committed
705
         (created_nodes, activated_nodes)
706
        )
707 708 709 710

    | Command.DEL_FEAT (tar_cn,feat_name) ->
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
711
         {instance with
712
          Instance.graph = G_graph.del_feat instance.Instance.graph tar_gid feat_name;
713
          history = List_.sort_insert (Command.H_DEL_FEAT (tar_gid,feat_name)) instance.Instance.history
714
        },
bguillaum's avatar
bguillaum committed
715
         (created_nodes, activated_nodes)
bguillaum's avatar
bguillaum committed
716
        )
717 718

    | Command.NEW_NEIGHBOUR (created_name,edge,base_pid) ->
719 720
        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
721
        (
bguillaum's avatar
bguillaum committed
722
         {instance with
723
          Instance.graph = new_graph;
724 725
          history = List_.sort_insert (Command.H_NEW_NEIGHBOUR (created_name,edge,new_gid)) instance.Instance.history;
          activated_node = new_gid :: instance.Instance.activated_node;
726
        },
bguillaum's avatar
bguillaum committed
727 728 729 730 731 732 733 734 735 736 737 738
         ((created_name,new_gid) :: created_nodes, activated_nodes)
        )

    | Command.ACT_NODE (Command.Act (pid, new_name)) ->
        let node_gid = node_find (Command.Pat(pid)) in
        let (new_gid, new_graph) = G_graph.activate loc node_gid new_name instance.Instance.graph in
        (
         {instance with
          Instance.graph = new_graph;
          history = List_.sort_insert (Command.H_ACT_NODE (node_gid,new_name)) instance.Instance.history
        },
         (created_nodes, ((pid, new_name), new_gid) :: activated_nodes)
739
        )
740
    | Command.ACT_NODE _ -> Error.bug "Try to activate a node without suffix" (Loc.to_string loc)
741

bguillaum's avatar
bguillaum committed
742
    | Command.SHIFT_IN (src_cn,tar_cn,label_cst) ->
743 744 745
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
746
         {instance with
bguillaum's avatar
bguillaum committed
747
          Instance.graph = G_graph.shift_in loc src_gid tar_gid label_cst instance.Instance.graph;
748
          history = List_.sort_insert (Command.H_SHIFT_IN (src_gid,tar_gid)) instance.Instance.history
749
        },
bguillaum's avatar
bguillaum committed
750
         (created_nodes, activated_nodes)
751 752
        )

bguillaum's avatar
bguillaum committed
753
    | Command.SHIFT_OUT (src_cn,tar_cn,label_cst) ->
754 755 756
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
757
         {instance with
bguillaum's avatar
bguillaum committed
758
          Instance.graph = G_graph.shift_out loc src_gid tar_gid label_cst instance.Instance.graph;
759
          history = List_.sort_insert (Command.H_SHIFT_OUT (src_gid,tar_gid)) instance.Instance.history
760
        },
bguillaum's avatar
bguillaum committed
761
         (created_nodes, activated_nodes)
762 763
        )

bguillaum's avatar
bguillaum committed
764
    | Command.SHIFT_EDGE (src_cn,tar_cn,label_cst) ->
765 766 767
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
768
          {instance with
bguillaum's avatar
bguillaum committed
769
            Instance.graph = G_graph.shift_edges loc src_gid tar_gid label_cst instance.Instance.graph;
770 771
            history = List_.sort_insert (Command.H_SHIFT_EDGE (src_gid,tar_gid)) instance.Instance.history
          },
bguillaum's avatar
bguillaum committed
772
          (created_nodes, activated_nodes)
773
        )
pj2m's avatar
pj2m committed
774

bguillaum's avatar
bguillaum committed
775 776 777
  (*  ---------------------------------------------------------------------- *)
  (** [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 *)
bguillaum's avatar
bguillaum committed
778
  let apply_rule instance matching rule =
pj2m's avatar
pj2m committed
779

bguillaum's avatar
bguillaum committed
780 781 782
    (* Timeout check *)
    (try Timeout.check () with Timeout.Stop -> Error.run "Time out");

783 784
    (* limit the rewriting depth to avoid looping rewriting *)
    begin
bguillaum's avatar
bguillaum committed
785
      if List.length instance.Instance.rules >= !max_depth
786 787
      then Error.run "Bound reached (when applying rule %s)" rule.name
    end;
bguillaum's avatar
bguillaum committed
788

789
    let (new_instance, created_nodes) =
bguillaum's avatar
bguillaum committed
790
      List.fold_left
791 792
        (fun (instance, created_nodes) command ->
          apply_command command instance matching created_nodes
bguillaum's avatar
bguillaum committed
793
        )
bguillaum's avatar
bguillaum committed
794
        (instance, ([],[]))
795 796
        rule.commands in

797
    let rule_app = {
798
      Libgrew_types.rule_name = rule.name;
799
      up = match_deco rule.pattern matching;
800 801
      down = down_deco (matching,created_nodes) rule.commands
    } in
pj2m's avatar
pj2m committed
802

bguillaum's avatar
bguillaum committed
803
    {new_instance with
804 805
      Instance.rules = rule.name :: new_instance.Instance.rules;
      big_step = match new_instance.Instance.big_step with
806 807
        | None -> Some { Libgrew_types.first = rule_app; small_step = [] }
        | Some bs -> Some { bs with Libgrew_types.small_step = (instance.Instance.graph, rule_app) :: bs.Libgrew_types.small_step }
808
    }
pj2m's avatar
pj2m committed
809

bguillaum's avatar
bguillaum committed
810
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
811
  let update_partial pos_graph without (sub, already_matched_gids) =
812
    let neg_graph = without.graph in