anchor.diff:  		revert_list_comp(Node);
   	     match_expr -> 
   		revert_match_expr(Node);
  +             named_fun_expr ->
  +                revert_named_fun_expr(Node);
   	     module_qualifier -> 
   		revert_module_qualifier(Node);
   	     nil -> 
  
positive.code:       {'catch', _, _} -> catch_expr;
        {'cond', _, _} -> cond_expr;
        {'fun', _, {clauses, _}} -> fun_expr;
        {'fun', _, {function, _, _}} -> implicit_fun;
        {'fun', _, {function, _, _, _}} -> implicit_fun;   %% Added by Huiqing Li			      
        {'if', _, _} -> if_expr;
        {'receive', _, _, _, _} -> receive_expr;
        {'receive', _, _} -> receive_expr;
  
negative.code:     size_qualifier(N, A);
  make_tree(try_expr, [B, C, H, A]) ->
      try_expr(B, C, H, A);
  make_tree(map, [E]) -> map(E);
  make_tree(map_field_assoc, [E]) -> map_field_assoc(E);
  make_tree(map_field_exact, [E]) -> map_field_exact(E);
  make_tree(tuple, [E]) -> tuple(E);
  make_tree(empty_node, []) -> empty_node(). 
  
  