35 ms·
My guess is your "fundamentally regular expressions" is, in fact "fundamentally an automata". Which, my guess is even this article could have used an automata
by taeric 6y ago
My guess is your "fundamentally regular expressions" is, in fact "fundamentally an automata". Which, my guess is even this article could have used an automata such that they are basically lexing the data they are using over.
- staticassertion 6y agoI 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 agoEssentially, 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.
- nemoniac 6y ago"Automata" is plural. Its singular is "automaton".