anchor.diff:  	ok -> case  catch call_port({get, MinLength, MinClones, OutFileName}) of
   		  {ok, _Res} ->
   		      ?debug("Initial clones are calculated using C suffixtree implementation.\n", []),
  +		      stop_suffix_tree_clone_detector(),
   		      {ok, [Cs]} = file:consult(OutFileName),
   		      file:delete(OutFileName),
   		      {Toks, Cs};
  
positive.code: 							   Toks31= lists:takewhile(fun(T)-> token_loc(T) =< EndLoc end, Toks3),
  							   NewLen = length(Toks31),
  							   case NewLen >=MinLength of 
  							       true ->  NewRange = trim_range(tl(Range), {Len1, Len2}),
  									{StartLn, StartCol} = StartLoc,
  									{EndLn, EndCol} = EndLoc,
  									[{[{{File1, StartLn, StartCol}, {File1, EndLn, EndCol}}|NewRange], NewLen, F}];
  							       false -> []
  							   end
  						   end,
  					      lists:append(lists:map(Fun2, Units));
  
negative.code:     end.
  	    				
  
  
  pos_to_syntax_units(Tree, {Start,{EndLine, EndCol}}) ->    
      %% The next expression is only a quick fix;
      %% EndCol currently refers to the start loc of a token, 
      %% but to be correct, it should be the end loc of the token.
      ExprOrFuns = refac_util:pos_to_syntax_units(Tree, Start, {EndLine, EndCol+5}, fun is_expr_or_fun/1),
      case ExprOrFuns of 
  	[] -> [];
  	_ -> [ExprOrFuns]
      end.
  
  
  is_expr_or_fun(Node) ->
      case refac_syntax:type(Node) of 
  	function -> true;
  	_ -> refac_util:is_expr(Node) 
      end.
  
  
  %% =====================================================================
  %% get the alphabet on which the suffix tree is going to be built.
  alphabet() ->
  