anchor.diff:  	     true -> [Tree];
   	     _ ->
   		 Ts = refac_syntax:subtrees(Tree),
  -		 R0 = [[pos_to_syntax_units_1(T, Start, End, F) || T <- G]
  +                 R0 = [[pos_to_syntax_units_1(T, Start, End, F) || T <- G]
   		       || G <- Ts],
   		 lists:append(R0)
   	   end;
          (S > End) or (E < Start) -> [];
          (S < Start) or (E > End) ->
   	   Ts = refac_syntax:subtrees(Tree),
  +	   %% io:format("Ts1:\n~p\n", [Ts]),
   	   R0 = [[pos_to_syntax_units_1(T, Start, End, F) || T <- G]
   		 || G <- Ts],
   	   lists:append(R0);
  
positive.code: 	  case C of
  	      expression -> true;
  	      guard_expression -> true;
  	      %% since macros are not expanded;
  	      %% Not really what I want.
  	      macro -> true; 
  
negative.code: 	     [[syntaxTree()]]).
  pos_to_syntax_units(FileName, Tree, Start, End, F, TabWidth) ->
      Res = pos_to_syntax_units_1(Tree, Start, End, F),
      %% io:format("StartEnd:\n~p\n", [{Start, End}]),
  %%     io:format("Res:\n~p\n", [Res]),
      Res1 = filter_syntax_units(Res),
     %% io:format("Res1:\n~p\n", [Res1]),
      Units = case length(Res1)=<1 of 
  		true ->
  		    [Res1];
  