-
Notifications
You must be signed in to change notification settings - Fork 77
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
(off topic) Modern parser generator for Haskell #1909
Comments
Always nice to meet a fellow parser generator. A really good parser generator can cost more than a man year to construct and test. Especially if you go and invent new algorithms. The expert on GLL and Haskell is Thomas van Binsbergen at universiteit van Amsterdam. The requirements: for that I'd read the PhD thesis of Afroozeh and Izmaylova, Economopoulos, Eelco Visser and Jan Rekers. The treesitter community is also a valuable resource on context free general parsing. Have fun! |
Thanks! Could you please recommend specific literature on error recovery in (S)GLL? Afroozeh and Izmaylova left error recovery for future work:
I only found a paper about another formalism (LLR-system). |
Error recovery in GLR: Maartje de Jong (TU Delft), and some chapters in Jan Rekers' thesis. |
Thank you! |
Sorry for off topic here.
Recently, I asked the Haskell community (link) whether there was a modern parser generator. It turned out, there are some attempts that aren't production-ready. At least they're not mature enough to be used in GHC (haskellfoundation/tech-proposals#63, https://gitlab.haskell.org/ghc/ghc/-/merge_requests/4711).
After some discussion and superficial studying of the works, I came to the following high-level requirements (link).
Now, I have a couple of questions.
The text was updated successfully, but these errors were encountered: