There is no recursion involved in parsing. You keep a stack for the tree. | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		fatih-erikli-cg on Nov 9, 2024 \| parent \| context \| favorite \| on: IronCalc – Open-Source Spreadsheet Engine There is no recursion involved in parsing. You keep a stack for the tree.

bonzini on Nov 10, 2024 [–]

Recursive descent uses the processor stack as the parsing stack.

fatih-erikli-cg on Nov 10, 2024 | [–]

Recursion is mostly involved in interpreter, and most of the time it is a bad practice. No recursion needed in parser.

bonzini on Nov 10, 2024 | | [–]

Dunning-Krueger effect at its best, I am done arguing.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact