Scala Parser Combinators VS Advent-of-code

Scala used to include a parser combinator library. I don't know whether it comes with a Scala grammar as an example but I'd probably take a day and experiment whether it would be possible to create an AST parser for the Scala grammar.

If you find anything that isn't already linked from the README at https://github.com/scala/scala-parser-combinators , please PR the addition to the readme.

Mostly a mess of pattern matching. I really need to make some generic tree utilities. Haven't been able to find a decent parser combinator that works in Scala 3 (I usually use fastparse which depends heavily on Scala 2 macros, and scala-parser-combinators works in Scala 3, but I've had a lot of trouble getting it to not be too greedy), so I used the state monad from cats to parse at the bottom of the file, which I think turned out fairly nice.

Wow, almost identical to mine: https://github.com/MichalMarsalek/Advent-of-code/blob/master/2022/Nim/day6.nim

This year I was writing two sets of solutions in Nim. The first one focuses on idiomatic, nice and short and readable Nim. The other focuses purely on speed. The combined running times of the fast solutions is 130 ms. Please let me know if you have any tips on how to make my solutions more simple and/or idiomatic.

Beautiful Nim! My solution is actually very similar.