Hi Johannes,
There is a similar course in Chalmers. The home page is here:
http://www.cs.chalmers.se/Cs/Grundutb/Kurser/progs/current/
There students were required to implement full parser, partial
typechecker and partial interpreter for C++ in either C++, Java or
Haskell. We used BNFC for the parser:
http://www.cs.chalmers.se/Cs/Research/Language-technology/BNFC/
which was easier for most students I think. In any way I would
recomend Happy+Alex or BNFC instead of Parsec but this is only my
personal preference.
Best Regards,
Krasimir
2008/8/20 Johannes Waldmann
Hello.
I plan to give a course in compiler construction, using Haskell as the implementation language (not as source or target language).
Something along these lines: 1. combinator parsers (Parsec), 2. simple interpreter (arithmetical expressions) 3. add algebraic data types, functions 4. type checker 5. code generator. Ideally, 2..5 would be using the very same tree traversal code and just change the monad for evaluation.
Any comments appreciated. Have you given such a course? Taken?
If I really decide to do it, then slides (in German) will be made available.
Best regards, J.W.
_______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell