Message from JavaScript discussions
August 2017
— If my gitlab wasn't down I would show
What it does is build a compiler out of automata, complete with lexing, parsing, and pushdown system... The automata are used in all 3
— A grammar production can be made using all 3 together, which can implement full context closures
— All the automata are is basic building blocks
— I don't disagree, I'm just saying you can't parse all valid JS regex into a DFA
— Anyway this discussion was a really long way of saying that you regex compare function can't take all regexes heh.
— If it was as complex as the compiler compiler it could, is what I was saying haha
— Was a nice discussion though
— Oh yeah right okay
— But then of course, the comparison wouldn't be by DFA
— That's actually interesting too, you'd basically be comparing two Turing machines. I wonder what that implies CS-wise
— Hmmm! Sounds like a nice big present for an ultranerd