hallgren 7ee66302d1 minibar: better implementation of word replacement
Instead of trying to reconstruct the abstract tree from the bracketed string,
use the node numbers (the field called "fid") to identify which node in the
abstact syntax tree a word in the bracketed string corresponds to.
2012-04-02 16:05:11 +00:00
2010-12-22 16:57:53 +00:00
2012-03-01 14:51:16 +00:00
2012-02-28 17:24:34 +00:00
2012-03-26 15:02:15 +00:00
2007-09-12 09:42:08 +00:00
2012-03-30 15:07:12 +00:00
2010-12-21 10:57:54 +00:00
2012-02-25 09:53:09 +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 doc/gf-developers.html for installation instructions.
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%