False. For example, a language might allow x+1, which is three lexemes. The usual rule for breaking a program into lexemes is that the compiler finds the longest prefix of what is left that is an allowed lexeme (after skipping over inter-lexeme space).