> It's trivial to replace the stack usage with a data structure.
Interesting. Do you have any examples of that, reading the article actually had me thinking how that would be achieved.
Re:Challenging LR Parsing
by flashmozzg on Wednesday September 23, 2020 @10:42AM
(#24567653)
You could trivially (or rather, mechanically) emulate HW bounded stack with a heap-based stack collection (like std::stack).
Also, a significant number of successful parsers have used recursion. As long as you successfully handle stack overflow and only hit it on pathological inputs, it works reasonably well.