[add links to related work in documentation Malcolm.Wallace@cs.york.ac.uk**20070226111240] { hunk ./docs/index.html 107 +

+The original Hutton/Meijer combinators are described in a very nice +tutorial tech report: +NOTTCS-TR-96-4 + hunk ./docs/index.html 215 -combinator tutorial was introduced by Hutton and Meijer in 1994, and the -accompanying library was distributed with Gofer (a precursor to Hugs), -and known simply as ParseLib. That library lives on here as -Text.ParserCombinators.HuttonMeijer. +combinator tutorial was introduced by +Hutton and +Meijer in 1996, and the accompanying library was distributed with +Gofer (a precursor to Hugs), and known simply as ParseLib. That library +lives on here as Text.ParserCombinators.HuttonMeijer. hunk ./docs/index.html 221 -

  • Niklas Rojemo's combinators. -The parser combinators developed and used in the implementation of the -nhc98 compiler are monadic and space-efficient. However, they do not -use the standard do-notation, because in fact they are more general than -the standard monad category. +
  • +Niklas Rojemo's +combinators. The parser combinators developed and used in the +implementation of the nhc98 compiler are monadic and space-efficient. +However, they do not use the standard do-notation, because in fact they +are more general than the standard monad category. hunk ./docs/index.html 228 -
  • Daan Leijen's parsec. -The parsec library is widely used, since it is distributed with ghc. -Its combinators are fairly robust, but you need to place explicit -backtracking into your parsers, using the try operator. This -can be tricky. +
  • + +Daan Leijen's parsec. The parsec library is widely used, since it is +distributed with ghc. Its combinators are fairly robust, but you need +to place explicit backtracking into your parsers, using the try +operator. This can be tricky. hunk ./docs/index.html 235 -
  • Doaitse Swierstra's UU_Parse. +
  • Doaitse +Swierstra's UU_Parse. hunk ./docs/index.html 239 -
  • Koen Claessen's ReadP. +
  • Koen Claessen's ReadP. }