| 10 Dec 2025 |
 kloenk | yeah I think that's the same. never exatly sure what is what | 15:37:00 |
 piegames | One thing I worry about nom is that statless parsing is simpler but may end up requiring more allocations/moves of data and thus hurt performance. Winnow seems to support stateful parsing. How does chumpksy work there? | 15:39:10 |
| piegames | Stateful parsing is more annoying on backtracking, but the Nix language is almost LL1 and the two edge cases where it isn't can be handled manually | 15:39:52 |
 K900 | cumsky | 15:40:12 |
| K900 | Sorry | 15:40:14 |
| piegames | Chompsky | 15:41:12 |
| kloenk | I don't remember exactly. but IIRC it was titled as parser combinator which does some backtracking internally and tries to optimize everything as good as possible which just throwing compile time on it | 15:41:18 |
 helle (just a stray cat girl) | chumsky, what a name..... not a recipe for headaches there :P | 15:43:30 |
| kloenk | Oh there is also a library to bridge chumsky and logos for token based parsing. Apparently it’s utter shit and looks very AI generated | 16:05:33 |
 rosssmyth | I've written several parsers in Rust and TBH for best error handling recursive descent will always win. | 16:26:03 |
| rosssmyth | Chumsky is my favorite library though | 16:26:13 |
| rosssmyth | * I've written several parsers in Rust and TBH for best error handling hand-rolled recursive descent will always win. | 16:26:20 |
| rosssmyth | Pratt parsing is nice | 16:26:41 |
| rosssmyth | https://matklad.github.io/2020/04/13/simple-but-powerful-pratt-parsing.html | 16:27:05 |
| rosssmyth | Why do you need a library for that? | 16:27:42 |
| rosssmyth | They integrate just fine | 16:28:05 |
