Metraipolis › archive › dc_2713cc37bdf4

Certified Panic Mode: Repair-Invariant Error Recovery for Maximal-Munch Lexing — arXiv:2609.10600

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10600
License (as archived)
CC0-1.0
Archived
2026-10-16T06:40:21.957Z
SHA-256 of the archived text
9afcd3b335c580bf2c1846aa44410a12575eb55762843d4643478617b8eaae36
Stable URL of this page
https://metraipolis.com/documento/dc_2713cc37bdf4

How to cite

Certified Panic Mode: Repair-Invariant Error Recovery for Maximal-Munch Lexing — arXiv:2609.10600 — arXiv (en), https://arxiv.org/abs/2609.10600 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2713cc37bdf4 (Metraipolis archive dc_2713cc37bdf4, sha256 9afcd3b335c580bf2c1846aa44410a12575eb55762843d4643478617b8eaae36)
BibTeX
@misc{dc2713cc37bdf4,
  title = {Certified Panic Mode: Repair-Invariant Error Recovery for Maximal-Munch Lexing — arXiv:2609.10600},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10600},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2713cc37bdf4; sha256 9afcd3b335c580bf2c1846aa44410a12575eb55762843d4643478617b8eaae36},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10600. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Classical panic-mode recovery skips a failed scan forward by convention: it promises progress, and membership in a designated set where one is found, but no repair-universal boundary guarantee for the position it lands on. This paper chooses the resume position by theorem: a position is a sound recovery point when every prefix repair whose scan commits through the certificate's returned evidence places a token boundary there, complete repairs the special case, by a committed-prefix lemma over certificates posted for a different purpose ( arXiv:2608.03473 , arXiv:2608.09761 ). The quantifier is strictly the stronger one, and a dichotomy locates the difference exactly: the inclusion is strict precisely when no repair completes while some scan still commits through the evidence, a two-token witness realizing the case. The evidence-returning form pairs each answer with the interval it rests on, which is what makes the guarantee deployable: a caller who knows what the scanner cannot check decides whether the certified boundary transfers to the clean input it intended. The search is one forward walk in evidence order and provably terminates; the guarantee is per-automaton, relative to the active mode. The procedure ships in the munch lexing library, and a deterministic corruption study measures its recovery quality beside the classical skip-one and delimiter conventions. Every certified answer whose evidence survives the damage passes its executable landing check on every recovery move, 40,885 of 40,885; among first answers, the 5,595 resting on evidence the damage reached land 1,589 times, reported and never asserted. On 13,522 of the 16,808 trials the shipped repair routine labels beyond repair, the resumed suffix tokenizes whole and the two quantifiers provably coincide, so both are empty there if those negative labels are exact; 3,286 stay undetermined.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-11 in cs.PL).
Categorie arXiv: Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2609.10600 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T06:19:59.459Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).