perf/safety: convert parseStr from recursive to iterative to prevent stack overflow

Problem

parseStr in Lck/Json/Tokenizer.lean is written as a recursive CPS function. While the continuation wrapping is proven zero-cost at runtime (proofs are erased), the recursion itself is structural on the input — meaning for a string literal of length n, the Lean runtime creates n stack frames.

For pathologically large string values this can overflow the stack.

Expected fix

Rewrite parseStr as an iterative (tail-recursive or explicit loop) accumulator, maintaining the same CPS interface for callers. The proof structure can be adapted to use an inductive invariant on the loop state.

References

• Flagged by AI code review on PR #8

Inizia in Lck/Json/Tokenizer.lean, all’implementazione CPS ricorsiva di parseStr, quindi esamina in che modo i chiamanti dipendono dalla sua interfaccia CPS. Riscrivi l’analisi delle stringhe come un accumulatore iterativo preservando tale interfaccia, adatta la dimostrazione intorno a un invariante induttivo del ciclo e verifica che i letterali stringa di grandi dimensioni non rischino più di causare uno stack overflow.