Thank you very much for the help.
When a stack overflow exception is thrown, does the parser restart from the grammar start symbol or from its current state?
Also (I suppose this is also relevant to my other question at Why does this input generate no error?) is there a way to tell error nodes that indicate that the input does not match the grammar (when there is no transition in the table for some input token), from error nodes that are inserted in case of an exception or, as in the referenced post, when the parser restarts because there is more input?