Thanks, that is interesting.  I see this is a different type of grammar
than in Parser.y, in that (for example) it does not have any actions on
the rules.

I'm still curious about why the GHC parser does not use a grammar that
is closer to the language grammar.  Is this mostly for historical
reasons?  Are GLR parsers too slow?  I don't know what fraction of the
compilation time is spent in parsing, but would suspect it is not that much.

-BenRI

On 4/15/21 11:55 AM, Georgi Lyubenov wrote:
> Hi!
>
> I think the updated tree sitter grammar might be relevant to you -Â
> https://github.com/tree-sitter/tree-sitter-haskell
> <https://github.com/tree-sitter/tree-sitter-haskell>
>
> Cheers,
>
> ======
> Georgi
_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.