anchor.diff:  	      case application_info(Tree) of 
   		  {{none, FunName}, Arity} ->
   		      Exp1 = refac_util:update_ann(Exp, {range, {0, 0}}),
  -		      Arguments1 = [Exp1 | Arguments],
  +		      Arguments1 = Arguments ++ [Exp1],
   		      {refac_syntax:copy_attrs(Tree, refac_syntax:application(Operator, Arguments1)), true}; 
   		  {{ModName, FunName}, Arity} ->
   		      Exp1 = refac_util:update_ann(Exp, {range, {0,0}}),
  -		      Arguments1 = [Exp1 | Arguments],
  +		      Arguments1 = Arguments ++ [Exp1],
   		      {refac_syntax:copy_attrs(Tree, refac_syntax:application(Operator, Arguments1)), true};
   		  {{_, apply},2} ->
  -		       F = lists:nth(1, Arguments),
  -		       T = lists:nth(2, Arguments),
  -		       case refac_syntax:type(F) of 
  +		      F = lists:nth(1, Arguments),
  +		      T = lists:nth(2, Arguments),
  +		      case refac_syntax:type(F) of 
   			   implicit_fun ->
   			      Name = refac_syntax:implicit_fun_name(F),
   			      B = refac_syntax:atom_value(refac_syntax:arity_qualifier_body(Name)),
  
positive.code: 			  Pats = refac_syntax:clause_patterns(C),
  			  G =  refac_syntax:clause_guard(C),
  			  Op = refac_syntax:operator(Name),    
  			  Args = [Expr | Pats],
  			  Body = [refac_syntax:application(Op, Args)],
  			  refac_syntax:clause(Pats, G, Body)
  		  end,
  
negative.code: 						  Arity ->
  						      Exp1 =refac_util:update_ann(Exp, {range, {0,0}}),
  						      Args1 =refac_syntax:copy_attrs(Args, 
  										     refac_syntax:list(refac_syntax:list_elements(Args) ++[Exp1])),
  						      {refac_syntax:copy_pos(Tree, (refac_syntax:copy_attrs(Tree, 
  							refac_syntax:application(Operator, [Mod, Fun, Args1])))), true};
  						 _ -> {Tree, true}
  