grew_rule.ml 44.5 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 16 17
IFDEF DEP2PICT THEN
open Dep2pict
ENDIF

18
open Grew_base
19 20
open Grew_types

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

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

37
  let empty = {graph = G_graph.empty; rules=[]; history=[]; big_step=None; }
38

39
  let from_graph graph = {empty with graph }
pj2m's avatar
pj2m committed
40

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

47 48
  let refresh t = { empty with graph=t.graph }

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

53
  let to_gr domain t = G_graph.to_gr domain t.graph
54

55
  let to_conll_string domain t = G_graph.to_conll_string domain t.graph
bguillaum's avatar
bguillaum committed
56

57 58
  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"))
59

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

67 68
  let save_dep_svg domain ?filter ?main_feat base t =
    let dep = G_graph.to_dep domain ?filter ?main_feat t.graph in
69 70 71 72
    let d2p = Dep2pict.from_dep ~dep in
    let _ = Dep2pict.save_svg ~filename: (base^".png") d2p in
    Dep2pict.highlight_shift ()
 
bguillaum's avatar
bguillaum committed
73
  ELSE
bguillaum's avatar
bguillaum committed
74 75
  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
76
  ENDIF
77
end (* module Instance *)
pj2m's avatar
pj2m committed
78

79
(* ================================================================================ *)
80
module Instance_set = Set.Make (Instance)
pj2m's avatar
pj2m committed
81

82
(* ================================================================================ *)
bguillaum's avatar
bguillaum committed
83 84
module Rule = struct
  (* the rewriting depth is bounded to stop rewriting when the system is not terminating *)
85
  let max_depth = ref 500
pj2m's avatar
pj2m committed
86

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

bguillaum's avatar
bguillaum committed
93 94
    | Feature_re of Pid.t * string * string

95
    | Feature_ineq of Ast.ineq * Pid.t * string * Pid.t * string
96 97
    | Feature_ineq_cst of Ast.ineq * Pid.t * string * float

bguillaum's avatar
bguillaum committed
98
    | 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
99

bguillaum's avatar
bguillaum committed
100 101 102
    | Prec of Pid.t * Pid.t
    | Lprec of Pid.t * Pid.t

103
  let build_pos_constraint domain pos_table const =
bguillaum's avatar
bguillaum committed
104 105
    let pid_of_name loc node_name = Pid.Pos (Id.build ~loc node_name pos_table) in
    match const with
106
      | (Ast.Cst_out (id,label_cst), loc) ->
107
        Cst_out (pid_of_name loc id, Label_cst.build ~loc domain label_cst)
108
      | (Ast.Cst_in (id,label_cst), loc) ->
109
        Cst_in (pid_of_name loc id, Label_cst.build ~loc domain label_cst)
110 111

      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
112 113
        Domain.check_feature_name domain ~loc feat_name1;
        Domain.check_feature_name domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
114
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
115

