Haskell Quiz/Bytecode Compiler: Difference between revisions
Jim Burton (talk | contribs) (added link to Craft of FP solution) |
Jim Burton (talk | contribs) mNo edit summary |
||
| Line 9: | Line 9: | ||
* [[Haskell Quiz/Bytecode Compiler/Solution Justin Bailey|Justin Bailey]] | * [[Haskell Quiz/Bytecode Compiler/Solution Justin Bailey|Justin Bailey]] | ||
* A (non-monadic) solution to this is a [http://www.cs.kent.ac.uk/people/staff/sjt/craft2e/Code/Parsing/Parsing.hs case study] in Chapter 17 of [http://www.cs.kent.ac.uk/people/staff/sjt/craft2e The Craft of Functional Programming] by Simon Thompson. | * A (non-monadic) solution to the parsing and eval part of this quiz is a [http://www.cs.kent.ac.uk/people/staff/sjt/craft2e/Code/Parsing/Parsing.hs case study] in Chapter 17 of [http://www.cs.kent.ac.uk/people/staff/sjt/craft2e The Craft of Functional Programming] by Simon Thompson. | ||
Revision as of 10:59, 4 November 2006
The Problem
Create a bytecode compiler as described on the test page. The Ruby solution involves being run by a interpreter written in Ruby - but that wont' work for the Haskell solution. Anyone want to write the interpreter in Haskell to test the solutions? :)
Solutions
- A (non-monadic) solution to the parsing and eval part of this quiz is a case study in Chapter 17 of The Craft of Functional Programming by Simon Thompson.