Markus Forsberg, Peter Gammie, Michael Pellauer and Aarne Ranta
March 2004

News

• 5/04 2004 A minor bug-fix release. The requirement of Alex.hs has been removed from the Haskell backend. Patch supplied by Antti-Juhani Kaijanaho.
• BNF Converter has now been accepted to the unstable distribution of Debian.
  More information here.
• 08/03 2004 Release of BNF Converter version 2.1. Alex v2.0 support and bug fixes.
• 22/10 2003 Release of BNF Converter version 2.0, generating four languages.
  

  What is the BNF Converter?

  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, but starting from Version 2.0, it can also be used for generating Java, C++, and C.

  Given a Labelled BNF grammar the tool produces:

  • an abstract syntax as a Haskell/C++/C 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, or Bison parser generator file
  • a pretty-printer as a Haskell/Java/C++/C module
  • a Latex file containing a readable specification of the language

  User manuals

  • Report on the LBNF formalism: LBNF-report.ps
  • Quick Start
  • Haskell Mode
  • Java Mode
  • C Mode
  • C++ Mode

  Downloads

  Source code: bnfc_2.1.2.tgz

  Solaris binary

  Linux binary

  Windows binary.

  Report on the LBNF formalism: LBNF-report.ps

  Example grammars

  A grammar of C. An example C file parsable in type Program.

  A grammar of Alfa. An example Alfa file parsable in type Module. (For more details, see the Alfa home page.)

  A grammar of LBNF. It is at the same time an example LBNF file, parsable in type Grammar. This grammar is used in the implementation of the BNF Converter.

  Earlier versions

  v2.0 source code with examples: bnfc_2.1.tgz

  v2.0 source code with examples: bnfc_2.0.tgz

  v1.3 source code with examples: bnfc_1.3.tar

  v1.0, source code with examples: bnf_conv.tgz