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

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

14
open Grew_base
15 16
open Grew_types

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

24
(* ================================================================================ *)
pj2m's avatar
pj2m committed
25 26
module Instance = struct
  type t = {
27 28 29
    graph: G_graph.t;
    history: Command.h list;
    rules: string list;
30
    big_step: Libgrew_types.big_step option;
31 32 33 34 35 36 37 38 39
    free_index: int;
    activated_node: Gid.t list;
  }

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

  let from_graph graph =
    {empty with
      graph = graph;
40
      free_index = (G_graph.max_binding graph) + 1;
pj2m's avatar
pj2m committed
41 42
    }

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

49 50 51 52 53 54 55 56 57 58
  let flatten t =
    (* [mapping] is list of couple (node_id, node_id) used to flatten the graph *)
    let (mapping, new_free) = List.fold_left
      (fun (acc_map, next_free) node_id ->
        (
          (node_id, Gid.Old next_free) :: acc_map,
          next_free + 1
        )
      ) ([], t.free_index) t.activated_node in
    { empty with graph = G_graph.rename mapping t.graph; free_index = new_free }
pj2m's avatar
pj2m committed
59

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

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

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

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

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

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

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

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

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

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

104
    | Feature_ineq of Ast.ineq * Pid.t * string * Pid.t * string
bguillaum's avatar
bguillaum committed
105
    | 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
106

bguillaum's avatar
bguillaum committed
107 108 109
  let build_pos_constraint ?locals pos_table const =
    let pid_of_name loc node_name = Pid.Pos (Id.build ~loc node_name pos_table) in
    match const with
