This post describes a library design for resilient recursive parsing that enables parsers to recover from errors and continue parsing, useful for IDE features like auto-completion. The approach extends combinator libraries like nom with greedy error recovery that skips forward to resume parsing, while maintaining minimal runtime overhead during error-free parsing and requiring modest changes to parser logic.