pre-compute lexer DFA states for large regexes

[mmoskal]

For lexemes with large regexes (eg very large enums from JSON schema) we could run mock computation of mask on the tokenizer to pre-compute a bunch of lexer states. Otherwise, the first time we compute that mask there is cost. For 2k 50 byte enum entries it's about 4ms.