2 ms·

I assume you're saying that the regular expressions used are likely to be equivalent to a DFA? If so, I agree, that's very likely, and I was also thinking about

I assume you're saying that the regular expressions used are likely to be equivalent to a DFA? If so, I agree, that's very likely, and I was also thinking about that. I believe Go's regex engine is built on RE2 though, so idk.

taeric 6y ago
Essentially, yes. My point is if you implemented the dfa directly, then you could just iterate all the characters doing whatever the current state of the automata says to do at each character.