The grm package

[Tags: bsd3, library, program]

Grm takes a grammar specification and generates Haskell bindings. Given a grammar the tool produces an abstract syntax implementation, a Happy parser generator file, and a pretty-printer.

[Skip to ReadMe]


Versions0.1.0, 0.1.1
Change logNone available
Dependenciesbase (<5), Cabal, cmdargs, directory, filepath, parsec, process, syb (>=0.3), wl-pprint [details]
CopyrightBrett Letner 2011-2012
AuthorBrett Letner <>
MaintainerBrett Letner <>
Source repositoryhead: git clone git://
UploadedFri Mar 30 23:22:31 UTC 2012 by BrettLetner
Downloads456 total (10 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees

Readme for grm-0.1.1

Introducing the grm compiler construction tool.  Grm takes a grammar
specification and generates Haskell bindings.  Grm is essentially a
simplified bnfc which only generates Haskell (bnfc

Given a grammar the tool produces:
  - an abstract syntax implementation
  - a Happy parser generator file
  - a pretty-printer

Grm also has some library code for lexing and misc. language
development tasks (e.g. unique identifiers).

I use grm heavily in my pec language
compiler. ( and on hackage).  You can
check out pec for example grm usage.

  - type 'make'
  - resolve all hackage dependencies
  - type 'make' again

You can download and install grm via cabal or access the git
repository on github (

Any feedback on the design and/or implementation of grm would be
greatly appreciated :)

brettletner at gmail dot com