4 ms·
A recursive descent parser to convert between A and B is trivial. But there are implementation details of functions vs code writing macros that are important.
by ohyes 9y ago
A recursive descent parser to convert between A and B is trivial.
But there are implementation details of functions vs code writing macros that are important. This is not about syntax at all.
- kerkeslager 9y agoIf recursive descent parsers are so trivial, why do we have so many DSLs to generate parsers? :P Also, a recursive descent parser isn't going to spit out an AST that matches the needed NFA/DFA, so there's going to be a transformation step needed.