hallgren 6d0c8eaa34 Fix an old bug that prevented pattern matching agains values containg tables
The function GF.Grammar.PatternMatch.isInConstantForm returned False for all
tables, causing matchPattern to fail, claiming that "variables occur in" the
term if it contains tables.

This problem is several years old, confirmed present in GF 3.2.10 (Oct 2010).
2013-09-05 15:20:41 +00:00
2010-12-22 16:57:53 +00:00
2013-02-07 13:11:09 +00:00
2013-02-22 15:33:52 +00:00
2012-10-26 08:47:00 +00:00
2007-09-12 09:42:08 +00:00
2013-09-02 20:27:47 +00:00
2010-12-21 10:57:54 +00:00
2012-08-06 16:14:47 +00:00
2013-06-10 21:37:10 +00:00

DESCRIPTION

The Grammatical Framework (=GF) is a grammar formalism based on type theory. 
It consists of

    * a special-purpose programming language
    * a compiler of the language
    * a generic grammar processor 

The compiler reads GF grammars from user-provided files, and the 
generic grammar processor performs various tasks with the grammars:

    * generation
    * parsing
    * translation
    * type checking
    * computation
    * paraphrasing
    * random generation
    * syntax editing 

GF particularly addresses four aspects of grammars:

    * multilinguality (parallel grammars for different languages)
    * semantics (semantic conditions of well-formedness, semantic 
      properties of expressions) 
    * grammar engineering (modularity, abstractions, libraries)
    * embeddability in programs written in other languages (C,C++,
      Haskell, Java, JavaScript)


COMPILATION and INSTALLATION of source distribution:
See download/index.html for installation instructions.
(More details can be found in doc/gf-developers.html.)
Description
No description provided
Readme Multiple Licenses 140 MiB
Languages
Haskell 45%
C 32.9%
JavaScript 10.1%
HTML 3.3%
Grammatical Framework 2.8%
Other 5.8%