Name | Date | Size | #Lines | LOC | ||
---|---|---|---|---|---|---|
.. | 09-Sep-2001 | - | ||||
Expr.y | H A D | 09-Sep-2001 | 717 | 50 | 35 | |
Hugs.lhs | H A D | 09-Sep-2001 | 569 | 27 | 22 | |
Main.lhs | H A D | 09-Sep-2001 | 844 | 31 | 25 | |
Makefile | H A D | 09-Sep-2001 | 525 | 30 | 19 | |
README | H A D | 09-Sep-2001 | 371 | 14 | 8 | |
Tree.lhs | H A D | 09-Sep-2001 | 564 | 20 | 16 |
README
1 2Example of arithmetic expression parsing, but producing a labelled 3forest. 4 5Note use of polymorphic type in the labels. See the code more more 6discussion. 7 8"make run" to run the test case. 9 10For Hugs, load up Hugs.lhs - it is a simplified version of Main, with entry 11point "test :: String -> IO ()" 12 13NOTE: you need the -98 flag on Hugs, owing to non-standard class use 14