116
      | (Ast.Feature_diseq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
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_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
120

121
      | (Ast.Feature_ineq (ineq, (node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
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_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
125

126
      | (Ast.Feature_ineq_cst (ineq, (node_name1, feat_name1), constant), loc) ->
127
        Domain.check_feature_name domain ~loc feat_name1;
128 129
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)

bguillaum's avatar
bguillaum committed
130 131 132
      | (Ast.Feature_re ((node_name, feat_name), regexp), loc) ->
        Domain.check_feature_name domain ~loc feat_name;
        Feature_re (pid_of_name loc node_name, feat_name, regexp)
bguillaum's avatar
bguillaum committed
133

bguillaum's avatar
bguillaum committed
134 135 136 137 138 139
      | (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
140
  type basic = {
141 142 143
    graph: P_graph.t;
    constraints: const list;
  }
pj2m's avatar
pj2m committed
144

145
  let build_pos_basic domain ?pat_vars ?(locals=[||]) basic_ast =
146
    let (graph, pos_table) =
147
      P_graph.build domain ?pat_vars basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
pj2m's avatar
pj2m committed
148
    (
bguillaum's avatar
bguillaum committed
149 150
      {
        graph = graph;
151
        constraints = List.map (build_pos_constraint domain pos_table) basic_ast.Ast.pat_const
bguillaum's avatar
bguillaum committed
152 153
      },
      pos_table
pj2m's avatar
pj2m committed
154 155
    )

bguillaum's avatar
bguillaum committed
156
  (* the neg part *)
157
  let build_neg_constraint domain pos_table neg_table const =
bguillaum's avatar
bguillaum committed
158 159 160 161
    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
162
    match const with
163
      | (Ast.Cst_out (id,label_cst), loc) ->
164
        Cst_out (pid_of_name loc id, Label_cst.build ~loc domain label_cst)
165
      | (Ast.Cst_in (id,label_cst), loc) ->
166
        Cst_in (pid_of_name loc id, Label_cst.build ~loc domain label_cst)
167

168 169 170
      | (Ast.Feature_eq (feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
171 172
        Domain.check_feature_name domain ~loc feat_name1;
        Domain.check_feature_name domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
173
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
174

175 176 177
      | (Ast.Feature_diseq (feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
178 179
        Domain.check_feature_name domain ~loc feat_name1;
        Domain.check_feature_name domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
180
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
181

182 183 184
      | (Ast.Feature_ineq (ineq, feat_id1, feat_id2), loc) ->
        let (node_name1, feat_name1) = feat_id1
        and (node_name2, feat_name2) = feat_id2 in
185 186
        Domain.check_feature_name domain ~loc feat_name1;
        Domain.check_feature_name domain ~loc feat_name2;
bguillaum's avatar
bguillaum committed
187
        Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
188

189 190
      | (Ast.Feature_ineq_cst (ineq, feat_id1, constant), loc) ->
        let (node_name1, feat_name1) = feat_id1 in
191
        Domain.check_feature_name domain ~loc feat_name1;
192
        Feature_ineq_cst (ineq, pid_of_name loc node_name1, feat_name1, constant)
pj2m's avatar
pj2m committed
193

bguillaum's avatar
bguillaum committed
194 195 196 197 198
      | (Ast.Feature_re (feat_id, regexp), loc) ->
        let (node_name, feat_name) = feat_id in
        Domain.check_feature_name domain ~loc feat_name;
        Feature_re (pid_of_name loc node_name, feat_name, regexp)

bguillaum's avatar
bguillaum committed
199 200 201 202 203 204
      | (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
205
  (* It may raise [P_fs.Fail_unif] in case of contradiction on constraints *)
206
  let build_neg_basic domain ?pat_vars ?(locals=[||]) pos_table basic_ast =
pj2m's avatar
pj2m committed
207
    let (extension, neg_table) =
208
      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
209

210
    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
211
    {
bguillaum's avatar
bguillaum committed
212
      graph = extension.P_graph.ext_map;
213
      constraints = filters @ List.map (build_neg_constraint domain pos_table neg_table) basic_ast.Ast.pat_const ;
bguillaum's avatar
bguillaum committed
214
    }
pj2m's avatar
pj2m committed
215

bguillaum's avatar
bguillaum committed
216
  let get_edge_ids basic =
217
    Pid_map.fold
bguillaum's avatar
bguillaum committed
218 219
      (fun _ node acc ->
        Massoc_pid.fold
220 221
          (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
222
      ) basic.graph []
bguillaum's avatar
bguillaum committed
223

224 225 226
  (* a [pattern] is described by the positive basic and a list of negative basics. *)
  type pattern = basic * basic list

pj2m's avatar
pj2m committed
227 228
  type t = {
      name: string;
229
      pattern: pattern;
pj2m's avatar
pj2m committed
230
      commands: Command.t list;
231
      param: Lex_par.t option;
232
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
233
      loc: Loc.t;
pj2m's avatar
pj2m committed
234 235
    }

bguillaum's avatar
bguillaum committed
236 237
  let get_name t = t.name

238
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
239

240 241 242
  let is_filter t = t.commands = []

  (* ====================================================================== *)
243
  let to_dep domain t =
244
    let pos_basic = fst t.pattern in
245 246 247
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

bguillaum's avatar
bguillaum committed
248 249
    let nodes =
      Pid_map.fold
250
        (fun id node acc ->
bguillaum's avatar
bguillaum committed
251 252
          (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))
253
          )
254
          :: acc
255
        ) pos_basic.graph [] in
256

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

260 261 262 263 264
    bprintf buff "[WORDS] {\n";
    List.iter
      (fun (_, dep_line) -> bprintf buff "%s\n" dep_line
      ) sorted_nodes;

265
    List.iteri
266 267
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
268
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i
269
          | _ -> ()
270
      ) pos_basic.constraints;
271
    bprintf buff "}\n";
bguillaum's avatar
bguillaum committed
272

273
    bprintf buff "[EDGES] {\n";
bguillaum's avatar
bguillaum committed
274

275 276
    Pid_map.iter
      (fun id_src node ->
bguillaum's avatar
bguillaum committed
277
        Massoc_pid.iter
278
          (fun id_tar edge ->
bguillaum's avatar
bguillaum committed
279 280 281
            bprintf buff "  N_%s -> N_%s { label=\"%s\"}\n"
              (Pid.to_id id_src)
              (Pid.to_id id_tar)
282
              (P_edge.to_string domain edge)
283 284
          )
          (P_node.get_next node)
285
      ) pos_basic.graph;
286

287
    List.iteri
288 289
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
290
          | Cst_out (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
291
            bprintf buff "  N_%s -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n"
292
              (Pid.to_id pid) i (Label_cst.to_string domain label_cst)
bguillaum's avatar
bguillaum committed
293
          | Cst_in (pid, label_cst) ->
bguillaum's avatar
bguillaum committed
294
            bprintf buff "  C_%d -> N_%s {label = \"%s\"; style=dot; bottom; color=green;}\n"
295
              i (Pid.to_id pid) (Label_cst.to_string domain label_cst)
296
          | _ -> ()
297
      ) pos_basic.constraints;
298 299
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
300

301
  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
302 303
  let build_commands domain ?param ?(locals=[||]) pos pos_table ast_commands =
    let known_act_ids = Array.to_list pos_table in
304
    let known_edge_ids = get_edge_ids pos in
305

306
    let rec loop (kai,kei) = function
307 308
      | [] -> []
      | ast_command :: tail ->
309
          let (command, (new_kai, new_kei)) =
310
            Command.build
311
              domain
312
              domain
313
              ?param
314
              (kai,kei)
315 316 317
              pos_table
              locals
              ast_command in
318 319
          command :: (loop (new_kai,new_kei) tail) in
    loop (known_act_ids, known_edge_ids) ast_commands
320 321

  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
322 323 324 325 326 327 328 329 330 331 332 333
  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

334
  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
335
  let build domain ?(locals=[||]) dir rule_ast =
bguillaum's avatar
bguillaum committed
336 337

    let (param, pat_vars, cmd_vars) =
bguillaum's avatar
bguillaum committed
338 339
      match rule_ast.Ast.param with
      | None -> (None,[],[])
340
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
341 342 343
          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
344

345
          (* first: load lexical parameters given in the same file at the end of the rule definition *)
bguillaum's avatar
bguillaum committed
346 347 348 349
          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

350
          (* second: load lexical parameters given in external files *)
bguillaum's avatar
bguillaum committed
351
          let full_param = List.fold_left
352
            (fun acc file ->
bguillaum's avatar
bguillaum committed
353 354 355 356 357 358
              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
359

360 361 362 363 364
    (match (param, pat_vars) with
      | (None, _::_) -> Error.build ~loc:rule_ast.Ast.rule_loc "Missing lexical parameters in rule \"%s\"" rule_ast.Ast.rule_id
      | _ -> ()
    );

365
    let (pos, pos_table) = build_pos_basic domain ~pat_vars rule_ast.Ast.pattern.Ast.pat_pos in
bguillaum's avatar
bguillaum committed
366 367 368
    let (negs,_) =
      List.fold_left
      (fun (acc,pos) basic_ast ->
369
        try ((build_neg_basic domain ~pat_vars pos_table basic_ast) :: acc, pos+1)
bguillaum's avatar
bguillaum committed
370 371 372 373
        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)
374
      ) ([],1) rule_ast.Ast.pattern.Ast.pat_negs in
pj2m's avatar
pj2m committed
375
    {
bguillaum's avatar
bguillaum committed
376
      name = rule_ast.Ast.rule_id;
377
      pattern = (pos, negs);
378
      commands = build_commands domain ~param:(pat_vars,cmd_vars) pos pos_table rule_ast.Ast.commands;
bguillaum's avatar
bguillaum committed
379 380 381 382 383
      loc = rule_ast.Ast.rule_loc;
      param = param;
      param_names = (pat_vars,cmd_vars)
    }

384 385 386
  let build_pattern domain pattern_ast =
    let (pos, pos_table) = build_pos_basic domain pattern_ast.Ast.pat_pos in
    let negs = List_.try_map P_fs.Fail_unif (fun basic_ast -> build_neg_basic domain pos_table basic_ast) pattern_ast.Ast.pat_negs in
bguillaum's avatar
bguillaum committed
387 388
    (pos, negs)

389
  (* ====================================================================== *)
pj2m's avatar
pj2m committed
390
  type matching = {
391
      n_match: Gid.t Pid_map.t;                     (* partial fct: pattern nodes |--> graph nodes *)
392
      e_match: (string*(Gid.t*Label.t*Gid.t)) list; (* edge matching: edge ident  |--> (src,label,tar) *)
bguillaum's avatar
bguillaum committed
393
      a_match: (Gid.t*Label.t*Gid.t) list;          (* anonymous edge matched *)
394
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
395
    }
396

397 398 399 400 401 402 403 404
  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
405
  let empty_matching param = { n_match = Pid_map.empty; e_match = []; a_match = []; m_param = param;}
406

pj2m's avatar
pj2m committed
407 408
  let e_comp (e1,_) (e2,_) = compare e1 e2

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

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

416
  let match_deco pattern matching =
417 418 419
    { G_deco.nodes =
        Pid_map.fold
          (fun pid gid acc ->
420
            let pnode = P_graph.find pid (fst pattern).graph in
421 422
            (gid, (P_node.get_name pnode, P_fs.feat_list (P_node.get_fs pnode))) ::acc
          ) matching.n_match [];
423
      G_deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
pj2m's avatar
pj2m committed
424 425
    }

bguillaum's avatar
bguillaum committed
426
  let find cnode ?loc (matching, created_nodes) =
pj2m's avatar
pj2m committed
427
    match cnode with
428
    | Command.Pat pid ->
429
        (try Pid_map.find pid matching.n_match
bguillaum's avatar
bguillaum committed
430 431
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%s' not found" (Pid.to_string pid))
    | Command.New name ->
bguillaum's avatar
bguillaum committed
432 433
        (try List.assoc name created_nodes
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name)
pj2m's avatar
pj2m committed
434 435

  let down_deco (matching,created_nodes) commands =
436 437 438 439 440 441 442 443 444 445
    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
446
    {
447
     G_deco.nodes = List.map (fun (gid,feat_list) -> (gid, ("",feat_list))) (Gid_map.bindings feat_to_highlight);
448
     G_deco.edges = List.fold_left
bguillaum's avatar
bguillaum committed
449 450
       (fun acc -> function
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->
451
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
452
         | _ -> acc
pj2m's avatar
pj2m committed
453 454 455 456 457
       ) [] commands
   }

  exception Fail
  type partial = {
bguillaum's avatar
bguillaum committed
458
      sub: matching;
459 460 461
      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
462
      check: const list (* constraints to verify at the end of the matching *)
bguillaum's avatar
bguillaum committed
463 464 465 466
    }

        (* PREREQUISITES:
           - all partial matching have the same domain
467 468
           - the domain of the pattern P is the disjoint union of domain([sub]) and [unmatched_nodes]
         *)
bguillaum's avatar
bguillaum committed
469
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
470 471
  let init param basic =
    let roots = P_graph.roots basic.graph in
pj2m's avatar
pj2m committed
472

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

    (* put all roots in the front of the list to speed up the algo *)
bguillaum's avatar
bguillaum committed
476
    let sorted_node_list =
pj2m's avatar
pj2m committed
477
      List.sort
478 479 480 481
        (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
482

bguillaum's avatar
bguillaum committed
483
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
484 485 486
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
bguillaum's avatar
bguillaum committed
487
      check = basic.constraints;
pj2m's avatar
pj2m committed
488 489
    }

bguillaum's avatar
bguillaum committed
490
  (*  ---------------------------------------------------------------------- *)
491
  let apply_cst domain graph matching cst =
bguillaum's avatar
bguillaum committed
492
    let get_node pid = G_graph.find (Pid_map.find pid matching.n_match) graph in
493 494 495 496 497 498
    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
499 500

    match cst with
bguillaum's avatar
bguillaum committed
501
      | Cst_out (pid,label_cst) ->
502
        let gid = Pid_map.find pid matching.n_match in
503
        if G_graph.edge_out domain graph gid label_cst
bguillaum's avatar
bguillaum committed
504 505
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
506
      | Cst_in (pid,label_cst) ->
507
        let gid = Pid_map.find pid matching.n_match in
bguillaum's avatar
bguillaum committed
508
        if G_graph.node_exists
509
          (fun node ->
510
            List.exists (fun e -> Label_cst.match_ domain label_cst e) (Massoc_gid.assoc gid (G_node.get_next node))
511
          ) graph
bguillaum's avatar
bguillaum committed
512 513
        then matching
        else raise Fail
bguillaum's avatar
bguillaum committed
514
      | Filter (pid, fs) ->
bguillaum's avatar
bguillaum committed
515 516 517 518 519 520 521 522
        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
523 524 525
      | 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
526 527
            | Some fv1, Some fv2 when fv1 = fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
528 529 530 531
        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
532 533
            | Some fv1, Some fv2 when fv1 <> fv2 -> matching
            | _ -> raise Fail
bguillaum's avatar
bguillaum committed
534 535
        end
      | Feature_ineq (ineq, pid1, feat_name1, pid2, feat_name2) ->
536 537
        begin
          match (ineq, get_float_feat pid1 feat_name1, get_float_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
538 539 540 541 542
            | (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
543 544 545 546 547 548 549 550 551 552
          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
553 554 555 556 557 558
      | 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
559
            if String_.re_match re string_feat then matching else raise Fail
bguillaum's avatar
bguillaum committed
560
        end
bguillaum's avatar
bguillaum committed
561 562 563
      | Prec (pid1, pid2) ->
          let gid1 = Pid_map.find pid1 matching.n_match in
          let gid2 = Pid_map.find pid2 matching.n_match in
564
          let gnode1 = G_graph.find gid1 graph in
565
          if G_node.get_succ gnode1 = Some gid2
566 567
          then matching
          else  raise Fail
bguillaum's avatar
bguillaum committed
568
      | Lprec (pid1, pid2) ->
569 570 571 572 573
          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
574

bguillaum's avatar
bguillaum committed
575
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
576
  (* returns all extension of the partial input matching *)
577
  let rec extend_matching domain (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
578
    match (partial.unmatched_edges, partial.unmatched_nodes) with
bguillaum's avatar
bguillaum committed
579
    | [], [] ->
bguillaum's avatar
bguillaum committed
580 581 582 583 584
      begin
        try
          let new_matching =
            List.fold_left
              (fun acc const ->
585
                apply_cst domain graph acc const
bguillaum's avatar
bguillaum committed
586 587 588 589
              ) partial.sub partial.check in
          [new_matching, partial.already_matched_gids]
        with Fail -> []
      end
pj2m's avatar
pj2m committed
590
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
591 592
        begin
          try (* is the tar already found in the matching ? *)
bguillaum's avatar
bguillaum committed
593
            let new_partials =
594 595 596
              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
597
              let g_edges = Massoc_gid.assoc tar_gid (G_node.get_next src_gnode) in
bguillaum's avatar
bguillaum committed
598

599
              match P_edge.match_list domain p_edge g_edges with
600
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
601
                  []
602
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
bguillaum's avatar
bguillaum committed
603
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ]
604
              | 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
605
                  List.map
606 607
                    (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
608
                    ) labels
609
            in List_.flat_map (extend_matching domain (positive,neg) graph) new_partials
610 611
          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
612
              let (src_gid : Gid.t) = Pid_map.find src_pid partial.sub.n_match in
613
              let src_gnode = G_graph.find src_gid graph in
614
              Massoc_gid.fold
615
                (fun acc gid_next g_edge ->
616
                  match P_edge.match_ domain p_edge g_edge with
617
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
618
                      acc
619
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
bguillaum's avatar
bguillaum committed
620
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc
621
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
622
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
623 624
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
625
            List_.flat_map
bguillaum's avatar
bguillaum committed
626
              (fun (gid_next, matching) ->
627
                extend_matching_from domain (positive,neg) graph tar_pid gid_next
628 629 630
                  {partial with sub=matching; unmatched_edges = tail_ue}
              ) candidates
        end
bguillaum's avatar
bguillaum committed
631
    | [], pid :: _ ->
632 633
        G_graph.fold_gid
          (fun gid acc ->
634
            (extend_matching_from domain (positive,neg) graph pid gid partial) @ acc
635
          ) graph []
bguillaum's avatar
bguillaum committed
636

bguillaum's avatar
bguillaum committed
637
  (*  ---------------------------------------------------------------------- *)
638
  and extend_matching_from domain (positive,neg) (graph:G_graph.t) pid (gid : Gid.t) partial =
pj2m's avatar
pj2m committed
639 640 641
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
bguillaum's avatar
bguillaum committed
642 643 644 645 646 647 648 649 650 651
      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 *)
652
      let g_node = try G_graph.find gid graph with Not_found -> failwith "INS" in
bguillaum's avatar
bguillaum committed
653

bguillaum's avatar
bguillaum committed
654
      try
655
        let new_param = P_node.match_ ?param: partial.sub.m_param p_node g_node in
656
        (* add all out-edges from pid in pattern *)
bguillaum's avatar
bguillaum committed
657 658
        let new_unmatched_edges =
          Massoc_pid.fold
659
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
660
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
661 662

        let new_partial =
bguillaum's avatar
bguillaum committed
663
          { partial with
bguillaum's avatar
bguillaum committed
664
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> failwith "List_.rm");
bguillaum's avatar
bguillaum committed
665 666 667 668
            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
669
        extend_matching domain (positive,neg) graph new_partial
670
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
671

bguillaum's avatar
bguillaum committed
672 673
  (*  ---------------------------------------------------------------------- *)
  (* the exception below is added to handle unification failure in merge!! *)
674
  exception Command_execution_fail
pj2m's avatar
pj2m committed
675

bguillaum's avatar
bguillaum committed
676 677
  (*  ---------------------------------------------------------------------- *)
  (** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
bguillaum's avatar
bguillaum committed
678 679
  let apply_command domain (command,loc) instance matching created_nodes =
    let node_find cnode = find ~loc cnode (matching, created_nodes) in
680 681

    match command with
bguillaum's avatar
bguillaum committed
682
    | Command.ADD_EDGE (src_cn,tar_cn,edge) ->
683 684 685
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
686
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
bguillaum's avatar
bguillaum committed
687
          | Some new_graph ->
688
              (
bguillaum's avatar
bguillaum committed
689 690
               {instance with
                Instance.graph = new_graph;
691
                history = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.history
692
              },
bguillaum's avatar
bguillaum committed
693
               created_nodes
694
              )
bguillaum's avatar
bguillaum committed
695
          | None ->
696
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string domain edge) (Loc.to_string loc)
697 698
        end

bguillaum's avatar
bguillaum committed
699
    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) ->
700 701 702
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
703
         {instance with
704
          Instance.graph = G_graph.del_edge domain loc instance.Instance.graph src_gid edge tar_gid;
705
           history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
706
        },
bguillaum's avatar
bguillaum committed
707
         created_nodes
708 709 710
        )

    | Command.DEL_EDGE_NAME edge_ident ->
bguillaum's avatar
bguillaum committed
711 712
        let (src_gid,edge,tar_gid) =
          try List.assoc edge_ident matching.e_match
713 714
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
bguillaum's avatar
bguillaum committed
715
         {instance with
716
          Instance.graph = G_graph.del_edge domain ~edge_ident loc instance.Instance.graph src_gid edge tar_gid;
717
          history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
718
        },
bguillaum's avatar
bguillaum committed
719
         created_nodes
bguillaum's avatar
bguillaum committed
720
        )
721

bguillaum's avatar
bguillaum committed
722
    | Command.DEL_NODE node_cn ->
723 724
        let node_gid = node_find node_cn in
        (
bguillaum's avatar
bguillaum committed
725
         {instance with
726
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
727
          history = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.history
728
        },
bguillaum's avatar
bguillaum committed
729
         created_nodes
730 731 732 733 734
        )

    | Command.MERGE_NODE (src_cn, tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
735
        (match G_graph.merge_node loc domain instance.Instance.graph src_gid tar_gid with
bguillaum's avatar
bguillaum committed
736
        | Some new_graph ->
737
            (
bguillaum's avatar
bguillaum committed
738
             {instance with
739
              Instance.graph = new_graph;
740
              history = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.history
741
            },
bguillaum's avatar
bguillaum committed
742
             created_nodes
743 744 745
            )
        | None -> raise Command_execution_fail
        )
bguillaum's avatar
bguillaum committed
746

747
    | Command.UPDATE_FEAT (tar_cn,tar_feat_name, item_list) ->
bguillaum's avatar
bguillaum committed
748
        let tar_gid = node_find tar_cn in
749 750
        let rule_items = List.map
            (function
bguillaum's avatar
bguillaum committed
751 752
              | 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
753
              | Command.Param_out index ->
bguillaum's avatar
bguillaum committed
754 755
                  (match matching.m_param with
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
756
                  | Some param -> Concat_item.String (Lex_par.get_command_value index param))
bguillaum's avatar
bguillaum committed
757
              | Command.Param_in index ->
bguillaum's avatar
bguillaum committed
758
                  (match matching.m_param with
759
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
760
                  | Some param -> Concat_item.String (Lex_par.get_param_value index param))
761
            ) item_list in
762

bguillaum's avatar
bguillaum committed
763
        let (new_graph, new_feature_value) =
764
          G_graph.update_feat ~loc domain instance.Instance.graph tar_gid tar_feat_name rule_items in
bguillaum's avatar
bguillaum committed
765
        (
766 767
         {instance with
          Instance.graph = new_graph;
768
          history = List_.sort_insert (Command.H_UPDATE_FEAT (tar_gid,tar_feat_name,new_feature_value)) instance.Instance.history
bguillaum's avatar
bguillaum committed
769
        },
bguillaum's avatar
bguillaum committed
770
         created_nodes
771
        )
772 773 774 775

    | Command.DEL_FEAT (tar_cn,feat_name) ->
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
776
         {instance with
777
          Instance.graph = G_graph.del_feat instance.Instance.graph tar_gid feat_name;
778
          history = List_.sort_insert (Command.H_DEL_FEAT (tar_gid,feat_name)) instance.Instance.history
779
        },
bguillaum's avatar
bguillaum committed
780
         created_nodes
bguillaum's avatar
bguillaum committed
781
        )
782 783

    | Command.NEW_NEIGHBOUR (created_name,edge,base_pid) ->
784
        let base_gid = Pid_map.find base_pid matching.n_match in