Copperbox revision 1085.
Maybe this will be a bad idea, but I've started implementing a Haskell lexer with Parsec. I'm not bothered about performance so I don't mind Parsec on that score; but I am a bit concerned that the lexer spec in the H98 report relies on longest match - this might not be easily achievable with parser combinators.
Revision 1086 - deleted a wrongly created directory.
Blog Archive
-
▼
2010
(890)
-
▼
January
(48)
- Mullein M2
- KURE
- Mullein M2
- data-aviary
- arity-lib
- Mullein M2
- Hurdle and Kangaroo
- kangaroo
- kangaroo
- SFont - ZFont
- Hurdle, SFont and Kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
- data-aviary
- data-aviary
- OpenVG binding
- OpenVG binding
- OpenVG binding
- OpenVG binding
- OpenVG binding
- precis
- precis
- precis
- precis
- precis
- precis
- zparse
- zparse
- zparse
- zparse
- zparse
- zparse
- zparse
- resumptions
- resumptions
- kangaroo
- kangaroo
- Hurdle and kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
- kangaroo
-
▼
January
(48)
About Me
- Stephen Tetley
- Disambiguating biog as there are a few Stephen Tetley's in the world. I'm neither a cage fighter or yachtsman. I studied Fine Art in the nineties (foundation Bradford 1992, degree Cheltenham 1992 - 95) then Computing part-time at Leeds Met graduating in 2003. I'm the Stephen Tetley on Haskell Cafe and Stackoverflow.