110 111 112 113 114 115 116 117 118 119
      | (Ast.Start (id, labels), loc) ->
        Cst_out (pid_of_name loc id, P_edge.make ~loc ?locals labels)
      | (Ast.Cst_out id, loc) ->
        Cst_out (pid_of_name loc id, P_edge.all)
      | (Ast.End (id, labels),loc) ->
        Cst_in (pid_of_name loc id, P_edge.make ~loc ?locals labels)
      | (Ast.Cst_in id, loc) ->
        Cst_in (pid_of_name loc id, P_edge.all)

      | (Ast.Feature_eq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
120
        Feature_eq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
121
      | (Ast.Feature_diseq ((node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
bguillaum's avatar
bguillaum committed
122
        Feature_diseq (pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
123
      | (Ast.Feature_ineq (ineq, (node_name1, feat_name1), (node_name2, feat_name2)), loc) ->
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)
bguillaum's avatar
bguillaum committed
125

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

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

bguillaum's avatar
bguillaum committed
142
  (* the neg part *)
pj2m's avatar
pj2m committed
143
  let build_neg_constraint ?locals pos_table neg_table const =
bguillaum's avatar
bguillaum committed
144 145 146 147
    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
148
    match const with
149 150 151 152 153 154 155 156 157 158 159 160 161
      | (Ast.Start (id, labels),loc) ->
        Cst_out (pid_of_name loc id, P_edge.make ~loc ?locals labels)
      | (Ast.Cst_out id, loc) ->
        Cst_out (pid_of_name loc id, P_edge.all)
      | (Ast.End (id, labels),loc) ->
        Cst_in (pid_of_name loc id, P_edge.make ~loc ?locals labels)
      | (Ast.Cst_in id, loc) ->
        Cst_in (pid_of_name loc id, P_edge.all)

      | (Ast.Feature_eq (qfn1, qfn2), loc) ->
        let (node_name1, feat_name1) = qfn1
        and (node_name2, feat_name2) = qfn2 in

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

bguillaum's avatar
bguillaum committed
172
  let build_neg_basic ?(locals=[||]) pos_table basic_ast =
pj2m's avatar
pj2m committed
173
    let (extension, neg_table) =
bguillaum's avatar
bguillaum committed
174
      P_graph.build_extension ~locals pos_table basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
175
    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
176
    {
bguillaum's avatar
bguillaum committed
177
      graph = extension.P_graph.ext_map;
bguillaum's avatar
bguillaum committed
178
      constraints = filters @ List.map (build_neg_constraint ~locals pos_table neg_table) basic_ast.Ast.pat_const ;
bguillaum's avatar
bguillaum committed
179
    }
pj2m's avatar
pj2m committed
180

bguillaum's avatar
bguillaum committed
181
  let get_edge_ids basic =
182
    Pid_map.fold
bguillaum's avatar
bguillaum committed
183 184
      (fun _ node acc ->
        Massoc_pid.fold
185 186
          (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
187
      ) basic.graph []
bguillaum's avatar
bguillaum committed
188

pj2m's avatar
pj2m committed
189 190
  type t = {
      name: string;
bguillaum's avatar
bguillaum committed
191 192
      pos: basic;
      neg: basic list;
pj2m's avatar
pj2m committed
193
      commands: Command.t list;
194
      param: Lex_par.t option;
195
      param_names: (string list * string list);
bguillaum's avatar
bguillaum committed
196
      loc: Loc.t;
pj2m's avatar
pj2m committed
197 198
    }

bguillaum's avatar
bguillaum committed
199 200
  let get_name t = t.name

201
  let get_loc t = t.loc
pj2m's avatar
pj2m committed
202

203 204 205
  let is_filter t = t.commands = []

  (* ====================================================================== *)
206 207 208 209
  let to_dep t =
    let buff = Buffer.create 32 in
    bprintf buff "[GRAPH] { scale = 200; }\n";

bguillaum's avatar
bguillaum committed
210 211
    let nodes =
      Pid_map.fold
212
        (fun id node acc ->
bguillaum's avatar
bguillaum committed
213 214
          (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))
215
          )
216 217 218
          :: acc
        ) t.pos.graph [] in

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

222 223 224 225 226 227 228 229
    bprintf buff "[WORDS] {\n";
    List.iter
      (fun (_, dep_line) -> bprintf buff "%s\n" dep_line
      ) sorted_nodes;

    List_.iteri
      (fun i cst ->
        match cst with
bguillaum's avatar
bguillaum committed
230
          | Cst_out _ | Cst_in _ -> bprintf buff "  C_%d { word=\"*\"}\n" i
231 232 233
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
bguillaum's avatar
bguillaum committed
234

235
    bprintf buff "[EDGES] {\n";
bguillaum's avatar
bguillaum committed
236

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

    List_.iteri
      (fun i cst ->
        match cst with
          | Cst_out (pid, edge) ->
bguillaum's avatar
bguillaum committed
253 254 255 256 257
            bprintf buff "  N_%s -> C_%d {label = \"%s\"; style=dot; bottom; color=green;}\n"
              (Pid.to_id pid) i (P_edge.to_string edge)
          | Cst_in (pid, edge) ->
            bprintf buff "  C_%d -> N_%s {label = \"%s\"; style=dot; bottom; color=green;}\n"
              i (Pid.to_id pid) (P_edge.to_string edge)
258 259 260 261
          | _ -> ()
      ) t.pos.constraints;
    bprintf buff "}\n";
    Buffer.contents buff
bguillaum's avatar
bguillaum committed
262

263
  (* ====================================================================== *)
264
  let build_commands ?param ?(locals=[||]) suffixes pos pos_table ast_commands =
265
    let known_act_ids = List.map (fun x -> (x,None)) (Array.to_list pos_table) in
266
    let known_edge_ids = get_edge_ids pos in
267

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

  (* ====================================================================== *)
bguillaum's avatar
bguillaum committed
283 284 285 286 287 288 289 290 291 292 293 294
  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

295
  (* ====================================================================== *)
296
  let build ?(locals=[||]) suffixes dir rule_ast =
bguillaum's avatar
bguillaum committed
297 298

    let (param, pat_vars, cmd_vars) =
bguillaum's avatar
bguillaum committed
299 300
      match rule_ast.Ast.param with
      | None -> (None,[],[])
301
      | Some (files,vars) ->
bguillaum's avatar
bguillaum committed
302 303 304
          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
305 306 307 308 309 310
          let param = List.fold_left
            (fun acc file ->
              Lex_par.append
                (Lex_par.load ~loc:rule_ast.Ast.rule_loc dir nb_pv nb_cv file)
                acc
            )
bguillaum's avatar
bguillaum committed
311 312
            (match rule_ast.Ast.lp with
              | None -> Lex_par.empty
313 314 315
              | Some lines -> Lex_par.from_lines ~loc:rule_ast.Ast.rule_loc nb_pv nb_cv lines
            )
            files in
316
          (Some param, pat_vars, cmd_vars) in
317

bguillaum's avatar
bguillaum committed
318
    let (pos, pos_table) = build_pos_basic ~pat_vars ~locals rule_ast.Ast.pos_basic in
pj2m's avatar
pj2m committed
319
    {
bguillaum's avatar
bguillaum committed
320 321
      name = rule_ast.Ast.rule_id;
      pos = pos;
bguillaum's avatar
bguillaum committed
322
      neg = List.map (fun basic_ast -> build_neg_basic ~locals pos_table basic_ast) rule_ast.Ast.neg_basics;
323
      commands = build_commands ~param:(pat_vars,cmd_vars) ~locals suffixes pos pos_table rule_ast.Ast.commands;
bguillaum's avatar
bguillaum committed
324 325 326 327 328
      loc = rule_ast.Ast.rule_loc;
      param = param;
      param_names = (pat_vars,cmd_vars)
    }

bguillaum's avatar
bguillaum committed
329 330 331 332 333 334 335 336
  (* an isolated_pattern is a couple (pos, neg list) *)
  type isolated_pattern = basic * basic list

  let build_isolated_pattern isol_ast =
    let (pos, pos_table) = build_pos_basic isol_ast.Ast.isol_pos in
    let negs = List.map (fun basic_ast -> build_neg_basic pos_table basic_ast) isol_ast.Ast.isol_negs in
    (pos, negs)

337
  (* ====================================================================== *)
pj2m's avatar
pj2m committed
338
  type matching = {
339
      n_match: Gid.t Pid_map.t;                     (* partial fct: pattern nodes |--> graph nodes *)
340
      e_match: (string*(Gid.t*Label.t*Gid.t)) list; (* edge matching: edge ident  |--> (src,label,tar) *)
bguillaum's avatar
bguillaum committed
341
      a_match: (Gid.t*Label.t*Gid.t) list;          (* anonymous edge matched *)
342
      m_param: Lex_par.t option;
pj2m's avatar
pj2m committed
343
    }
344

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

pj2m's avatar
pj2m committed
347 348
  let e_comp (e1,_) (e2,_) = compare e1 e2

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

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

356 357 358 359 360 361 362
  let up_deco rule matching =
    { G_deco.nodes =
        Pid_map.fold
          (fun pid gid acc ->
            let pnode = P_graph.find pid rule.pos.graph in
            (gid, (P_node.get_name pnode, P_fs.feat_list (P_node.get_fs pnode))) ::acc
          ) matching.n_match [];
363
      G_deco.edges = List.fold_left (fun acc (_,edge) -> edge::acc) matching.a_match matching.e_match;
pj2m's avatar
pj2m committed
364 365
    }

bguillaum's avatar
bguillaum committed
366
  let find cnode ?loc (matching, (created_nodes,activated_nodes)) =
pj2m's avatar
pj2m committed
367
    match cnode with
368
    | Command.Pat pid ->
369
        (try Pid_map.find pid matching.n_match
bguillaum's avatar
bguillaum committed
370 371
        with Not_found -> Error.bug ?loc "Inconsistent matching pid '%s' not found" (Pid.to_string pid))
    | Command.New name ->
bguillaum's avatar
bguillaum committed
372 373
        (try List.assoc name created_nodes
        with Not_found -> Error.run ?loc "Identifier '%s' not found" name)
bguillaum's avatar
bguillaum committed
374 375 376 377
    | Command.Act (pid, new_name) ->
        (try List.assoc (pid, new_name) activated_nodes
        with Not_found -> Error.run ?loc "Activated identifier with suffix '%s' not found" new_name)

bguillaum's avatar
bguillaum committed
378

pj2m's avatar
pj2m committed
379 380

  let down_deco (matching,created_nodes) commands =
381 382 383 384 385 386 387 388 389 390
    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
391
    {
392
     G_deco.nodes = List.map (fun (gid,feat_list) -> (gid, ("",feat_list))) (Gid_map.bindings feat_to_highlight);
393
     G_deco.edges = List.fold_left
bguillaum's avatar
bguillaum committed
394 395
       (fun acc -> function
         | (Command.ADD_EDGE (src_cn,tar_cn,edge),loc) ->
396
             (find src_cn (matching, created_nodes), edge, find tar_cn (matching, created_nodes)) :: acc
397
         | _ -> acc
pj2m's avatar
pj2m committed
398 399 400 401 402
       ) [] commands
   }

  exception Fail
  type partial = {
bguillaum's avatar
bguillaum committed
403
      sub: matching;
404 405 406
      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
407
      check: const list (* constraints to verify at the end of the matching *)
bguillaum's avatar
bguillaum committed
408 409 410 411
    }

        (* PREREQUISITES:
           - all partial matching have the same domain
412 413
           - the domain of the pattern P is the disjoint union of domain([sub]) and [unmatched_nodes]
         *)
bguillaum's avatar
bguillaum committed
414
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
415 416
  let init param basic =
    let roots = P_graph.roots basic.graph in
pj2m's avatar
pj2m committed
417

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

    (* put all roots in the front of the list to speed up the algo *)
bguillaum's avatar
bguillaum committed
421
    let sorted_node_list =
pj2m's avatar
pj2m committed
422
      List.sort
423 424 425 426
        (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
427

bguillaum's avatar
bguillaum committed
428
    { sub = empty_matching param;
pj2m's avatar
pj2m committed
429 430 431
      unmatched_nodes = sorted_node_list;
      unmatched_edges = [];
      already_matched_gids = [];
bguillaum's avatar
bguillaum committed
432
      check = basic.constraints;
pj2m's avatar
pj2m committed
433 434
    }

bguillaum's avatar
bguillaum committed
435
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
436 437
  let fullfill graph matching cst =
    let get_node pid = G_graph.find (Pid_map.find pid matching.n_match) graph in
438 439 440 441 442 443
    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
444 445 446

    match cst with
      | Cst_out (pid,edge) ->
447 448
        let gid = Pid_map.find pid matching.n_match in
        G_graph.edge_out graph gid edge
bguillaum's avatar
bguillaum committed
449
      | Cst_in (pid,edge) ->
450
        let gid = Pid_map.find pid matching.n_match in
451 452
        G_graph.node_exists
          (fun node ->
453
            List.exists (fun e -> P_edge.compatible edge e) (Massoc_gid.assoc gid (G_node.get_next node))
454
          ) graph
bguillaum's avatar
bguillaum committed
455
      | Filter (pid, fs) ->
456
        let gid = Pid_map.find pid matching.n_match in
457
        let gnode = G_graph.find gid graph in
458
        P_fs.filter fs (G_node.get_fs gnode)
bguillaum's avatar
bguillaum committed
459 460 461 462 463 464 465 466 467 468 469 470 471
      | Feature_eq (pid1, feat_name1, pid2, feat_name2) ->
        begin
          match (get_string_feat pid1 feat_name1, get_string_feat pid2 feat_name2) with
            | Some fv1, Some fv2 when fv1 = fv2 -> true
            | _ -> false
        end
      | Feature_diseq (pid1, feat_name1, pid2, feat_name2) ->
        begin
          match (get_string_feat pid1 feat_name1, get_string_feat pid2 feat_name2) with
            | Some fv1, Some fv2 when fv1 <> fv2 -> true
            | _ -> false
        end
      | Feature_ineq (ineq, pid1, feat_name1, pid2, feat_name2) ->
bguillaum's avatar
bguillaum committed
472
        match (ineq, get_float_feat pid1 feat_name1, get_float_feat pid2 feat_name2) with
bguillaum's avatar
bguillaum committed
473 474 475 476 477
            | (Ast.Lt, Some fv1, Some fv2) when fv1 < fv2 -> true
            | (Ast.Gt, Some fv1, Some fv2) when fv1 > fv2 -> true
            | (Ast.Le, Some fv1, Some fv2) when fv1 <= fv2 -> true
            | (Ast.Ge, Some fv1, Some fv2) when fv1 >= fv2 -> true
            | _ -> false
pj2m's avatar
pj2m committed
478

bguillaum's avatar
bguillaum committed
479
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
480
  (* returns all extension of the partial input matching *)
481
  let rec extend_matching (positive,neg) (graph:G_graph.t) (partial:partial) =
pj2m's avatar
pj2m committed
482
    match (partial.unmatched_edges, partial.unmatched_nodes) with
bguillaum's avatar
bguillaum committed
483 484
    | [], [] ->
        if List.for_all (fun const -> fullfill graph partial.sub const) partial.check
485 486
        then [partial.sub, partial.already_matched_gids]
        else []
pj2m's avatar
pj2m committed
487
    | (src_pid, p_edge, tar_pid)::tail_ue, _ ->
488 489
        begin
          try (* is the tar already found in the matching ? *)
bguillaum's avatar
bguillaum committed
490
            let new_partials =
491 492 493
              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
494
              let g_edges = Massoc_gid.assoc tar_gid (G_node.get_next src_gnode) in
bguillaum's avatar
bguillaum committed
495

496 497
              match P_edge.match_list p_edge g_edges with
              | P_edge.Fail -> (* no good edge in graph for this pattern edge -> stop here *)
498
                  []
499
              | P_edge.Ok label -> (* at least an edge in the graph fits the p_edge "constraint" -> go on *)
bguillaum's avatar
bguillaum committed
500
                  [ {partial with unmatched_edges = tail_ue; sub = a_match_add (src_gid,label,tar_gid) partial.sub} ]
501
              | 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
502
                  List.map
503 504
                    (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
505
                    ) labels
506 507 508
            in List_.flat_map (extend_matching (positive,neg) graph) new_partials
          with Not_found -> (* p_edge goes to an unmatched node *)
            let candidates = (* candidates (of type (gid, matching)) for m(tar_pid) = gid) with new partial matching m *)
bguillaum's avatar
bguillaum committed
509
              let (src_gid : Gid.t) = Pid_map.find src_pid partial.sub.n_match in
510
              let src_gnode = G_graph.find src_gid graph in
511
              Massoc_gid.fold
512
                (fun acc gid_next g_edge ->
513 514
                  match P_edge.match_ p_edge g_edge with
                  | P_edge.Fail -> (* g_edge does not fit, no new candidate *)
515
                      acc
516
                  | P_edge.Ok label -> (* g_edge fits with the same matching *)
bguillaum's avatar
bguillaum committed
517
                      (gid_next, a_match_add (src_gid, label, gid_next) partial.sub) :: acc
518
                  | P_edge.Binds (id,[label]) -> (* g_edge fits with an extended matching *)
519
                      (gid_next, e_match_add (id, (src_gid, label, gid_next)) partial.sub) :: acc
520 521
                  | _ -> Error.bug "P_edge.match_ must return exactly one label"
                ) [] (G_node.get_next src_gnode) in
522
            List_.flat_map
bguillaum's avatar
bguillaum committed
523
              (fun (gid_next, matching) ->
524 525 526 527
                extend_matching_from (positive,neg) graph tar_pid gid_next
                  {partial with sub=matching; unmatched_edges = tail_ue}
              ) candidates
        end
bguillaum's avatar
bguillaum committed
528
    | [], pid :: _ ->
529 530
        G_graph.fold_gid
          (fun gid acc ->
531
            (extend_matching_from (positive,neg) graph pid gid partial) @ acc
532
          ) graph []
bguillaum's avatar
bguillaum committed
533

bguillaum's avatar
bguillaum committed
534
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
535
  and extend_matching_from (positive,neg) (graph:G_graph.t) pid (gid : Gid.t) partial =
pj2m's avatar
pj2m committed
536 537 538
    if List.mem gid partial.already_matched_gids
    then [] (* the required association pid -> gid is not injective *)
    else
bguillaum's avatar
bguillaum committed
539 540 541 542 543 544 545 546 547 548
      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 *)
549
      let g_node = try G_graph.find gid graph with Not_found -> failwith "INS" in
bguillaum's avatar
bguillaum committed
550

bguillaum's avatar
bguillaum committed
551
      try
552 553
        let new_param = P_node.match_ ?param: partial.sub.m_param p_node g_node in

554
        (* add all out-edges from pid in pattern *)
bguillaum's avatar
bguillaum committed
555 556
        let new_unmatched_edges =
          Massoc_pid.fold
557
            (fun acc pid_next p_edge -> (pid, p_edge, pid_next) :: acc
558
            ) partial.unmatched_edges (P_node.get_next p_node) in
bguillaum's avatar
bguillaum committed
559 560

        let new_partial =
bguillaum's avatar
bguillaum committed
561
          { partial with
bguillaum's avatar
bguillaum committed
562
            unmatched_nodes = (try List_.rm pid partial.unmatched_nodes with Not_found -> failwith "List_.rm");
bguillaum's avatar
bguillaum committed
563 564 565 566
            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
567
        extend_matching (positive,neg) graph new_partial
568
      with P_fs.Fail -> []
pj2m's avatar
pj2m committed
569

bguillaum's avatar
bguillaum committed
570 571
  (*  ---------------------------------------------------------------------- *)
  (* the exception below is added to handle unification failure in merge!! *)
572
  exception Command_execution_fail
pj2m's avatar
pj2m committed
573

bguillaum's avatar
bguillaum committed
574 575
  (*  ---------------------------------------------------------------------- *)
  (** [apply_command instance matching created_nodes command] returns [(new_instance, new_created_nodes)] *)
bguillaum's avatar
bguillaum committed
576 577
  let apply_command (command,loc) instance matching (created_nodes, (activated_nodes:((Pid.t * string) * Gid.t) list)) =
    let node_find cnode = find ~loc cnode (matching, (created_nodes, activated_nodes)) in
578 579

    match command with
bguillaum's avatar
bguillaum committed
580
    | Command.ADD_EDGE (src_cn,tar_cn,edge) ->
581 582 583
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        begin
584
          match G_graph.add_edge instance.Instance.graph src_gid edge tar_gid with
bguillaum's avatar
bguillaum committed
585
          | Some new_graph ->
586
              (
bguillaum's avatar
bguillaum committed
587 588
               {instance with
                Instance.graph = new_graph;
589
                history = List_.sort_insert (Command.H_ADD_EDGE (src_gid,tar_gid,edge)) instance.Instance.history
590
              },
bguillaum's avatar
bguillaum committed
591
               (created_nodes, activated_nodes)
592
              )
bguillaum's avatar
bguillaum committed
593
          | None ->
594
              Error.run "ADD_EDGE: the edge '%s' already exists %s" (G_edge.to_string edge) (Loc.to_string loc)
595 596
        end

bguillaum's avatar
bguillaum committed
597
    | Command.DEL_EDGE_EXPL (src_cn,tar_cn,edge) ->
598 599 600
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
601 602
         {instance with
          Instance.graph = G_graph.del_edge loc instance.Instance.graph src_gid edge tar_gid;
603
           history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
604
        },
bguillaum's avatar
bguillaum committed
605
         (created_nodes, activated_nodes)
606 607 608
        )

    | Command.DEL_EDGE_NAME edge_ident ->
bguillaum's avatar
bguillaum committed
609 610
        let (src_gid,edge,tar_gid) =
          try List.assoc edge_ident matching.e_match
611 612
          with Not_found -> Error.bug "The edge identifier '%s' is undefined %s" edge_ident (Loc.to_string loc) in
        (
bguillaum's avatar
bguillaum committed
613 614
         {instance with
          Instance.graph = G_graph.del_edge ~edge_ident loc instance.Instance.graph src_gid edge tar_gid;
615
          history = List_.sort_insert (Command.H_DEL_EDGE_EXPL (src_gid,tar_gid,edge)) instance.Instance.history
616
        },
bguillaum's avatar
bguillaum committed
617
         (created_nodes, activated_nodes)
bguillaum's avatar
bguillaum committed
618
        )
619

bguillaum's avatar
bguillaum committed
620
    | Command.DEL_NODE node_cn ->
621 622
        let node_gid = node_find node_cn in
        (
bguillaum's avatar
bguillaum committed
623
         {instance with
624
          Instance.graph = G_graph.del_node instance.Instance.graph node_gid;
625
          history = List_.sort_insert (Command.H_DEL_NODE node_gid) instance.Instance.history
626
        },
bguillaum's avatar
bguillaum committed
627
         (created_nodes, activated_nodes)
628 629 630 631 632
        )

    | Command.MERGE_NODE (src_cn, tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
633
        (match G_graph.merge_node loc instance.Instance.graph src_gid tar_gid with
bguillaum's avatar
bguillaum committed
634
        | Some new_graph ->
635
            (
bguillaum's avatar
bguillaum committed
636
             {instance with
637
              Instance.graph = new_graph;
638
              history = List_.sort_insert (Command.H_MERGE_NODE (src_gid,tar_gid)) instance.Instance.history
639
            },
bguillaum's avatar
bguillaum committed
640
             (created_nodes, activated_nodes)
641 642 643
            )
        | None -> raise Command_execution_fail
        )
bguillaum's avatar
bguillaum committed
644

645
    | Command.UPDATE_FEAT (tar_cn,tar_feat_name, item_list) ->
bguillaum's avatar
bguillaum committed
646
        let tar_gid = node_find tar_cn in
647 648
        let rule_items = List.map
            (function
bguillaum's avatar
bguillaum committed
649 650
              | 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
651
              | Command.Param_out index ->
bguillaum's avatar
bguillaum committed
652 653
                  (match matching.m_param with
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
654
                  | Some param -> Concat_item.String (Lex_par.get_command_value index param))
bguillaum's avatar
bguillaum committed
655
              | Command.Param_in index ->
bguillaum's avatar
bguillaum committed
656
                  (match matching.m_param with
657
                  | None -> Error.bug "Cannot apply a UPDATE_FEAT command without parameter"
bguillaum's avatar
bguillaum committed
658
                  | Some param -> Concat_item.String (Lex_par.get_param_value index param))
659
            ) item_list in
660

bguillaum's avatar
bguillaum committed
661
        let (new_graph, new_feature_value) =
662
          G_graph.update_feat ~loc instance.Instance.graph tar_gid tar_feat_name rule_items in
bguillaum's avatar
bguillaum committed
663
        (
664 665
         {instance with
          Instance.graph = new_graph;
666
          history = List_.sort_insert (Command.H_UPDATE_FEAT (tar_gid,tar_feat_name,new_feature_value)) instance.Instance.history
bguillaum's avatar
bguillaum committed
667
        },
bguillaum's avatar
bguillaum committed
668
         (created_nodes, activated_nodes)
669
        )
670 671 672 673

    | Command.DEL_FEAT (tar_cn,feat_name) ->
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
674
         {instance with
675
          Instance.graph = G_graph.del_feat instance.Instance.graph tar_gid feat_name;
676
          history = List_.sort_insert (Command.H_DEL_FEAT (tar_gid,feat_name)) instance.Instance.history
677
        },
bguillaum's avatar
bguillaum committed
678
         (created_nodes, activated_nodes)
bguillaum's avatar
bguillaum committed
679
        )
680 681

    | Command.NEW_NEIGHBOUR (created_name,edge,base_pid) ->
682 683
        let base_gid = Pid_map.find base_pid matching.n_match in
        let (new_gid,new_graph) = G_graph.add_neighbour loc instance.Instance.graph base_gid edge in
684
        (
bguillaum's avatar
bguillaum committed
685
         {instance with
686
          Instance.graph = new_graph;
687 688
          history = List_.sort_insert (Command.H_NEW_NEIGHBOUR (created_name,edge,new_gid)) instance.Instance.history;
          activated_node = new_gid :: instance.Instance.activated_node;
689
        },
bguillaum's avatar
bguillaum committed
690 691 692 693 694 695 696 697 698 699 700 701
         ((created_name,new_gid) :: created_nodes, activated_nodes)
        )

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

705 706 707 708
    | Command.SHIFT_IN (src_cn,tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
709 710
         {instance with
          Instance.graph = G_graph.shift_in loc instance.Instance.graph src_gid tar_gid;
711
          history = List_.sort_insert (Command.H_SHIFT_IN (src_gid,tar_gid)) instance.Instance.history
712
        },
bguillaum's avatar
bguillaum committed
713
         (created_nodes, activated_nodes)
714 715 716 717 718 719
        )

    | Command.SHIFT_OUT (src_cn,tar_cn) ->
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
bguillaum's avatar
bguillaum committed
720 721
         {instance with
          Instance.graph = G_graph.shift_out loc instance.Instance.graph src_gid tar_gid;
722
          history = List_.sort_insert (Command.H_SHIFT_OUT (src_gid,tar_gid)) instance.Instance.history
723
        },
bguillaum's avatar
bguillaum committed
724
         (created_nodes, activated_nodes)
725 726
        )

bguillaum's avatar
bguillaum committed
727
    | Command.SHIFT_EDGE (src_cn,tar_cn) ->
728 729 730
        let src_gid = node_find src_cn in
        let tar_gid = node_find tar_cn in
        (
731 732 733 734
          {instance with
            Instance.graph = G_graph.shift_edges loc instance.Instance.graph src_gid tar_gid;
            history = List_.sort_insert (Command.H_SHIFT_EDGE (src_gid,tar_gid)) instance.Instance.history
          },
bguillaum's avatar
bguillaum committed
735
          (created_nodes, activated_nodes)
736
        )
pj2m's avatar
pj2m committed
737

bguillaum's avatar
bguillaum committed
738 739 740
  (*  ---------------------------------------------------------------------- *)
  (** [apply_rule instance matching rule] returns a new instance after the application of the rule
      [Command_execution_fail] is raised if some merge unification fails *)
bguillaum's avatar
bguillaum committed
741
  let apply_rule instance matching rule =
pj2m's avatar
pj2m committed
742

bguillaum's avatar
bguillaum committed
743 744 745
    (* Timeout check *)
    (try Timeout.check () with Timeout.Stop -> Error.run "Time out");

746 747
    (* limit the rewriting depth to avoid looping rewriting *)
    begin
bguillaum's avatar
bguillaum committed
748
      if List.length instance.Instance.rules >= !max_depth
749 750
      then Error.run "Bound reached (when applying rule %s)" rule.name
    end;
bguillaum's avatar
bguillaum committed
751

752
    let (new_instance, created_nodes) =
bguillaum's avatar
bguillaum committed
753
      List.fold_left
754 755
        (fun (instance, created_nodes) command ->
          apply_command command instance matching created_nodes
bguillaum's avatar
bguillaum committed
756
        )
bguillaum's avatar
bguillaum committed
757
        (instance, ([],[]))
758 759
        rule.commands in

760
    let rule_app = {
761
      Libgrew_types.rule_name = rule.name;
762
      up = up_deco rule matching;
763 764
      down = down_deco (matching,created_nodes) rule.commands
    } in
pj2m's avatar
pj2m committed
765

bguillaum's avatar
bguillaum committed
766
    {new_instance with
767 768
      Instance.rules = rule.name :: new_instance.Instance.rules;
      big_step = match new_instance.Instance.big_step with
769 770
        | None -> Some { Libgrew_types.first = rule_app; small_step = [] }
        | Some bs -> Some { bs with Libgrew_types.small_step = (instance.Instance.graph, rule_app) :: bs.Libgrew_types.small_step }
771
    }
pj2m's avatar
pj2m committed
772

bguillaum's avatar
bguillaum committed
773
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
774
  let update_partial pos_graph without (sub, already_matched_gids) =
775
    let neg_graph = without.graph in
bguillaum's avatar
bguillaum committed
776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795
    let unmatched_nodes =
      Pid_map.fold
        (fun pid _ acc -> match pid with Pid.Neg _ -> pid::acc | _ -> acc)
        neg_graph [] in
    let unmatched_edges =
      Pid_map.fold
        (fun pid node acc ->
          match pid with
            | Pid.Neg _ -> acc
            | Pid.Pos i ->
          (* if pid < 0  *)
          (* then acc *)
          (* else  *)
              Massoc_pid.fold
                (fun acc2 pid_next p_edge -> (pid, p_edge, pid_next) :: acc2)
                acc (P_node.get_next node)

            (* Massoc.fold_left  *)
            (*   (fun acc2 pid_next p_edge -> (pid, p_edge, pid_next) :: acc2) *)
            (*   acc (P_node.get_next node) *)
796
        ) neg_graph [] in
797 798 799 800 801 802 803
    {
     sub = sub;
     unmatched_nodes = unmatched_nodes;
     unmatched_edges = unmatched_edges;
     already_matched_gids = already_matched_gids;
     check = without.constraints;
   }
bguillaum's avatar
bguillaum committed
804

pj2m's avatar
pj2m committed
805

bguillaum's avatar
bguillaum committed
806
  (*  ---------------------------------------------------------------------- *)
807 808
  let fulfill (pos_graph,neg_graph) graph new_partial_matching  =
    match extend_matching (pos_graph, neg_graph) graph new_partial_matching with
bguillaum's avatar
bguillaum committed
809
    | [] -> true (* the without basic in not found -> OK *)
bguillaum's avatar
bguillaum committed
810
    | x -> false
pj2m's avatar
pj2m committed
811 812


bguillaum's avatar
bguillaum committed
813 814 815 816
  (* ================================================================================ *)
  (* ================================================================================ *)
  (* ================================================================================ *)
  (* ================================================================================ *)
bguillaum's avatar
bguillaum committed
817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838
  let match_in_graph rule graph =
    let pos_graph = rule.pos.graph in

    (* get the list of partial matching for positive part of the pattern *)
    let matching_list =
      extend_matching
        (pos_graph,P_graph.empty)
        graph
        (init rule.param rule.pos) in

    let filtered_matching_list =
      List.filter
        (fun (sub, already_matched_gids) ->
          List.for_all
            (fun without ->
              let neg_graph = without.graph in
              let new_partial_matching = update_partial pos_graph without (sub, already_matched_gids) in
              fulfill (pos_graph,neg_graph) graph new_partial_matching
            ) rule.neg
        ) matching_list in

    List.map fst filtered_matching_list
bguillaum's avatar
bguillaum committed
839 840 841 842
  (* ================================================================================ *)
  (* ================================================================================ *)
  (* ================================================================================ *)
  (* ================================================================================ *)
bguillaum's avatar
bguillaum committed
843 844


bguillaum's avatar
bguillaum committed
845
  (*  ---------------------------------------------------------------------- *)
bguillaum's avatar
bguillaum committed
846
  (** [one_step instance rules] computes the list of one-step reduct with rules *)
847
  let one_step instance rules =
bguillaum's avatar
bguillaum committed
848 849
    List.fold_left
      (fun acc rule ->
bguillaum's avatar
bguillaum committed
850
        let matching_list = match_in_graph rule instance.Instance.graph in
bguillaum's avatar
bguillaum committed
851 852

        List.fold_left
bguillaum's avatar
bguillaum committed
853
          (fun acc1 matching ->
bguillaum's avatar
bguillaum committed
854
            try (apply_rule instance matching rule) :: acc1
bguillaum's avatar
bguillaum committed
855 856
            with Command_execution_fail -> acc1
          ) acc matching_list
bguillaum's avatar
bguillaum committed
857
      ) [] rules
pj2m's avatar
pj2m committed
858

bguillaum's avatar
bguillaum committed
859 860
  (*  ---------------------------------------------------------------------- *)
  (** [conf_one_step instance rules] computes one Some (one-step reduct) with rules, None if no rule apply *)
861 862 863 864 865 866
  let rec conf_one_step (instance : Instance.t) = function
    | [] -> None
    | rule::rule_tail ->
        let pos_graph = rule.pos.graph in

        (* get the list of partial matching for positive part of the pattern *)
bguillaum's avatar
bguillaum committed
867 868 869 870
        let matching_list =
          extend_matching
            (pos_graph,P_graph.empty)
            instance.Instance.graph
bguillaum's avatar
bguillaum committed
871
            (init rule.param rule.pos) in
bguillaum's avatar
bguillaum committed
872 873

        try
874 875 876
          let (first_matching_where_all_witout_are_fulfilled,_) =
            List.find
              (fun (sub, already_matched_gids) ->
bguillaum's avatar
bguillaum committed
877 878
                List.for_all
                  (fun without ->
879 880 881 882 883 884 885
                    let neg_graph = without.graph in
                    let new_partial_matching = update_partial pos_graph without (sub, already_matched_gids) in
                    fulfill (pos_graph,neg_graph) instance.Instance.graph new_partial_matching
                  ) rule.neg
              ) matching_list in
          Some (apply_rule instance first_matching_where_all_witout_are_fulfilled rule)
        with Not_found -> (* try another rule *) conf_one_step instance rule_tail