 The set of LL("k") languages is properly contained in that of LL("k"+1) languages, for each "k" ≥ 0.A corollary of this is that not all context-free languages can be recognized by an LL("k") parser.An LL parser is called an LL("*"), or LL-regular, parser if it is not restricted to a finite number "k" of tokens of lookahead, but can make parsing decisions by recognizing whether the following tokens belong to a regular language (for example by means of a deterministic finite automaton).