From: Don Stewart <dons at cse.unsw.edu.au>
--
Alex is a tool for generating lexical analysers in Haskell, given
a description of the tokens to be recognised in the form of regular
expressions. It is similar to the tool lex or flex for C/C++.
The SDL_gfx library evolved out of the SDL_gfxPrimitives code which
provided basic drawing routines such as lines, circles or polygons, and
SDL_rotozoom which implemented a interpolating rotozoomer for SDL
surfaces.
Pygame is a cross-platfrom library designed to make it easy to write
multimedia software, such as games, in Python. Pygame requires the
Python language and SDL multimedia library. It can also make use of
several other popular libraries.
--
Haddock is a tool for automatically generating documentation from
annotated Haskell source code. It is primary intended for documenting
libraries, but it should be useful for any kind of Haskell code.
Like other systems, Haddock lets you write documentation annotations
next to the definitions of functions and types in the source code, in
a syntax that is easy on the eye when writing the source code (no
heavyweight mark-up). The documentation generated by Haddock is fully
hyperlinked.
--
Hmake is an intelligent compilation management tool for Haskell
programs. It automatically extracts dependencies between source
modules, and issues the appropriate compiler commands to rebuild
only those that have changed, given just the name of the program
or module that you want to build.
Hmake interactive, or hi for short, is an interpreter-like
environment that you can wrap over any common Haskell compiler to
achieve an interactive development style. It deliberately looks
and feels a lot like the Hugs interpreter. The difference is that
you get real compiled code, compiled by your favorite compiler -
you can even change compiler on the fly, to check your code's
portability!
with minor tweaks by me.
--
Happy - The LALR(1) Parser Generator for Haskell
Happy is a parser generator system for Haskell, similar to the
tool `yacc' for C. Like `yacc', it takes a file containing an
annotated BNF specification of a grammar and produces a Haskell
module containing a parser for the grammar.
Happy is flexible: you can have several Happy parsers in the same
program, and several entry points to a single grammar. Happy can
work in conjunction with a lexical analyser supplied by the user
(either hand-written or generated by another program), or it can
parse a stream of characters directly.