What is considered the gold standard in error recovery mechanisms for PEG parsers these days?
My understanding is that most parser implementers have given up on finding a robust generic error recovery algorithm, and they rely on grammar rules being tagged with recovery points, such as the terminals that match semicolons, closing braces/parents, newlines, etc. -- and that the parser just skips forward until the first recovery symbol is reached. Is this accurate?
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
