-
There is a caveat to using parameterised productions which is not mentioned in the online documentation, which is that it is possible to effectively define infinite grammars, causing non-termination. …
-
This could be something fun to explore: https://serokell.io/blog/parser-combinators-in-haskell#bonus%3A-quasi-quotations
```hs
[icu|Hello {name}|]
```
Might be helpful for testing stuff like f…
samhh updated
2 years ago
-
I have a significant amount of dynamically typed CBPV code written in Fiddle.
1. Here is the prelude, which has a lot of convenient CBPV combinators for programming locally in CBV or CBN style: htt…
-
Basically, everything configurable on the `Project` type should have a corresponding `Cartfile.private` flag. I don't think this information should go into the `Cartfile`, because the settings shouldn…
-
I would like to use `parser-ts` to parse PromQL of which formal definition may be found below,
1. https://github.com/prometheus/prometheus/blob/main/promql/parser/generated_parser.y.go
2. https://…
-
As shown in #235, the new `parsley.debugger` functionality suffers from exposing underlying implementations in a way that might not be obvious at all to a user. A looping `.foldLeft` reports that `pur…
-
## Motivation
http://www.lihaoyi.com/fastparse/#Comparisons
## Current usage of parsing combinators:
- [ ] https://github.com/thomsonreuters/CM-Well/blob/b6a203a7e2ae5d7fe33ed0b1aa173909219e1b9d/…
-
Hi,
I started using Lambda Soup and found that it does not seems to support selector lists, like `".bg1, .bg3"`.
I need to parse an HTML document with various `` with `bg2` `bg1` `bgbc` `bg3` clas…
-
I encountered a use case where I would need a parser that could consume a string, but insensitive to the case of the letters it contains.
For example, I would like a parser that matches `"foo"`, `"…
-
Hi,
I saw there is `Text.Megaparsec.Debug`. It has same problem as manual printf - it is expensive to add log statements, to keep them and remove, because it requires manual labor.
Parser built…