If the input stream has been separated into tokens up to a given character, the next token is the longest string of characters that could constitute a token.

• 如果到某一个为止的输入流被分割成若干记号，那么，下一个记号就是后续字符序列中可能构成记号的最长的字符串。