anchor.diff:  	    
   	    %% Include L, while preserving Min =< Max.
   	    tree_node(minpos(L, Min),
  -		      max(L, Max),
  +		      lists:max([L, Max]),
   		      refac_syntax:type(Node),
   		      refac_syntax:get_attrs(Node),
   		      Subtrees)
  
positive.code: node_max(#list{max = Max}) ->
      Max.
  
  %% node_kill_range(Node) ->
  %%     case Node of
  %% 	#leaf{} ->
  
negative.code: 	{_, L, _} when is_integer(L) ->
  	    L;
  	Pos ->
  	    exit({bad_position, Pos})
      end.
  
  