Jaro
Jaro
Apparently it is possible to use data dependent grammars to implement layout parsing relatively easily. But I don't know exactly how that would work.
One promising approach is [`data-reify`](https://hackage.haskell.org/package/data-reify) described in [Type Safe Observable Sharing in Haskell](http://ku-fpg.github.io/files/Gill-09-TypeSafeReification.pdf). Unfortunately, this isn't straightforward for gigaparsec because our nonterminals might take arguments as input, such as the...
I think it is possible to make the algorithm have O(n^3) worst-case time complexity. This is not a priority for me, because it probably requires O(n^3) space as well and...
Gigaparsec is intended to be used without a separate lexer. So for practical parsers there needs to be a mechanism to handle white space. Perhaps we can implement a mechanism...
Currently, when you write something like `Plus expr
We should introduce a biased `
See [this Discourse thread](https://discourse.haskell.org/t/question-on-bind-implementation-for-exceptt-e-m-a/9783?u=jaror). I will hopefully write something more here soon.
This is my attempt at finishing the work of @dylan-thinnes on [!4311](https://github.com/haskell/haskell-language-server/pull/4311). Addresses https://github.com/haskell/haskell-language-server/issues/2014 Should hopefully enable https://github.com/haskell/haskell-language-server/issues/3246