Filewatcher File Search File Search
Catalog
Content Search
» » » » »

happy

Parser generator for Haskell

Variants:
Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar.

Happy is flexible: you can have several Happy parsers in the same program, and several entry points to a single grammar. Happy can work in conjunction with a lexical analyser supplied by the user (either hand-written or generated by another program), or it can parse a stream of characters directly (but this isn't practical in most cases).

Homepage:
Package version:1.18.9-1
Architecture:s390
Distribution:Debian
Filename:happy_1.18.9-1_s390.deb

/usr/share/doc/happy/README

This is Happy version 1.18, a parser generator for Haskell 98.

   http://www.haskell.org/happy/
   http://hackage.haskell.org/cgi-bin/hackage-scripts/package/happy

Happy is built using Cabal.  First install GHC, then:
 
  $ runhaskell Setup.lhs configure
  $ runhaskell Setup.lhs build
  $ runhaskell Setup.lhs install

Complete documentation can be found in the directory 'doc', in
DocBook XML for
more»

/usr/share/doc/happy/examples/README

These are a few examples of Happy parsers, taken from various sources.
The are intended as illustrations, not as working, complete examples,
as some require functions and datatypes imported from other sources.

Calc.ly	         :  The calculator example from the Happy manual
DavesExample.ly  :  Parses simple lambda expressions to combinators
SimonsExample.ly :  Another lambda expression parser
Erl
more»

/usr/share/doc/happy/examples/glr/bio-eg/README

A more complex example - looking for patterns in DNA sequences.

This example derived from undergraduate project work by Julia Fischer
at the University of Durham. Some of the grammar is based on the ones
developed by Siu-wai Leung, Chris Mellish, and Dave Robertson at the
University of Edinburgh.  (Contact Paul Callaghan for details, and
see the accompanying paper.)

Files 1-600.dna and 1-1200.d
more»

/usr/share/doc/happy/examples/glr/expr-eval/README

Example of arithmetic expression parsing, with decoding of semantic
values (ie it gives a list of p
more»

/usr/share/doc/happy/examples/glr/expr-monad/README

Example of arithmetic expression parsing, with decoding of semantic
values (ie it gives a list of p
more»

/usr/share/doc/happy/examples/glr/expr-tree/README

Example of arithmetic expression parsing, but producing a labelled
forest. 

Note use of polymorphi
more»

/usr/share/doc/happy/examples/glr/hidden-leftrec/README

Example of hidden left recursion

The key point is that it has rules of form (X -> A X z), where A 
more»

/usr/share/doc/happy/examples/glr/highly-ambiguous/README

Example of a highly ambiguous grammar

It is a grammar taken from [1], although it is an example fr
more»

Browse inside happy_1.18.9-1_s390.deb

         [DIR]DEBIAN/ (2)  65535+ mirrors
         [DIR]usr/ (2)  65535+ mirrors

Download happy_1.18.9-1_s390.deb

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2016 FileWatcher.com