Recursion based implementation of parsers in languages with limited stack size is a programmer mistake.

All languages have limited stack size.

Eh... not really if you're referring to call stacks. Rust at one point had growable stacks. That was removed for performance reasons. Haskell with GHC kind of has growable stacks (basically IIRC most function calls occur on the heap) and its stack overflows take a different form. SML I think at one point also had an implementation with a growable call stack.

I guess this is a nitpick of limited vs. fixed. Even if you grow the stack, at some point you can't grow anymore.

If by limited you mean limited by the amount of memory your machine has then yes it's limited, but I don't think that's what parent was getting at, since in that sense everything about a computer is limited.