The very bad solution is to check if I got the exact same input state back - such efficiency!
I think what I want to do for many reasons is build a little consumption machine and rework everything in terms of it
Started hacking up a parsing applicative in Agda as an exercise, have got most of it sorted but run smack into an issue I know a very bad solution to and some more sensible approaches
Haskell wouldn't do this one to me, but it'd screw me over when I used it instead: trying a non-consuming parser many times
Executively dysfunctional, yet occasionally effectful programmer. Crazy trans dyke. Dealing with a serious case of Information Awareness.