4 ms·
There is no recursion involved in parsing. You keep a stack for the tree.
by fatih-erikli-cg 2y ago
There is no recursion involved in parsing. You keep a stack for the tree.
- bonzini 2y agoRecursive descent uses the processor stack as the parsing stack.
- fatih-erikli-cg 2y agoRecursion is mostly involved in interpreter, and most of the time it is a bad practice. No recursion needed in parser.
- bonzini 2y agoDunning-Krueger effect at its best, I am done arguing.