grew_rule.ml 49.1 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 15
open Dep2pict

16
open Grew_base
17 18
open Grew_types

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

26
(* ================================================================================ *)
pj2m's avatar
pj2m committed
27 28
module Instance = struct
  type t = {
29 30 31
    graph: G_graph.t;
    history: Command.h list;
    rules: string list;
32
    big_step: Libgrew_types.big_step option;
33 34
  }

35
  let empty = {graph = G_graph.empty; rules=[]; history=[]; big_step=None; }
36

37
  let from_graph graph = {empty with graph }
pj2m's avatar
pj2m committed
38

bguillaum's avatar
bguillaum committed
39
  let rev_steps t =
pj2m's avatar
pj2m committed
40
    { t with big_step = match t.big_step with
41
      | None -> None
42
      | Some bs -> Some {bs with Libgrew_types.small_step = List.rev bs.Libgrew_types.small_step }
pj2m's avatar
pj2m committed
43 44
    }

45 46
  let refresh t = { empty with graph=t.graph }

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

bguillaum's avatar
bguillaum committed
51
  let to_gr ?domain t = G_graph.to_gr ?domain t.graph
52

bguillaum's avatar
bguillaum committed
53
  let to_conll_string ?domain t = G_graph.to_conll_string ?domain t.graph
bguillaum's avatar
bguillaum committed
54

bguillaum's avatar
bguillaum committed
55 56
  let save_dot_png ?domain ?filter ?main_feat base t =
    ignore (Dot.to_png_file (G_graph.to_dot ?domain ?main_feat t.graph) (base^".png"))
57

bguillaum's avatar
bguillaum committed
58 59
  let save_dep_png ?domain ?filter ?main_feat base t =
    let dep = G_graph.to_dep ?domain ?filter ?main_feat t.graph in
60 61 62
    let d2p = Dep2pict.from_dep ~dep in
    let _ = Dep2pict.save_png ~filename: (base^".png") d2p in
    Dep2pict.highlight_shift ()
63

bguillaum's avatar
bguillaum committed
64 65
  let save_dep_svg ?domain ?filter ?main_feat base t =
    let dep = G_graph.to_dep ?domain ?filter ?main_feat t.graph in
66 67 68
    let d2p = Dep2pict.from_dep ~dep in
    let _ = Dep2pict.save_svg ~filename: (base^".png") d2p in
    Dep2pict.highlight_shift ()
69
end (* module Instance *)
pj2m's avatar
pj2m committed
70

71
(* ================================================================================ *)
72
module Instance_set = Set.Make (Instance)
pj2m's avatar
pj2m committed
73

74
(* ================================================================================ *)
bguillaum's avatar
bguillaum committed
75
module Rule = struct
76

bguillaum's avatar
bguillaum committed
77
  (* the rewriting depth is bounded to stop rewriting when the system is not terminating *)
bguillaum's avatar
bguillaum committed
78 79
  let max_depth_det = ref 2000
  let max_depth_non_det = ref 100
bguillaum's avatar
bguillaum committed
80
  let debug_loop = ref false
81 82 83

  let set_max_depth_det value = max_depth_det := value
  let set_max_depth_non_det value = max_depth_non_det := value
bguillaum's avatar
bguillaum committed
84
  let set_debug_loop () = debug_loop := true
pj2m's avatar
pj2m committed
85

86
  type const =
bguillaum's avatar
bguillaum committed
87 88
    | Cst_out of Pid.t * Label_cst.t
    | Cst_in of Pid.t * Label_cst.t
89
    | Feature_eq of Pid.t * string * Pid.t * string
90
    | Feature_diseq of Pid.t * string * Pid.t * string
bguillaum's avatar
bguillaum committed
91

92 93 94 95 96 97
    | Feature_cst of Pid.t * string * string
    | Feature_diff_cst of Pid.t * string * string

    | Feature_float of Pid.t * string * float
    | Feature_diff_float of Pid.t * string * float

bguillaum's avatar
bguillaum committed
98 99
    | Feature_re of Pid.t * string * string

100
    | Feature_ineq of Ast.ineq * Pid.t * string * Pid.t * string
101 102
    | Feature_ineq_cst of Ast.ineq * Pid.t * string * float

bguillaum's avatar
bguillaum committed
103
    | 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
