anchor.diff:  				     end.
   
   
  -get_clones_by_suffix_tree(Dir, ProcessedToks,MinLength, MinClones, Alphabet) ->
  +get_clones_by_suffix_tree(Dir, ProcessedToks,MinLength, MinClones, Alphabet, AllowOverLap) ->
       start_suffix_tree_clone_detector(),
       OutFileName = filename:join(Dir, "wrangler_suffix_tree"), 
       case file:write_file(OutFileName, ProcessedToks) of 
  -	ok -> case  catch call_port({get, MinLength, MinClones, OutFileName}) of
  +	ok -> case  catch call_port({get, MinLength, MinClones, AllowOverLap, OutFileName}) of
   		  {ok, _Res} ->
   		      ?debug("Initial clones are calculated using C suffixtree implementation.\n", []),
   		      stop_suffix_tree_clone_detector(),
  
positive.code: 		catch
  		    Val -> Val;
  		      _:_ -> throw({error, "Parameter input is invalid."})
  		end,c
          %% By 'MinClones', I mean the minimal number of members in a clone class,
      %% therefore it should be one more than the number of times a piece of code is cloned.
      MinClones = try 
  
negative.code: 	_  -> {0, AWSS}
      end.
  
  post_process_suffix_tree(Tree, AllowOverLap) ->
      NewTree1 = lists:map(fun(B) ->add_frequency(B) end, Tree),
      lists:map(fun(B)->extend_range(B, AllowOverLap) end, NewTree1).
  
  
  % =====================================================================
  