Tag
finite-automata
- Nov 16, 2025 Maximal Munch and the Boundary Between Tokens How a lexer decides where one token ends, why the longest-match rule is separate from the grammar, and which token sequences it produces that the source text does not appear to contain. compilers
- Sep 17, 2023 From Regular Expression to DFA Table: Inside a Lexer Generator Thompson construction, subset construction, and table compression, and why a generated lexer scans in time linear in the input no matter how many patterns were declared. compilers