-
Already implemented and in use in https://github.com/dafny-lang/libraries/tree/parser-combinators-library.
This might not be as core a utility as the other standard libraries, but since we don't ha…
-
how would i design the and of a parser combinator so that i do not need to create an infinite number of functions for it
-
- https://crater-reports.s3.amazonaws.com/beta-1.79-2/beta-2024-05-11/gh/jwiegley.motoko_parse/log.txt
```
[INFO] [stdout] error: reached the recursion limit while instantiating `::parse_mode::`
[I…
-
When both branches of a `|||` combinator produce a `Failure` as a result, the resulting error message is the one coming from the branch that matched the longest chain. This can lead to confusing error…
-
Hi there.
The typescript typings of the `then` combinator allow to pass up to four parsers to the combinator.
Is it possible to pass either 5 or pass a list of parsers to a then method?
-
Something that could be quite fun and useful to do is showing how to implement a simple parser combinator library.
Could build on some of the BSON encoding/decoding, where we can take that shape o…
-
-
The parser should use https://flora.pm/packages/@hackage/parser-combinators
-
I’ve been thinking about the solution I proposed to @Pamplemousse’s #91 and I think it can be taken further. I'd love some feedback
There are lots of combinators that can be considered to be modifi…
-
Many of the examples of regexes are reached the point where a parser combinator library would be a much better option - a prime example is the URL matcher which can easily be precisely defined using a…