4 ms·
using recursive descent, you don't need to build an ast
by zabzonk 3y ago
using recursive descent, you don't need to build an ast
- jjtheblunt 3y agothe call stack during recursive descent is an ephemeral ast, for the recursive descent parsers I've written.
- hedora 3y agoThat implies the memory usage is proportional to the depth of the AST, not the total size (which is the point, I think).
- pjmlp 3y agoOnly if the compiler doesn't do anything beyond basic peephole optimizations.