code: public boolean check(final char c)
  	{
  
  		List<LetterNode<V>> newList = new ArrayList<LetterNode<V>>();
  		newList.add(root);
  
  		LetterNode<V> current;
  		hits.clear();
  
  		int size = this.currentList.size();
  		for (int i = 0; i < size; i++) {
  			current = this.currentList.get(i);
  
  			current = current.get(c);
  			if (current != null) {
  				newList.add(current);
  
  				if (current.isKeyword()) {
  					hits.add(current);
  				}
  			}
  		}
  
  		this.currentList = newList;
  		return !hits.isEmpty();
  	}
docs: Checks whether the character is related to one of the current nodes (the
  root node is always a current node).
  
  After the comparison the list of current nodes will be replaced.
  
  @param c
  character
  @return TRUE if successor nodes could be identified FALSE otherwise