anchor.diff:  			  case refac_syntax:block_expr_body(E) of
   			      BlockBody ->
   				  BlockBody;
  +			      _ -> [E]
  +			  end;
  +		      match_expr ->
  +			  Ps = match_expr_patterns(E),
  +			  B =  match_expr_body(E),
  +			  case refac_syntax:type(B) of 
  +			      block_expr ->
  +				  case refac_syntax:block_expr_body(B) of 
  +				      BlockBody ->
  +					  Last = lists:last(BlockBody),
  +					  NewLast = refac_util:reset_attrs(make_match_expr(Ps, Last)),
  +					  lists:sublist(BlockBody, length(BlockBody)-1)++[NewLast];
  +				      _ -> [E]
  +				  end;
   			      _ -> [E]
   			  end;
   		      _ -> [E]
  
positive.code:     {value, {module, ModName}} = lists:keysearch(module, 1, Info),
      case pos_to_fun_clause_app(AnnAST, Pos) of
  	{ok, {Clause, App}} -> 
  	    {ok, {FunClause, Subst}} = side_cond_analysis(ModName, AnnAST, {Clause, App}),
  	    fun_inline_1(FName, AnnAST, Pos, {FunClause, Subst}, {Clause, App}, Editor);
  	{error, Reason} -> throw({error, Reason})
      end.
      
  
  side_cond_analysis(ModName, AnnAST, {Clause, App}) ->
      FunName = refac_syntax:atom_value(refac_syntax:application_operator(App)),
      Args = refac_syntax:application_arguments(App),
      Arity = length(Args),
  
negative.code: pos_to_fun_app_1(Node, Pos) ->
      case refac_syntax:type(Node) of
  	application ->
  	    Op = refac_syntax:application_operator(Node),
  	    {S, E} = refac_util:get_range(Op),
  	    if (S =< Pos) and (Pos =< E) ->
  		    {Node, true};
  	       true -> {[], false}
  