Commit d65adfc1 authored by bguillaum's avatar bguillaum

version 0.24.0

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/semagramme/libcaml-grew/trunk@8461 7838e531-6607-4d57-9587-6c381814729c
parent 056b2165
......@@ -169,9 +169,9 @@ module Rule = struct
and (node_name2, feat_name2) = qfn2 in
Feature_ineq (ineq, pid_of_name loc node_name1, feat_name1, pid_of_name loc node_name2, feat_name2)
let build_neg_basic ~pat_vars ?(locals=[||]) pos_table basic_ast =
let build_neg_basic ?pat_vars ?(locals=[||]) pos_table basic_ast =
let (extension, neg_table) =
P_graph.build_extension ~pat_vars ~locals pos_table basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
P_graph.build_extension ?pat_vars ~locals pos_table basic_ast.Ast.pat_nodes basic_ast.Ast.pat_edges in
let filters = Pid_map.fold (fun id node acc -> Filter (id, P_node.get_fs node) :: acc) extension.P_graph.old_map [] in
{
......@@ -826,10 +826,7 @@ module Rule = struct
| [] -> true (* the without pattern in not found -> OK *)
| _ -> false
(* ================================================================================ *)
(* ================================================================================ *)
(* ================================================================================ *)
(* ================================================================================ *)
(* ---------------------------------------------------------------------- *)
let match_in_graph ?param (pos, negs) graph =
let pos_graph = pos.graph in
......@@ -852,11 +849,6 @@ module Rule = struct
) matching_list in
List.map fst filtered_matching_list
(* ================================================================================ *)
(* ================================================================================ *)
(* ================================================================================ *)
(* ================================================================================ *)
(* ---------------------------------------------------------------------- *)
(** [one_step instance rules] computes the list of one-step reduct with rules *)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment