Re: Happy / Alex description for Haskell2010
Thanks Doaitse, I'm not looking for a parser that I can run, I am mostly interested in the codified BNF, to study, and adapt. I'll take a look at the Utrecht Haskell Compiler in any case, as it sounds interesting... do you mean this file? https://github.com/uhc/uhc/blob/master/EHC/src/helium/Parser/Parser.hs On Thu, 25 Oct 2018 at 20:11, Doaitse Swierstra wrote: > > I do not know why you do need a Haskell parser, but the Utrecht Haskell > Compiler contains a combinator based Haskell parser (using the uulib package, > supporting the offside rule) which might serve your needs. It can easily be > adapted if needed. > > Doaitse Swierstra > > > > > Op 25 okt. 2018, om 20:31 heeft Sam Halliday het > > volgende geschreven: > > > > Hello all, > > > > Is there a Happy / Alex file describing Haskell2010? > > > > I can see the versions in the ghc source tree, but of course they > > support all the ghc extensions. The link to the hsparser page [1] in > > the Happy documentation doesn't seem to exist anymore. > > > > I would also love to hear if there is a Bison definition. > > > > Best regards, > > Sam > > > > [1] > > http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne/haskell_libs/hsparser.html > > ___ > > Glasgow-haskell-users mailing list > > Glasgow-haskell-users@haskell.org > > http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users > ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users
Re: Happy / Alex description for Haskell2010
I do not know why you do need a Haskell parser, but the Utrecht Haskell Compiler contains a combinator based Haskell parser (using the uulib package, supporting the offside rule) which might serve your needs. It can easily be adapted if needed. Doaitse Swierstra > Op 25 okt. 2018, om 20:31 heeft Sam Halliday het > volgende geschreven: > > Hello all, > > Is there a Happy / Alex file describing Haskell2010? > > I can see the versions in the ghc source tree, but of course they > support all the ghc extensions. The link to the hsparser page [1] in > the Happy documentation doesn't seem to exist anymore. > > I would also love to hear if there is a Bison definition. > > Best regards, > Sam > > [1] > http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne/haskell_libs/hsparser.html > ___ > Glasgow-haskell-users mailing list > Glasgow-haskell-users@haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users
RE: Happy Alex
I have successfully used the the excellent haskell tools Happy and Alex in a couple of parsing projects, but I have failed when trying to combine a monadic Happy grammar (using the %monad and %lexer directives) together with an Alex generated okenizer, nor are there any such examples in the Happy and Alex distributions. Have anyone tried this combination and can give me some advice or a simple example? I've been doing some work on Alex recently, and getting it to work smoothly with Happy's monadic scheme is one of the goals. I'll post something when it's done, but if you want to have a look at the work-in-progress look in the CVS tree, under fptools/happy/alex on the branch simonm-hackery-branch. The other things I'm doing include making Alex's syntax more lex-like and Happy-like (mostly done), making the generated code more efficient in terms of both space and time (mostly done), and adding support for Unicode (not done, I'm still thinking about how best to do this - I have some ideas but suggestions are welcome). Cheers, Simon ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell