angstrom VS parser

Looking at the angstrom reference here I've explored a few ideas but none of them work.

Do you specifically need an LR(1) parser? If you just need to do some simple parsing, a parser combinator library like Angstrom works fine and is completely defined in OCaml code: https://github.com/inhabitedtype/angstrom

I find straight forward, dedicated combinators much more readable and practical to use ie. for iterables (context where it makes a lot of sense) [0] example [1], runtime assertions (through refutations, which are much faster than combinators over assertions) [2], parser combinators for smallish grammars [3] etc.

In many cases vanilla/imperative js is more readable and terse, no need to bring functional fanaticism everywhere, just in places where it gives true benefits and in form that can be understood by peers.

Functional code can be beautiful and can also be unreadable/undebugable. Same with imperative code. It's great in js/ts you can pick approach where the problem is expressed more naturally and mix it at will.

[0] https://github.com/preludejs/generator

[1] https://observablehq.com/@mirek/project-euler

[2] https://github.com/preludejs/refute

[3] https://github.com/preludejs/parser

Parser combinators are great, we're using parser combinators in production, they are great ie. for typescript [0].

[0] https://github.com/preludejs/parser