All translations
Enter a message name below to show all available translations.
Found one translation.
| Name | Current message text |
|---|---|
| h English (en) | Then the Lexer will generate the token TOKEN for lexemes matching the given regular expression. Which token will be chosen if there are multiple options? We use the ''first longest match'' rule: It will take the longest possible match (eating as many characters as possible), if there are multiple of those matches, it will take the first one. |