You don't compute an end state, you compute a transition table. For each character you parse you look up the corresponding table and then you compose them. Her

You don't compute an end state, you compute a transition table. For each character you parse you look up the corresponding table and then you compose them. Here is a paper on how to do this efficiently with simd instructions https://www.microsoft.com/en-us/research/publication/data-parallel-finite-state-machines/ https://www.microsoft.com/en-us/research/publication/data-pa...