How does Acorn handle Node's recursion limit with its recursive-descent parser

Currently building a parser myself, and Node’s recursion limit seems to get in the way almost all the time. How does Acorn deal with this?

Never been a problem, since the recursion limit is rather large. You could probably construct an input file that causes the parser to exceed it (about 2000 open parens seem to do it), but we haven’t run into actual real-world programs where this causes an issue.