./devel/happy-lib, Library for the happy parser generator for Haskell

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 2.1.3, Package name: happy-lib-2.1.3, Maintainer: pkgsrc-users

Happy is a parser generator for Haskell. Given a grammar specification
in BNF, Happy generates Haskell code to parse the grammar. Happy
works in a similar way to the yacc tool for C.

This library provides the following functionality:

* Data type definitions for the Grammar AST type, capturing the
information in .y-files
* A parser for happy grammar files (.y) to produce a Grammar
* Implementations of the text book algorithms that compute the LR
action and goto tables for the given Grammar
* An LALR code generator to produce table-driven, deterministic
parsing code in Haskell
* A (less maintained) GLR code generator to produce
table-driven, non-deterministic parsing code in Haskell, where
ambiguous parses produce multiple parse trees

Master sites:

Filesize: 91.123 KB

Version history: (Expand)

CVS history: (Expand)


   2025-01-09 23:59:22 by Thomas Klausner | Files touched by this commit (5) 
Log message:
devel/happy-lib: import happy-lib-2.1.3

Happy is a parser generator for Haskell. Given a grammar specification
in BNF, Happy generates Haskell code to parse the grammar. Happy
works in a similar way to the yacc tool for C.

This library provides the following functionality:

* Data type definitions for the Grammar AST type, capturing the
  information in .y-files
* A parser for happy grammar files (.y) to produce a Grammar
* Implementations of the text book algorithms that compute the LR
  action and goto tables for the given Grammar
* An LALR code generator to produce table-driven, deterministic
  parsing code in Haskell
* A (less maintained) GLR code generator to produce
  table-driven, non-deterministic parsing code in Haskell, where
  ambiguous parses produce multiple parse trees