BNFC

A compiler front-end generator.

http://bnfc.digitalgrammars.com/

Version on this page:	2.8.4
LTS Haskell 24.28:	2.9.6.1
Stackage Nightly 2026-01-19:	2.9.6.1
Latest on Hackage:	2.9.6.1

See all snapshots BNFC appears in

GPL-2.0-only licensed

Maintained by [email protected]

This version can be pinned in stack with:BNFC-2.8.4@sha256:1979258f40c023492cea1df6f4be038c2652cc0ac739c1cba32d1f3ed9b3beeb,11458

Module documentation for 2.8.4

Algebra
- Algebra.RingUtils
Data
- Data.Matrix
  - Data.Matrix.Class
  - Data.Matrix.Quad
- Data.Pair
Parsing
- Parsing.Chart
- Parsing.TestProgram

Depends on 11 packages(full list with versions):

array, base, containers, deepseq, directory, filepath, mtl, pretty, process, semigroups, time

The BNF Converter is a compiler construction tool generating a compiler front-end from a Labelled BNF grammar. It was originally written to generate Haskell code, but can also be used for generating Agda, C, C++, C#, Java, Ocaml and XML code.

Given a Labelled BNF grammar the tool produces: an abstract syntax as a Haskell, Agda, C, C++, C#, Ocaml module or Java directory, a case skeleton for the abstract syntax in the same language, an Alex, JLex, or Flex lexer generator file, a Happy, CUP, Bison, or Antlr parser generator file, a pretty-printer as a Haskell, Agda, C, C++, C#, Java, or Ocaml module, an XML representation, a LaTeX file containing a readable specification of the language.