feat: protect the parser against stack overflows

As the parser uses recursive functions while producing the AST, we must limit the depth of the AST tree to some reasonable amount in order to avoid stack overflows.