lean-parsing-completeness

Parsing completeness in Lean is proven by generating proof patterns that verify parsing functions return `.ok` for well-formed inputs, ensuring position bounds and eliminator lemmas are correctly established for monadic parsing steps.

Eliminator lemmas in Lean parser verification are proven patterns that break down monadic parsing steps, allowing you to establish position bounds and verify that parsing functions handle spec-level success correctly for well-formed inputs.

To verify position bounds in Lean parser correctness, you apply generated proof patterns and techniques that ensure parsing functions track positions accurately and return `.ok` results for all well-formed inputs throughout the monadic parsing steps.

You need to prove parsing completeness theorems when verifying a parser's correctness in Lean, specifically to ensure the parsing function behaves as expected and returns `.ok` for all valid, well-formed inputs.

Yes, generated proof patterns verify that a Lean parsing function handles spec-level success correctly by proving the function returns `.ok` for well-formed input and by establishing eliminator lemmas for monadic parsing steps.