104

bguillaum's avatar
bguillaum committed
105 106 107
    | Prec of Pid.t * Pid.t
    | Lprec of Pid.t * Pid.t

bguillaum's avatar
bguillaum committed
108
  let build_pos_constraint ?domain pos_table const =
bguillaum's avatar
bguillaum committed
109 110
    let pid_of_name loc node_name = Pid.Pos (Id.build ~loc node_name pos_table) in
    match const with
111
      | (Ast.Cst_out (id,label_cst), loc) ->
bguillaum's avatar
bguillaum committed
112
        Cst_out (pid_of_name loc id, Label_cst.build ~loc ?domain label_cst)
113
      | (Ast.Cst_in (id,label_cst), loc) ->
bguillaum's avatar
bguillaum committed
114
        Cst_in (pid_of_name loc id, Label_cst.build ~loc ?domain label_cst)
115 116

      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
117 118
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
119
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
120

121
      | (Ast.Feature_diseq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
122 123
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
124
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
125

126
      | (Ast.Feature_ineq (ineq, (node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
127 128
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
129
        Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
130

131
      | (Ast.Feature_ineq_cst (ineq, (node_name1, feat_name1), constant), loc) ->
bguillaum's avatar
bguillaum committed
132
        Domain.check_feature_name ?domain ~loc feat_name1;
133 134
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)

bguillaum's avatar
bguillaum committed
135
      | (Ast.Feature_re ((node_name, feat_name), regexp), loc) ->
bguillaum's avatar
bguillaum committed
136
        Domain.check_feature_name ?domain ~loc feat_name;
bguillaum's avatar
bguillaum committed
137
        Feature_re (pid_of_name loc node_name, feat_name, regexp)
bguillaum's avatar
bguillaum committed
138

139 140 141 142 143 144 145 146 147 148 149 150 151 152
      | (Ast.Feature_cst ((node_name, feat_name), string), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_cst (pid_of_name loc node_name, feat_name, string)
      | (Ast.Feature_diff_cst ((node_name, feat_name), string), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_diff_cst (pid_of_name loc node_name, feat_name, string)

      | (Ast.Feature_float ((node_name, feat_name), float), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_float (pid_of_name loc node_name, feat_name, float)
      | (Ast.Feature_diff_float ((node_name, feat_name), float), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_diff_float (pid_of_name loc node_name, feat_name, float)

bguillaum's avatar
bguillaum committed
153 154 155 156 157 158
      | (Ast.Prec (id1, id2), loc) ->
        Prec (pid_of_name loc id1, pid_of_name loc id2)

      | (Ast.Lprec (id1, id2), loc) ->
        Lprec (pid_of_name loc id1, pid_of_name loc id2)

bguillaum's avatar
bguillaum committed
159
  type basic = {
160 161 162
    graph: P_graph.t;
    constraints: const list;
  }
pj2m's avatar
pj2m committed
163

bguillaum's avatar
bguillaum committed
164
  let build_pos_basic ?domain ?pat_vars ?(locals=[||]) basic_ast =
165
    let (graph, pos_table) =
bguillaum's avatar
bguillaum committed
166
      P_graph.build ?domain ?pat_vars basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
167
    (
bguillaum's avatar
bguillaum committed
168 169
      {
        graph = graph;
bguillaum's avatar
bguillaum committed
170
        constraints = List.map (build_pos_constraint ?domain pos_table) basic_ast.Ast.pat_const
bguillaum's avatar
bguillaum committed
171 172
      },
      pos_table
pj2m's avatar
pj2m committed
173 174
    )

bguillaum's avatar
bguillaum committed
175
  (* the neg part *)
bguillaum's avatar
bguillaum committed
176
  let build_neg_constraint ?domain pos_table neg_table const =
bguillaum's avatar
bguillaum committed
177 178 179 180
    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
181
    match const with
182
      | (Ast.Cst_out (id,label_cst), loc) ->
bguillaum's avatar
bguillaum committed
183
        Cst_out (pid_of_name loc id, Label_cst.build ~loc ?domain label_cst)
184
      | (Ast.Cst_in (id,label_cst), loc) ->
bguillaum's avatar
bguillaum committed
185
        Cst_in (pid_of_name loc id, Label_cst.build ~loc ?domain label_cst)
186

187 188 189
      | (Ast.Feature_eq (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
190 191
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
192
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
193

194 195 196
      | (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
197 198
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
199
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
200

201 202 203
      | (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
204 205
        Domain.check_feature_name ?domain ~loc feat_name1;
        Domain.check_feature_name ?domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
206
        Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
207

208 209
      | (Ast.Feature_ineq_cst (ineq, feat_id1, constant), loc) ->
        let (node_name1, feat_name1) = feat_id1 in
bguillaum's avatar
bguillaum committed
210
        Domain.check_feature_name ?domain ~loc feat_name1;
211
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)
pj2m's avatar
pj2m committed
212

bguillaum's avatar
bguillaum committed
213 214
      | (Ast.Feature_re (feat_id, regexp), loc) ->
        let (node_name, feat_name) = feat_id in
bguillaum's avatar
bguillaum committed
215
        Domain.check_feature_name ?domain ~loc feat_name;
bguillaum's avatar
bguillaum committed
216 217
        Feature_re (pid_of_name loc node_name, feat_name, regexp)

218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
      | (Ast.Feature_cst ((node_name, feat_name), string), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_cst (pid_of_name loc node_name, feat_name, string)
      | (Ast.Feature_diff_cst ((node_name, feat_name), string), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_diff_cst (pid_of_name loc node_name, feat_name, string)

      | (Ast.Feature_float ((node_name, feat_name), float), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_float (pid_of_name loc node_name, feat_name, float)
      | (Ast.Feature_diff_float ((node_name, feat_name), float), loc) ->
        Domain.check_feature_name ?domain ~loc feat_name;
        Feature_diff_float (pid_of_name loc node_name, feat_name, float)


bguillaum's avatar
bguillaum committed
233 234 235 236 237 238
      | (Ast.Prec (id1, id2), loc) ->
        Prec (pid_of_name loc id1, pid_of_name loc id2)

      | (Ast.Lprec (id1, id2), loc) ->
        Lprec (pid_of_name loc id1, pid_of_name loc id2)

bguillaum's avatar
bguillaum committed
239
  (* It may raise [P_fs.Fail_unif] in case of contradiction on constraints *)
bguillaum's avatar
bguillaum committed
240
  let build_neg_basic ?domain ?pat_vars ?(locals=[||]) pos_table basic_ast =
pj2m's avatar
pj2m committed
241
    let (extension, neg_table) =
bguillaum's avatar
bguillaum committed
242
      P_graph.build_extension ?domain ?pat_vars pos_table basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
bguillaum's avatar
bguillaum committed
243

244
    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
245
    {
bguillaum's avatar
bguillaum committed
246
      graph = extension.P_graph.ext_map;
bguillaum's avatar
bguillaum committed
247
      constraints = filters @ List.map (build_neg_constraint ?domain pos_table neg_table) basic_ast.Ast.pat_const ;
bguillaum's avatar
bguillaum committed
248
    }
pj2m's avatar
pj2m committed
249

bguillaum's avatar
bguillaum committed
250
  let get_edge_ids basic =
251
    Pid_map.fold
bguillaum's avatar
bguillaum committed
252 253
      (fun _ node acc ->
        Massoc_pid.fold
254 255
          (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
256
      ) basic.graph []
bguillaum's avatar
bguillaum committed
257

258 259 260
  (* a [pattern] is described by the positive basic and a list of negative basics. *)
  type pattern = basic * basic list

pj2m's avatar
pj2m committed
261 262
  type t = {
      name: string;
263
      pattern: pattern;
pj2m's avatar
pj2m committed
264
      commands: Command.t list;
265
      param: Lex_par.t option;
266
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
267
      loc: Loc.t;
pj2m's avatar
pj2m committed
268 269
    }

bguillaum's avatar
bguillaum committed
270 271
  let get_name t = t.name

272
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
273

274 275 276
  let is_filter t = t.commands = []

  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
277
  let to_dep ?domain t =
278
    let pos_basic = fst t.pattern in
279 280 281
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

bguillaum's avatar
bguillaum committed
282 283
    let nodes =
      Pid_map.fold
284
        (fun id node acc ->
bguillaum's avatar
bguillaum committed
285 286
          (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))
287
          )
288
          :: acc
289
        ) pos_basic.graph [] in
290

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

294 295 296 297 298
    bprintf buff "[WORDS] {\n";
    List.iter
      (fun (_, dep_line) -> bprintf buff "%s\n" dep_line
      ) sorted_nodes;

299
    List.iteri
300 301
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
302
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i
303
          | _ -> ()
304
      ) pos_basic.constraints;
305
    bprintf buff "}\n";
bguillaum's avatar
bguillaum committed
306

307
    bprintf buff "[EDGES] {\n";
bguillaum's avatar
bguillaum committed
308

309 310
    Pid_map.iter
      (fun id_src node ->
bguillaum's avatar
bguillaum committed
311
        Massoc_pid.iter
312
          (fun id_tar edge ->
bguillaum's avatar
bguillaum committed
313 314 315
            bprintf buff "  N_%s -> N_%s { label=\"%s\"}\n"
              (Pid.to_id id_src)
              (Pid.to_id id_tar)
bguillaum's avatar
bguillaum committed
316
              (P_edge.to_string ?domain edge)
317 318
          )
          (P_node.get_next node)
319
      ) pos_basic.graph;
320

321
    List.iteri
322 323
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
324
          | Cst_out (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
325
            bprintf buff "  N_%s -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n"
bguillaum's avatar
bguillaum committed
326
              (Pid.to_id pid) i (Label_cst.to_string ?domain label_cst)
bguillaum's avatar
bguillaum committed
327
          | Cst_in (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
328
            bprintf buff "  C_%d -> N_%s {label = \"%s\"; style=dot; bottom; color=green;}\n"
bguillaum's avatar
bguillaum committed
329
              i (Pid.to_id pid) (Label_cst.to_string ?domain label_cst)
330
          | _ -> ()
331
      ) pos_basic.constraints;
332 333
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
334

335
  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
336
  let build_commands ?domain ?param ?(locals=[||]) pos pos_table ast_commands =
bguillaum's avatar
bguillaum committed
337
    let known_act_ids = Array.to_list pos_table in
338
    let known_edge_ids = get_edge_ids pos in
339

340
    let rec loop (kai,kei) = function
341 342
      | [] -> []
      | ast_command :: tail ->
343
          let (command, (new_kai, new_kei)) =
344
            Command.build
bguillaum's avatar
bguillaum committed
345
              ?domain
346
              ?param
347
              (kai,kei)
348 349 350
              pos_table
              locals
              ast_command in
351 352
          command :: (loop (new_kai,new_kei) tail) in
    loop (known_act_ids, known_edge_ids) ast_commands
353 354

  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
355 356 357 358 359 360 361 362 363 364 365 366
  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

367
  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
368
  let build ?domain ?(locals=[||]) dir rule_ast =
bguillaum's avatar
bguillaum committed
369 370

    let (param, pat_vars, cmd_vars) =
bguillaum's avatar
bguillaum committed
371 372
      match rule_ast.Ast.param with
      | None -> (None,[],[])
373
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
374 375 376
          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
377

378
          (* first: load lexical parameters given in the same file at the end of the rule definition *)
bguillaum's avatar
bguillaum committed
379 380 381 382
          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

383
          (* second: load lexical parameters given in external files *)
bguillaum's avatar
bguillaum committed
384
          let full_param = List.fold_left
385
            (fun acc file ->
bguillaum's avatar
bguillaum committed
386 387 388 389 390 391
              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
392

393
    (match (param, pat_vars) with
394
      | (None, _::_) -> Error.build ~loc:rule_ast.Ast.rule_loc "[Rule.build] Missing lexical parameters in rule \"%s\"" rule_ast.Ast.rule_id
395 396 397
      | _ -> ()
    );

398
    let (pos, pos_table) =
bguillaum's avatar
bguillaum committed
399
      try build_pos_basic ?domain ~pat_vars rule_ast.Ast.pattern.Ast.pat_pos
400 401 402 403
      with P_fs.Fail_unif ->
        Error.build ~loc:rule_ast.Ast.rule_loc
          "[Rule.build] in rule \"%s\": feature structures declared in the \"match\" clause are inconsistent"
          rule_ast.Ast.rule_id in
bguillaum's avatar
bguillaum committed
404 405 406
    let (negs,_) =
      List.fold_left
      (fun (acc,pos) basic_ast ->
bguillaum's avatar
bguillaum committed
407
        try ((build_neg_basic ?domain ~pat_vars pos_table basic_ast) :: acc, pos+1)
bguillaum's avatar
bguillaum committed
408 409 410 411
        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)
412
      ) ([],1) rule_ast.Ast.pattern.Ast.pat_negs in
pj2m's avatar
pj2m committed
413
    {
bguillaum's avatar
bguillaum committed
414
      name = rule_ast.Ast.rule_id;
415
      pattern = (pos, negs);
bguillaum's avatar
bguillaum committed
416
      commands = build_commands ?domain ~param:(pat_vars,cmd_vars) pos pos_table rule_ast.Ast.commands;
bguillaum's avatar
bguillaum committed
417 418 419 420 421
      loc = rule_ast.Ast.rule_loc;
      param = param;
      param_names = (pat_vars,cmd_vars)
    }

bguillaum's avatar
bguillaum committed
422
  let build_pattern ?domain pattern_ast =
423
    let (pos, pos_table) =
bguillaum's avatar
bguillaum committed
424
      try build_pos_basic ?domain pattern_ast.Ast.pat_pos
425 426 427 428
      with P_fs.Fail_unif -> Error.build "feature structures declared in the \"match\" clause are inconsistent " in
    let negs =
      List_.try_map
        P_fs.Fail_unif (* Skip the without parts that are incompatible with the match part *)
bguillaum's avatar
bguillaum committed
429
        (fun basic_ast -> build_neg_basic ?domain pos_table basic_ast)
430
        pattern_ast.Ast.pat_negs in
bguillaum's avatar
bguillaum committed
431 432
    (pos, negs)

433
  (* ====================================================================== *)
pj2m's avatar
pj2m committed
434
  type matching = {
435
      n_match: Gid.t Pid_map.t;                     (* partial fct: pattern nodes |--> graph nodes *)
436
      e_match: (string*(Gid.t*Label.t*Gid.t)) list; (* edge matching: edge ident  |--> (src,label,tar) *)
bguillaum's avatar
bguillaum committed
437
      a_match: (Gid.t*Label.t*Gid.t) list;          (* anonymous edge matched *)
438
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
439
    }
440

441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
  let to_python pattern graph m =

    let node_name gid =
      let gnode = G_graph.find gid graph in
      G_node.get_name gid gnode in
    let buff = Buffer.create 32 in
    bprintf buff "%s" "{ ";

    Pid_map.iter
      (fun pid gid ->
        let pnode = P_graph.find pid (fst pattern).graph in
        bprintf buff "\"%s\":\"%s\", " (P_node.get_name pnode) (node_name gid)
      ) m.n_match;

    List.iter
      (fun (id, (src,lab,tar)) ->
        bprintf buff "\"%s\":\"%s/%s:%s/%s\", " id (node_name src) id (Label.to_string lab) (node_name tar)
      ) m.e_match;

    bprintf buff "%s" "}";
    Buffer.contents buff

463 464 465 466 467 468 469 470
  let node_matching pattern graph { n_match } =
    Pid_map.fold
      (fun pid gid acc ->
        let pnode = P_graph.find pid (fst pattern).graph in
        let gnode = G_graph.find gid graph in
        (P_node.get_name pnode, int_of_float (G_node.get_position gnode)) :: acc
      ) n_match []

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

pj2m's avatar
pj2m committed
473 474
  let e_comp (e1,_) (e2,_) = compare e1 e2

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

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

482
  let match_deco pattern matching =
483 484 485
    { G_deco.nodes =
        Pid_map.fold
          (fun pid gid acc ->
486
            let pnode = P_graph.find pid (fst pattern).graph in
487 488
            (gid, (P_node.get_name pnode, P_fs.feat_list (P_node.get_fs pnode))) ::acc
          ) matching.n_match [];
489
      G_deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
pj2m's avatar
pj2m committed
490 491
    }

bguillaum's avatar
bguillaum committed
492
  let find cnode ?loc (matching, created_nodes) =
pj2m's avatar
pj2m committed
493
    match cnode with
494
    | Command.Pat pid ->
495
        (try Pid_map.find pid matching.n_match
bguillaum's avatar
bguillaum committed
496 497
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%s' not found" (Pid.to_string pid))
    | Command.New name ->
bguillaum's avatar
bguillaum committed
498 499
        (try List.assoc name created_nodes
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name)
pj2m's avatar
pj2m committed
500 501

  let down_deco (matching,created_nodes) commands =
502 503 504 505 506 507 508 509 510 511
    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
512
    {
513
     G_deco.nodes = List.map (fun (gid,feat_list) -> (gid, ("",feat_list))) (Gid_map.bindings feat_to_highlight);
514
     G_deco.edges = List.fold_left
bguillaum's avatar
bguillaum committed
515 516
       (fun acc -> function
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->
517
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
518
         | _ -> acc
pj2m's avatar
pj2m committed
519 520 521 522 523
       ) [] commands
   }

  exception Fail
  type partial = {
bguillaum's avatar
bguillaum committed
524
      sub: matching;
525 526 527
      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
528
      check: const list (* constraints to verify at the end of the matching *)
bguillaum's avatar
bguillaum committed
529 530 531
    }

        (* PREREQUISITES:
bguillaum's avatar
bguillaum committed
532 533
           - all partial matching have the same ?domain
           - the ?domain of the pattern P is the disjoint union of ?domain([sub]) and [unmatched_nodes]
534
         *)
bguillaum's avatar
bguillaum committed
535
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
536 537
  let init param basic =
    let roots = P_graph.roots basic.graph in
pj2m's avatar
pj2m committed
538

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

    (* put all roots in the front of the list to speed up the algo *)
bguillaum's avatar
bguillaum committed
542
    let sorted_node_list =
pj2m's avatar
pj2m committed
543
      List.sort
544 545 546 547
        (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
548

bguillaum's avatar
bguillaum committed
549
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
550 551 552
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
bguillaum's avatar
bguillaum committed
553
      check = basic.constraints;
pj2m's avatar
pj2m committed
554 555
    }

bguillaum's avatar
bguillaum committed
556
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
557
  let apply_cst ?domain graph matching cst =
bguillaum's avatar
bguillaum committed
558
    let get_node pid = G_graph.find (Pid_map.find pid matching.n_match) graph in
559 560 561 562 563 564
    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
565 566

    match cst with
bguillaum's avatar
bguillaum committed
567
      | Cst_out (pid,label_cst) ->
568
        let gid = Pid_map.find pid matching.n_match in
bguillaum's avatar
bguillaum committed
569
        if G_graph.edge_out ?domain graph gid label_cst
bguillaum's avatar
bguillaum committed
570 571
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
572
      | Cst_in (pid,label_cst) ->
573
        let gid = Pid_map.find pid matching.n_match in
bguillaum's avatar
bguillaum committed
574
        if G_graph.node_exists
575
          (fun node ->
bguillaum's avatar
bguillaum committed
576
            List.exists (fun e -> Label_cst.match_ ?domain label_cst e) (Massoc_gid.assoc gid (G_node.get_next node))
577
          ) graph
bguillaum's avatar
bguillaum committed
578 579
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
580
      | Filter (pid, fs) ->
bguillaum's avatar
bguillaum committed
581 582 583 584 585 586 587 588
        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
589 590 591
      | 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
592 593
            | Some fv1, Some fv2 when fv1 = fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
594
        end
595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
      | Feature_cst (pid1, feat_name1, value) ->
        begin
          match get_string_feat pid1 feat_name1 with
            | Some fv1 when fv1 = value -> matching
            | _ -> raise Fail
        end
      | Feature_diff_cst (pid1, feat_name1, value) ->
        begin
          match get_string_feat pid1 feat_name1 with
            | Some fv1 when fv1 <> value -> matching
            | _ -> raise Fail
        end
      | Feature_float (pid1, feat_name1, float) ->
        begin
          match get_float_feat pid1 feat_name1 with
            | Some fv1 when fv1 = float -> matching
            | _ -> raise Fail
        end
      | Feature_diff_float (pid1, feat_name1, float) ->
        begin
          match get_float_feat pid1 feat_name1 with
            | Some fv1 when fv1 <> float -> matching
            | _ -> raise Fail
        end
bguillaum's avatar
bguillaum committed
619 620 621
      | 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
622 623
            | Some fv1, Some fv2 when fv1 <> fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
624 625
        end
      | Feature_ineq (ineq, pid1, feat_name1, pid2, feat_name2) ->
626 627
        begin
          match (ineq, get_float_feat pid1 feat_name1, get_float_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
628 629 630 631 632
            | (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
633 634 635 636 637 638 639 640 641 642
          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
bguillaum's avatar
bguillaum committed
643 644 645 646 647 648
      | Feature_re (pid, feat_name, regexp) ->
        begin
          match get_string_feat pid feat_name with
          | None -> raise Fail
          | Some string_feat ->
            let re = Str.regexp regexp in
649
            if String_.re_match re string_feat then matching else raise Fail
bguillaum's avatar
bguillaum committed
650
        end
bguillaum's avatar
bguillaum committed
651 652 653
      | Prec (pid1, pid2) ->
          let gid1 = Pid_map.find pid1 matching.n_match in
          let gid2 = Pid_map.find pid2 matching.n_match in
654
          let gnode1 = G_graph.find gid1 graph in
655
          if G_node.get_succ gnode1 = Some gid2
656 657
          then matching
          else  raise Fail
bguillaum's avatar
bguillaum committed
658
      | Lprec (pid1, pid2) ->
659 660 661 662 663
          let gnode1 = G_graph.find (Pid_map.find pid1 matching.n_match) graph in
          let gnode2 = G_graph.find (Pid_map.find pid2 matching.n_match) graph in
          if G_node.get_position gnode1 < G_node.get_position gnode2
          then matching
          else raise Fail
pj2m's avatar
pj2m committed
664

bguillaum's avatar
bguillaum committed
665
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
666
  (* returns all extension of the partial input matching *)
bguillaum's avatar
bguillaum committed
667
  let rec extend_matching ?domain (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
668
    match (partial.unmatched_edges, partial.unmatched_nodes) with
bguillaum's avatar
bguillaum committed
669
    | [], [] ->
bguillaum's avatar
bguillaum committed
670 671 672 673 674
      begin
        try
          let new_matching =
            List.fold_left
              (fun acc const ->
bguillaum's avatar
bguillaum committed
675
                apply_cst ?domain graph acc const
bguillaum's avatar
bguillaum committed
676 677 678 679
              ) partial.sub partial.check in
          [new_matching, partial.already_matched_gids]
        with Fail -> []
      end
pj2m's avatar
pj2m committed
680
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
681 682
        begin
          try (* is the tar already found in the matching ? *)
bguillaum's avatar
bguillaum committed
683
            let new_partials =
684 685 686
              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
687
              let g_edges = Massoc_gid.assoc tar_gid (G_node.get_next src_gnode) in
bguillaum's avatar
bguillaum committed
688

bguillaum's avatar
bguillaum committed
689
              match P_edge.match_list ?domain p_edge g_edges with
690
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
691
                  []
692
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
bguillaum's avatar
bguillaum committed
693
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ]
694
              | 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
695
                  List.map
696 697
                    (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
698
                    ) labels
bguillaum's avatar
bguillaum committed
699
            in List_.flat_map (extend_matching ?domain (positive,neg) graph) new_partials
700 701
          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
702
              let (src_gid : Gid.t) = Pid_map.find src_pid partial.sub.n_match in
703
              let src_gnode = G_graph.find src_gid graph in
704
              Massoc_gid.fold
705
                (fun acc gid_next g_edge ->
bguillaum's avatar
bguillaum committed
706
                  match P_edge.match_ ?domain p_edge g_edge with
707
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
708
                      acc
709
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
bguillaum's avatar
bguillaum committed
710
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc
711
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
712
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
713 714
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
715
            List_.flat_map
bguillaum's avatar
bguillaum committed
716
              (fun (gid_next, matching) ->
bguillaum's avatar
bguillaum committed
717
                extend_matching_from ?domain (positive,neg) graph tar_pid gid_next
718 719 720
                  {partial with sub=matching; unmatched_edges = tail_ue}
              ) candidates
        end
bguillaum's avatar
bguillaum committed
721
    | [], pid :: _ ->
722 723
        G_graph.fold_gid
          (fun gid acc ->
bguillaum's avatar
bguillaum committed
724
            (extend_matching_from ?domain (positive,neg) graph pid gid partial) @ acc
725
          ) graph []
bguillaum's avatar
bguillaum committed
726

bguillaum's avatar
bguillaum committed
727
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
728
  and extend_matching_from ?domain (positive,neg) (graph:G_graph.t) pid (gid : Gid.t) partial =
pj2m's avatar
pj2m committed
729 730 731
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
bguillaum's avatar
bguillaum committed
732 733 734 735 736 737 738 739 740 741
      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 *)
742
      let g_node = try G_graph.find gid graph with Not_found -> Error.bug "[extend_matching_from] cannot find gid in graph" in
bguillaum's avatar
bguillaum committed
743

bguillaum's avatar
bguillaum committed
744
      try
745
        let new_param = P_node.match_ ?param: partial.sub.m_param p_node g_node in
746
        (* add all out-edges from pid in pattern *)
bguillaum's avatar
bguillaum committed
747 748
        let new_unmatched_edges =
          Massoc_pid.fold
749
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
750
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
751 752

        let new_partial =
bguillaum's avatar
bguillaum committed
753
          { partial with
754
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> Error.bug "[extend_matching_from] cannot find pid in unmatched_nodes");
bguillaum's avatar
bguillaum committed
755 756 757 758
            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
bguillaum's avatar
bguillaum committed
759
        extend_matching ?domain (positive,neg) graph new_partial
760
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
761

bguillaum's avatar
bguillaum committed
762 763
  (*  ---------------------------------------------------------------------- *)
  (* the exception below is added to handle unification failure in merge!! *)
764
  exception Command_execution_fail
pj2m's avatar
pj2m committed
765

bguillaum's avatar
bguillaum committed
766 767
  (*  ---------------------------------------------------------------------- *)
  (** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
bguillaum's avatar
bguillaum committed
768
  let apply_command ?domain (command,loc) instance matching created_nodes =
bguillaum's avatar
bguillaum committed
769
    let node_find cnode = find ~loc cnode (matching, created_nodes) in
770 771

    match command with
bguillaum's avatar
bguillaum committed
772
    | Command.ADD_EDGE (src_cn,tar_cn,edge) ->
773 774 775
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
776
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
bguillaum's avatar
bguillaum committed
777
          | Some new_graph ->
778
              (
bguillaum's avatar
bguillaum committed
779 780
               {instance with
                Instance.graph = new_graph;
781
                history = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.history
782
              },
bguillaum's avatar
bguillaum committed
783
               created_nodes
784
              )
bguillaum's avatar
bguillaum committed
785
          | None ->
bguillaum's avatar
bguillaum committed
786
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string ?domain edge) (Loc.to_string loc)
787 788
        end

bguillaum's avatar
bguillaum committed
789
    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) ->
790 791 792
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
793
         {instance with
bguillaum's avatar
bguillaum committed
794
          Instance.graph = G_graph.del_edge ?domain loc instance.Instance.graph src_gid edge tar_gid;
795
           history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
796
        },
bguillaum's avatar
bguillaum committed
797
         created_nodes
798 799 800
        )

    | Command.DEL_EDGE_NAME edge_ident ->
bguillaum's avatar
bguillaum committed
801 802
        let (src_gid,edge,tar_gid) =
          try List.assoc edge_ident matching.e_match
803 804
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
bguillaum's avatar
bguillaum committed
805
         {instance with
bguillaum's avatar
bguillaum committed
806
          Instance.graph = G_graph.del_edge ?domain ~edge_ident loc instance.Instance.graph src_gid edge tar_gid;
807
          history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
808
        },
bguillaum's avatar
bguillaum committed
809
         created_nodes
bguillaum's avatar
bguillaum committed
810
        )
811

bguillaum's avatar
bguillaum committed
812
    | Command.DEL_NODE node_cn ->
813 814
        let node_gid = node_find node_cn in
        (
bguillaum's avatar
bguillaum committed
815
         {instance with
816
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
817
          history = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.history
818
        },
bguillaum's avatar
bguillaum committed
819
         created_nodes
820 821 822 823 824
        )

    | Command.MERGE_NODE (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
825
        (match G_graph.merge_node loc ?domain instance.Instance.graph src_gid tar_gid with
bguillaum's avatar
bguillaum committed
826
        | Some new_graph ->
827
            (
bguillaum's avatar
bguillaum committed
828
             {instance with
829
              Instance.graph = new_graph;
830
              history = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.history
831
            },