frown source package in Ubuntu


frown ( unstable; urgency=medium

  * Upload to unstable as part of GHC 8 transition.

 -- Clint Adams <email address hidden>  Thu, 27 Oct 2016 18:32:16 -0400

Upload details

Uploaded by:
Debian Haskell Group on 2016-10-28
Uploaded to:
Original maintainer:
Debian Haskell Group
any all
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release on 2017-10-24 universe devel
Artful release on 2017-04-20 universe devel


File Size SHA-256 Checksum
frown_0.6.2.3-4.dsc 2.2 KiB b795945efc190603c17d6a30231b0b323968b354c44b2b83afdd573a2545197c
frown_0.6.2.3.orig.tar.gz 1.2 MiB fcca75244343a976a397f7d50687a80d41192e9eaa47d77799d11892f5fe400c
frown_0.6.2.3-4.debian.tar.xz 7.6 KiB dea91169f6c8098aad1dd1fb940bf393f99b5e177d0d91e516c299f39cde1b6e

Available diffs

No changes file available.

Binary packages built by this source

frown: LALR(k) parser generator

 Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98.
 Its salient features are:
    - The generated parsers are time and space efficient. On the downside, the
       parsers are quite large.
    - Frown generates four different types of parsers. as a common
       characteristic, the parsers are genuinely functional (ie ‘table-free’);
       the states of the underlying LR automaton are encoded as mutually
       recursive functions. Three output formats use a typed stack
       representation, and one format due to Ross Paterson (code=stackless)
       works even without a stack.
    - Encoding states as functions means that each state can be treated
       individually as opposed to a table-driven approach, which necessitates a
       uniform treatment of states. For instance, look-ahead is only used when
       necessary to resolve conflicts.
    - Frown comes with debugging and tracing facilities; the standard output
       format due to Doaitse Swierstra (code=standard) may be useful for
       teaching LR parsing.
    - Common grammatical patterns such as repetition of symbols can be
       captured using rule schemata. There are several predefined rule
    - Terminal symbols are arbitrary variable-free Haskell patterns or guards.
       Both terminal and nonterminal symbols may have an arbitrary number of
       synthesized attributes.
    - Frown comes with extensive documentation; several example grammars are
       included. Furthermore, Frown supports the use of monadic lexers, monadic
       semantic actions, precedences, and associativity, the generation of
       backtracking parsers, multiple start symbols, error reporting, and a
       weak form of error correction.

frown-doc: No summary available for frown-doc in ubuntu zesty.

No description available for frown-doc in ubuntu zesty.