Parser is quite confusing and needs cleanup.

[AiredaleDev]

Presently, I find it difficult to predict weird side-effects I make to the algorithm. I think my confusion while writing it comes through to anyone reading it.

I think I just got tunnel-vision on "completing it at all costs," which prevented me from taking a step back and seeing the more obvious problems with the implementation. The main right now is that expressions that require matching multiple tokens (like name: type) are not handled on their own path which simply matches multiple tokens (or rather, I don't look ahead when I should be). This would remove the part of the algorithm that "rewinds" the tokenstream.

Moreover, the logic for stop_at for parse_stmt and parse_expr is also difficult to track.

[AiredaleDev]

Followup on this: if I can the parser to understand { x := 1; x + 2 } + 3 I think I'll have cracked it. Right now, you can write:

3 + { x := 1; x + 2 }
3 + if a == 2 { x := 1; x + 2 } else { 3 }

but not if you commute the arguments because of the aforementioned painful stop_at logic.