3 ms·
Aren’t regular expressions the abstraction to state machines? They all get converted to a DFA or NFA, no?
by morby 3y ago
Aren’t regular expressions the abstraction to state machines? They all get converted to a DFA or NFA, no?
- dunk010 3y agoExactly. The languages in the article are nothing of the sort.
- kbenson 3y agoYes, and I said as much. All DSLs are abstractions to some sort of code that does some action. What I'm saying is that we have examples of bad DSLs, and good DSLs, and perhaps by focusing between them we can come up with some useful information about what distinguishes one from the other. To me, that's a much more interesting (and useful!) discussion than just piling onto the DSLs are awful bandwagon, and I also think it's a flaw in any argument put forth in that argument that needs to be addresses before I can accept it.