Merge branch 'c-runtime' into compact-pgf

- Also bump up some minor GHC versions (8.4.3 -> 8.4.4, 8.6.2 -> 8.6.5)
- Should still work with Stack < v2 (tested in docker/haskell:8.2.2)

.authorspellings

@@ -1,22 +0,0 @@
--- Use darcs show authors to see the number of patches per person
-
-Aarne Ranta		<aarne@chalmers.se>,		aarne@cs.chalmers.se, aarne
-Björn Bringert		<bjorn@bringert.net>,		bringert@cs.chalmers.se, bringert
-Krasimir Angelov	<krasimir@chalmers.se>,		kr.angelov@chalmers.se,kr.angelov@gmail.com,kr_angelov@gmail.com
-Peter Ljunglöf		<peb@ling.gu.se>,		peb,peb@cs.chalmers.se
-Thomas Hallgren		<hallgren@chalmers.se>,		hallgren@altocumulus.org
-Janna Khegai		<janna@cs.chalmer.se>,		janna,janna@cs.chalmers.se
-Jordi Saludes 		<jordi.saludes@upc.edu>
-Ramona Enache		<ramona.enache@chalmers.se>,	ra.monique@gmail.com
-Hans-Joachim Daniels	<hdaniels>
-Jean-Philippe Bernardy	<bernardy@chalmers.se>
-Kevin Kofler		<kevin.kofler@chello.at>
-Harald Hammarström	<harald2>
-Olga Caprotti		<caprotti@chalmers.se>,		olga.caprotti@gmail.com
-Adam Slaski		<adam.slaski@gmail.com>,	Adam Slaski <adam.slaski@gmail.com>
-Moisés Salvador Meza Moreno<meza@student.chalmers.se>,	'Moises Meza <meza@student.chalmers.se>'
-Ali El Dada		<eldada@student.chalmers.se>,	'ali.eldada@gmail.com'
-Markus Forsberg		<markus>
-Server Cimen		<e1560697@ceng.metu.edu.tr>
-Grégoire Détrez		<gdetrez@crans.org>
-Ketil Malde <ketil@ii.uib.no>

.ghci

@@ -0,0 +1,2 @@
+:set -isrc/compiler -isrc/binary -isrc/runtime/haskell -isrc/server -isrc/example-based -isrc/server/transfer -idist/build/autogen -idist/build
+:set -fwarn-unused-imports -optP-DSERVER_MODE -optP-DUSE_INTERRUPT -optP-DCC_LAZY -optP-include -optPdist/build/autogen/cabal_macros.h -odir dist/build/gf/gf-tmp -hidir dist/build/gf/gf-tmp -stubdir dist/build/gf/gf-tmp

.gitignore

@@ -0,0 +1,64 @@
+*.class
+*.la
+*.o
+*.lo
+*.jar
+*.gfo
+*.pgf
+dist/
+src/runtime/c/.libs/
+src/runtime/c/Makefile
+src/runtime/c/Makefile.in
+src/runtime/c/aclocal.m4
+src/runtime/c/autom4te.cache/
+src/runtime/c/config.h
+src/runtime/c/config.h.in
+src/runtime/c/config.log
+src/runtime/c/config.status
+src/runtime/c/configure
+src/runtime/c/gu/.deps/
+src/runtime/c/gu/.dirstamp
+src/runtime/c/libgu.pc
+src/runtime/c/libpgf.pc
+src/runtime/c/libsg.pc
+src/runtime/c/libtool
+src/runtime/c/m4/libtool.m4
+src/runtime/c/m4/ltoptions.m4
+src/runtime/c/m4/ltsugar.m4
+src/runtime/c/m4/ltversion.m4
+src/runtime/c/m4/lt~obsolete.m4
+src/runtime/c/pgf/.deps/
+src/runtime/c/pgf/.dirstamp
+src/runtime/c/pgf/lightning/asm.h
+src/runtime/c/pgf/lightning/core.h
+src/runtime/c/pgf/lightning/fp.h
+src/runtime/c/pgf/lightning/funcs.h
+src/runtime/c/scripts/
+src/runtime/c/sg/.deps/
+src/runtime/c/sg/.dirstamp
+src/runtime/c/stamp-h1
+src/runtime/java/.libs/
+src/runtime/python/build/
+.cabal-sandbox
+cabal.sandbox.config
+.stack-work
+DATA_DIR
+
+stack*.yaml.lock
+
+# Generated documentation (not exhaustive)
+demos/index-numbers.html
+demos/resourcegrammars.html
+demos/translation.html
+doc/tutorial/gf-tutorial.html
+doc/index.html
+doc/gf-bibliography.html
+doc/gf-developers.html
+doc/gf-editor-modes.html
+doc/gf-people.html
+doc/gf-refman.html
+doc/gf-shell-reference.html
+doc/icfp-2012.html
+download/*.html
+gf-book/index.html
+src/www/gf-web-api.html

.travis.yml

@@ -0,0 +1,14 @@
+sudo: required
+
+language: c
+
+services:
+  - docker
+
+before_install:
+  - docker pull odanoburu/gf-src:3.9
+
+script:
+  - |
+    docker run --mount src="$(pwd)",target=/home/gfer,type=bind odanoburu/gf-src:3.9 /bin/bash -c "cd /home/gfer/src/runtime/c &&
+    autoreconf -i && ./configure && make && make install ; cd /home/gfer ; cabal install -fserver -fc-runtime --extra-lib-dirs='/usr/local/lib'"

LICENSE

@@ -8,24 +8,9 @@ other. For this reason the different components have different licenses.
 In summary:
 
   - the GF compiler in the folder src/compiler and the PGF Web service in src/server
-are under the GNU GENERAL PUBLIC LICENSE. 
+are under the GNU GENERAL PUBLIC LICENSE.
 
-  - the GF runtime in src/runtime is under dual GNU LESSER GENERAL PUBLIC LICENSE
-and BSD LICENSE
-
-  - the resource grammar library in lib/src is under GNU LESSER GENERAL PUBLIC LICENSE.
-However the user have the right to choose any license for any application grammar
-derived from the resource grammar by using the grammar API.
-
-  - the resource grammar library also includes large coverage lexicons for some languages.
-Since these lexicons are derived from external sources they might be under different licenses.
-Look at the source file for every lexicon for details. The lexicons that we currently have
-are:
-
-       lib/src/bulgarian/    DictBul.gf DictBulAbs.gf    for Bulgarian
-       lib/src/english/      DictEng.gf DictEngAbs.gf    for English
-       lib/src/turkish/      DictTur.gf DictTurAbs.gf    for Turkish
-       lib/src/swedish/      DictSwe.gf DictSweAbs.gf    for Swedish
+  - the GF runtime in src/runtime is under dual GNU LESSER GENERAL PUBLIC LICENSE and BSD LICENSE
 
 The rest of this document contains copies of the GPL, LGPL and BSD licenses
 which are applicable to the different components of Grammatical Framework

Makefile

@@ -1,29 +1,53 @@
-.PHONY: all build install doc clean sdist
+.PHONY: all build install doc clean gf html deb pkg bintar sdist
+
+# This gets the numeric part of the version from the cabal file
+VERSION=$(shell sed -ne "s/^version: *\([0-9.]*\).*/\1/p" gf.cabal)
 
 all: build
 
-dist/setup-config: gf.cabal
-	chmod u+x lib/src/mkPresent
-	chmod u+x lib/src/mkMinimal
-	runghc Setup.hs configure
+dist/setup-config: gf.cabal Setup.hs WebSetup.hs
+	cabal configure
 
 build: dist/setup-config
-	runghc Setup.hs build
+	cabal build
 
 install:
-	runghc Setup.hs install
+	cabal copy
+	cabal register
 
 doc:
-	runghc Setup.hs haddock
+	cabal haddock
 
 clean:
-	runghc Setup.hs clean
+	cabal clean
+	bash bin/clean_html
 
-sdist:
-	runghc Setup.hs sdist
 gf:
-	runghc Setup.hs build rgl-none
+	cabal build rgl-none
 	strip dist/build/gf/gf
 
 html::
-	bash bin/update_html
+	bash bin/update_html
+
+# Make a debian package. First add a suitable entry with the correct GF version
+# number to the top of debian/changelog.
+# (Tested on Ubuntu 15.04. You need to install dpkg-dev & debhelper.)
+deb:
+	dpkg-buildpackage -b -uc
+
+# Make an OS X Installer package
+pkg:
+	FMT=pkg bash bin/build-binary-dist.sh
+
+# Make a binary tar distribution
+bintar:
+	bash bin/build-binary-dist.sh
+
+#sdist:
+#	cabal sdist
+
+# Make a source tar.gz distribution using git to make sure that everything is included.
+# We put the distribution in dist/ so it is removed on `make clean`
+sdist:
+	test -d dist || mkdir dist
+	git archive --format=tar.gz --output=dist/gf-${VERSION}.tar.gz HEAD

README

@@ -1,33 +0,0 @@
-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.

README.md

@@ -0,0 +1,53 @@
+![GF Logo](doc/Logos/gf1.svg)
+
+# Grammatical Framework (GF)
+
+[![Build Status](https://travis-ci.org/GrammaticalFramework/gf-core.svg?branch=master)](https://travis-ci.org/GrammaticalFramework/gf-core)
+
+The Grammatical Framework 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
+
+The simplest way of installing GF is with the command:
+```
+cabal install
+```
+
+For more details, see the [download page](http://www.grammaticalframework.org/download/index.html)
+and [developers manual](http://www.grammaticalframework.org/doc/gf-developers.html).
+
+## About this repository
+
+On 2018-07-25, the monolithic [GF repository](https://github.com/GrammaticalFramework/GF)
+was split in two:
+
+1. [gf-core](https://github.com/GrammaticalFramework/gf-core) —  the GF compiler, shell and runtimes
+2. [gf-rgl](https://github.com/GrammaticalFramework/gf-rgl) — the resource grammar library
+
+The former repository is now archived and no longer updated.
+The split was performed using [this script](https://github.com/GrammaticalFramework/GF/blob/30ae1b5a5f73513ac5825ca6712186ef8afe9fd4/split/run.sh)
+and the output of that script is [here](https://gist.github.com/johnjcamilleri/a6c43ff61f15a9657b457ac94ab7db61).

Setup.hs

@@ -1,342 +1,82 @@
-module Main where
+import Distribution.System(Platform(..),OS(..))
+import Distribution.Simple(defaultMainWithHooks,UserHooks(..),simpleUserHooks)
+import Distribution.Simple.LocalBuildInfo(LocalBuildInfo(..),absoluteInstallDirs,datadir)
+import Distribution.Simple.Setup(BuildFlags(..),Flag(..),InstallFlags(..),CopyDest(..),CopyFlags(..),SDistFlags(..))
+import Distribution.PackageDescription(PackageDescription(..),emptyHookedBuildInfo)
+import Distribution.Simple.BuildPaths(exeExtension)
+import System.FilePath((</>),(<.>))
 
-import Distribution.Simple
-import Distribution.Simple.LocalBuildInfo
-import Distribution.Simple.BuildPaths
-import Distribution.Simple.Utils
-import Distribution.Simple.Setup
-import Distribution.PackageDescription hiding (Flag)
-import Control.Monad
-import Data.Maybe
-import Data.List(isPrefixOf)
-import System.IO
-import System.Cmd
-import System.FilePath
-import System.Directory
-import System.Environment
-import System.Process
-import System.Exit
+import WebSetup
+
+-- | Notice about RGL not built anymore
+noRGLmsg :: IO ()
+noRGLmsg = putStrLn "Notice: the RGL is not built as part of GF anymore. See https://github.com/GrammaticalFramework/gf-rgl"
 
 main :: IO ()
-main = defaultMainWithHooks simpleUserHooks{ preBuild =checkRGLArgs
-                                           , postBuild=buildRGL
-                                           , preInst  =checkRGLArgs
-                                           , postInst =installRGL
-                                           , preCopy  =checkRGLArgs
-                                           , postCopy =copyRGL
-                                           , sDistHook=sdistRGL
-                                           , runTests =testRGL
-                                           }
-
---------------------------------------------------------
--- Commands for building the Resource Grammar Library
---------------------------------------------------------
-
-data Mode = AllTenses | Present | Minimal deriving Show
-all_modes = ["minimal","present","alltenses"]
-default_modes = [Present,AllTenses]
-
-data RGLCommand
-  = RGLCommand
-      { cmdName   :: String
-      , cmdIsDef  :: Bool
-      , cmdAction :: [Mode] -> [String] -> PackageDescription -> LocalBuildInfo -> IO ()
-      }
-
-rglCommands =
-  [ RGLCommand "prelude" True  $ \mode args pkg lbi -> do
-       putStrLn $ "Compiling [prelude]"
-       let prelude_src_dir = rgl_src_dir     </> "prelude"
-           prelude_dst_dir = rgl_dst_dir lbi </> "prelude"
-       createDirectoryIfMissing True prelude_dst_dir
-       files <- getDirectoryContents prelude_src_dir
-       run_gfc pkg lbi (["-s", "--gfo-dir="++prelude_dst_dir] ++ [prelude_src_dir </> file | file <- files, take 1 file /= "."])
-  , RGLCommand "lang"    True  $ \mode args pkg lbi -> do
-       mapM_ (gfc mode pkg lbi . lang) (optl langsLang args)
-       mapM_ (gfc mode pkg lbi . symbol) (optl langsAPI args)
-  , RGLCommand "compat"  True  $ \mode args pkg lbi -> do
-       mapM_ (gfc mode pkg lbi . compat) (optl langsCompat args)
-  , RGLCommand "api"     True  $ \mode args pkg lbi -> do
-       mapM_ (gfc mode pkg lbi . try) (optl langsAPI args)
-       mapM_ (gfc mode pkg lbi . symbolic) (optl langsSymbolic args)
-  , RGLCommand "pgf"     False $ \modes args pkg lbi ->
-     sequence_ [
-       do let dir = getRGLBuildDir lbi mode
-          createDirectoryIfMissing True dir
-          sequence_ [run_gfc pkg lbi ["-s","-make","-name=Lang"++la,
-                                       dir ++ "/Lang" ++ la ++ ".gfo"] 
-                      | (_,la) <- optl langsPGF args]
-          run_gfc pkg lbi (["-s","-make","-name=Lang"]++
-                           ["Lang" ++ la ++ ".pgf"|(_,la)<-optl langsPGF args])
-       | mode <- modes]
-  , RGLCommand "demo"    False $ \mode args pkg lbi -> do
-       let ls = optl langsDemo args
-       gf (demos "Demo" ls) ["demo/Demo" ++ la ++ ".gf" | (_,la) <- ls] pkg lbi
-       return ()
-  , RGLCommand "parse"   False $ \mode args pkg lbi -> do
-       mapM_ (gfc mode pkg lbi . parse) (optl langsParse args)
-  , RGLCommand "none"    False $ \mode args pkg lbi -> do
-       return ()
-  ]
+main = defaultMainWithHooks simpleUserHooks
+  { preBuild  = gfPreBuild
+  , postBuild = gfPostBuild
+  , preInst   = gfPreInst
+  , postInst  = gfPostInst
+  , postCopy  = gfPostCopy
+  , sDistHook = gfSDist
+  }
   where
-    optl ls args = getOptLangs ls args
+    gfPreBuild args  = gfPre args . buildDistPref
+    gfPreInst args = gfPre args . installDistPref
 
---------------------------------------------------------
+    gfPre args distFlag = do
+      return emptyHookedBuildInfo
 
-checkRGLArgs args flags = do
-  let args' = filter (\arg -> not (arg `elem` all_modes ||
-                                   rgl_prefix `isPrefixOf` arg ||
-                                   langs_prefix `isPrefixOf` arg)) args
-  if null args'
-    then return emptyHookedBuildInfo
-    else die $ "Unrecognised flags: " ++ intercalate ", " args'
+    gfPostBuild args flags pkg lbi = do
+      noRGLmsg
+      let gf = default_gf lbi
+      buildWeb gf flags (pkg,lbi)
 
-buildRGL args flags pkg lbi = do
-  let cmds = getRGLCommands args
-  let modes = getOptMode args
-  mapM_ (\cmd -> cmdAction cmd modes args pkg lbi) cmds
+    gfPostInst args flags pkg lbi = do
+      noRGLmsg
+      saveInstallPath args flags (pkg,lbi)
+      installWeb (pkg,lbi)
 
-installRGL args flags pkg lbi = do
-  let modes = getOptMode args
-  let inst_gf_lib_dir = datadir (absoluteInstallDirs pkg lbi NoCopyDest) </> "lib"
-  copyAll "prelude"   (rgl_dst_dir lbi </> "prelude") (inst_gf_lib_dir </> "prelude")
-  sequence_ [copyAll (show mode) (getRGLBuildDir lbi mode) (inst_gf_lib_dir </> getRGLBuildSubDir lbi mode)|mode<-modes]
+    gfPostCopy args flags  pkg lbi = do
+      noRGLmsg
+      saveCopyPath args flags (pkg,lbi)
+      copyWeb flags (pkg,lbi)
 
-copyRGL args flags pkg lbi = do
-  let modes = getOptMode args
-      dest = case copyDest flags of
-               NoFlag -> NoCopyDest
-               Flag d -> d
-  let inst_gf_lib_dir = datadir (absoluteInstallDirs pkg lbi dest) </> "lib"
-  copyAll "prelude"   (rgl_dst_dir lbi </> "prelude") (inst_gf_lib_dir </> "prelude")
-  sequence_ [copyAll (show mode) (getRGLBuildDir lbi mode) (inst_gf_lib_dir </> getRGLBuildSubDir lbi mode)|mode<-modes]
+    -- `cabal sdist` will not make a proper dist archive, for that see `make sdist`
+    -- However this function should exit quietly to allow building gf in sandbox
+    gfSDist pkg lbi hooks flags = do
+      return ()
 
-copyAll s from to = do
-  putStrLn $ "Installing [" ++ s ++ "] " ++ to
-  createDirectoryIfMissing True to
-  files <- fmap (filter (\f -> take 1 f /= ".")) $ getDirectoryContents from
-  mapM_ (\file -> copyFile (from </> file) (to </> file)) files
+saveInstallPath :: [String] -> InstallFlags -> (PackageDescription, LocalBuildInfo) -> IO ()
+saveInstallPath args flags bi = do
+  let
+    dest = NoCopyDest
+    dir = datadir (uncurry absoluteInstallDirs bi dest)
+  writeFile dataDirFile dir
 
-sdistRGL pkg mb_lbi hooks flags = do
-  paths <- getRGLFiles rgl_src_dir []
-  let pkg' = pkg{dataFiles=paths}
-  sDistHook simpleUserHooks pkg' mb_lbi hooks flags
+saveCopyPath :: [String] -> CopyFlags -> (PackageDescription, LocalBuildInfo) -> IO ()
+saveCopyPath args flags bi = do
+  let
+    dest = case copyDest flags of
+      NoFlag -> NoCopyDest
+      Flag d -> d
+    dir = datadir (uncurry absoluteInstallDirs bi dest)
+  writeFile dataDirFile dir
+
+-- | Name of file where installation's data directory is recording
+-- This is a last-resort way in which the seprate RGL build script
+-- can determine where to put the compiled RGL files
+dataDirFile :: String
+dataDirFile = "DATA_DIR"
+
+-- | Get path to locally-built gf
+default_gf :: LocalBuildInfo -> FilePath
+default_gf lbi = buildDir lbi </> exeName' </> exeNameReal
   where
-    getRGLFiles dir paths = do
-      files <- getDirectoryContents dir
-      foldM (processFile dir) paths [file | file <- files, file /= "." && file /= ".."]
-
-    processFile dir paths file = do
-      let path = dir </> file
-      print path
-      isFile <- doesFileExist path
-      if isFile
-        then if takeExtension file == ".gf" || file == "LICENSE"
-               then return (path : paths)
-               else return paths
-        else getRGLFiles path paths
-
-testRGL args _ pkg lbi = do
-  let paths = case args of
-                []    -> ["testsuite"]
-                paths -> paths
-  sequence_ [walk path | path <- paths]
-  where
-    walk path = do
-      files <- getDirectoryContents path
-      sequence_ [walkFile (path </> file) | file <- files, file /= "." && file /= ".."]
-
-    walkFile fpath = do
-      exists <- doesFileExist fpath
-      if exists
-        then if takeExtension fpath == ".gfs"
-               then do let in_file   = fpath
-                           gold_file = addExtension fpath ".gold"
-                           out_file  = addExtension fpath ".out"
-                       putStr (in_file++" ... ")
-                       hFlush stdout
-                       res <- runTest in_file out_file gold_file
-                       putStrLn (if res then "OK" else "FAIL")
-               else return ()
-        else walk fpath
-
-    runTest in_file out_file gold_file = do
-      inp <- readFile in_file
-      out <- readProcess (default_gf pkg lbi) ["-run"] inp
-      writeFile out_file out
-      exists <- doesFileExist gold_file
-      if exists
-        then do gold <- readFile gold_file
-                return $! (out == gold)
-        else return False
-
-
-rgl_src_dir     = "lib" </> "src"
-rgl_dst_dir lbi = buildDir lbi </> "rgl"
-
--- the languages have long directory names and short ISO codes (3 letters)
--- we also give the decodings for postprocessing linearizations, as long as grammars
--- don't support all flags needed; they are used in tests
- 
-langsCoding = [
-  (("amharic",  "Amh"),""),
-  (("arabic",   "Ara"),""),
-  (("bulgarian","Bul"),""),
-  (("catalan",  "Cat"),""),
-  (("danish",   "Dan"),""),
-  (("dutch",    "Dut"),""),
-  (("english",  "Eng"),""),
-  (("finnish",  "Fin"),""),
-  (("french",   "Fre"),""),
-  (("hindi",    "Hin"),"to_devanagari"),
-  (("german",   "Ger"),""),
-  (("interlingua","Ina"),""),
-  (("italian",  "Ita"),""),
-  (("latin",    "Lat"),""),
-  (("norwegian","Nor"),""),
-  (("polish",   "Pol"),""),
-  (("romanian", "Ron"),""),
-  (("russian",  "Rus"),""),
-  (("spanish",  "Spa"),""),
-  (("swedish",  "Swe"),""), 
-  (("thai",     "Tha"),"to_thai"),
-  (("turkish",  "Tur"),""),
-  (("urdu",     "Urd"),"")
-  ]
-
-langs = map fst langsCoding
-
--- default set of languages to compile
--- defaultLangs = langs `only` words "Eng Fre Ger Ita Spa Swe"
-
--- languagues for which to compile Lang
-langsLang = langs `except` ["Amh","Ara","Lat","Hin","Tha","Tur"]
---langsLang = langs `only` ["Fin"] --test
-
--- languages for which to compile Try 
-langsAPI  = langsLang `except` ["Hin","Ina","Tha"]
-
--- languages for which to compile Symbolic 
-langsSymbolic  = langsAPI `except` ["Rus"]
-
--- languages for which to run demo test
-langsDemo = langsLang `except` ["Ara","Hin","Ina","Tha"]
-
--- languages for which to compile parsing grammars
-langsParse = langs `only` ["Eng"]
-
--- languages for which langs.pgf is built
-langsPGF = langsLang `except` ["Ara","Hin","Ron","Tha"]
-
--- languages for which Compatibility exists (to be extended)
-langsCompat = langsLang `only` ["Cat","Eng","Fin","Fre","Ita","Spa","Swe"]
-
-gfc modes pkg lbi file = sequence_ [gfc1 mode pkg lbi file | mode<-modes]
-gfc1 mode pkg lbi file = do
-  let dir = getRGLBuildDir lbi mode
-      preproc = case mode of
-                  AllTenses -> ""
-                  Present   -> "-preproc="++({-rgl_src_dir </>-} "mkPresent")
-                  Minimal   -> "-preproc="++({-rgl_src_dir </>-} "mkMinimal")
-  createDirectoryIfMissing True dir
-  putStrLn $ "Compiling [" ++ show mode ++ "] " ++ file
-  run_gfc pkg lbi ["-s", preproc, "--gfo-dir="++dir, file]
-
-gf comm files pkg lbi = do
-  putStrLn $ "Reading " ++ unwords files
-  let gf = default_gf pkg lbi
-  putStrLn ("executing: " ++ comm ++ "\n" ++
-            "in " ++ gf)
-  out <- readProcess gf ("-s":files) comm
-  putStrLn out
-
-demos abstr ls = "gr -number=100 | l -treebank " ++ unlexer abstr ls ++ 
-           " | ps -to_html | wf -file=resdemo.html"
-
-lang   (lla,la) = rgl_src_dir </> lla </> ("All"           ++ la ++ ".gf")
-compat (lla,la) = rgl_src_dir </> lla </> ("Compatibility" ++ la ++ ".gf")
-symbol (lla,la) = rgl_src_dir </> lla </> ("Symbol"        ++ la ++ ".gf")
-
-try    (lla,la) = rgl_src_dir </> "api" </> ("Try"    ++ la ++ ".gf")
-syntax (lla,la) = rgl_src_dir </> "api" </> ("Syntax" ++ la ++ ".gf")
-
-symbolic (lla,la) = rgl_src_dir </> "api"   </> ("Symbolic" ++ la ++ ".gf")
-parse    (lla,la) = rgl_src_dir </> "parse" </> ("Parse"    ++ la ++ ".gf")
-
-except ls es = filter (flip notElem es . snd) ls
-only   ls es = filter (flip elem es . snd) ls
-
-getOptMode args =
-    if null explicit_modes
-    then default_modes
-    else explicit_modes
-  where
-    explicit_modes = 
-      [Minimal|have "minimal"]++
-      [Present|have "present"]++
-      [AllTenses|have "alltenses"]
-
-    have mode = mode `elem` args
-
--- list of languages overriding the definitions above
-getOptLangs defaultLangs args =
-    case [ls | arg <- args,
-               let (f,ls) = splitAt (length langs_prefix) arg,
-               f==langs_prefix] of
-      ('+':ls):_ -> foldr addLang defaultLangs (seps ls)
-      ('-':ls):_ -> foldr removeLang defaultLangs (seps ls)
-      ls:_ -> findLangs langs (seps ls)
-      _    -> defaultLangs
-  where
-    seps = words . map (\c -> if c==',' then ' ' else c)
-    findLangs langs ls = [lang | lang@(_,la) <- langs, la `elem` ls]
-    removeLang l ls = [lang | lang@(_,la) <- ls, la/=l]
-    addLang l ls = if null (findLangs ls [l])
-                   then findLangs langs [l]++ls
-                   else ls
-
-getRGLBuildSubDir lbi mode =
-  case mode of
-    AllTenses -> "alltenses"
-    Present   -> "present"
-    Minimal   -> "minimal"
-
-getRGLBuildDir lbi mode = rgl_dst_dir lbi </> getRGLBuildSubDir lbi mode
-
-getRGLCommands args =
-  let cmds0 = [cmd | arg <- args,
-                     let (prefix,name) = splitAt (length rgl_prefix) arg,
-                     prefix == rgl_prefix,
-                     cmd <- rglCommands,
-                     cmdName cmd == name]
-  in if null cmds0
-       then [cmd | cmd <- rglCommands, cmdIsDef cmd]
-       else cmds0
-
-langs_prefix = "langs="
-rgl_prefix = "rgl-"
-
-unlexer abstr ls = 
-  "-unlexer=\\\"" ++ unwords 
-      [abstr ++ la ++ "=" ++ unl | 
-        lla@(_,la) <- ls, let unl = unlex lla, not (null unl)] ++ 
-      "\\\""
-    where
-      unlex lla = maybe "" id $ lookup lla langsCoding
-
--- | Runs the gf executable in compile mode with the given arguments.
-run_gfc :: PackageDescription -> LocalBuildInfo -> [String] -> IO ()
-run_gfc pkg lbi args = 
-    do let args' = ["-batch","-gf-lib-path="++rgl_src_dir,"+RTS","-K32M","-RTS"] ++ filter (not . null) args
-           gf = default_gf pkg lbi
-       putStrLn $ "Running: " ++ gf ++ " " ++ unwords (map showArg args')
-       e <- rawSystem gf args'
-       case e of
-         ExitSuccess   -> return ()
-         ExitFailure i -> die $ "gf exited with exit code: " ++ show i
-  where showArg arg = "'" ++ arg ++ "'"
-
-default_gf pkg lbi = buildDir lbi </> exeName' </> exeNameReal
-  where
-    exeName' = (exeName . head . executables) pkg
-    exeNameReal = exeName' <.> (if null $ takeExtension exeName' then exeExtension else "")
+    -- shadows Distribution.Simple.BuildPaths.exeExtension, which changed type signature in Cabal 2.4
+    exeExtension = case hostPlatform lbi of
+      Platform arch Windows -> "exe"
+      _ -> ""
+    exeName' = "gf"
+    exeNameReal = exeName' <.> exeExtension

WebSetup.hs

@@ -0,0 +1,141 @@
+module WebSetup(buildWeb,installWeb,copyWeb,numJobs,execute) where
+
+import System.Directory(createDirectoryIfMissing,copyFile,doesDirectoryExist,doesFileExist)
+import System.FilePath((</>),dropExtension)
+import System.Process(rawSystem)
+import System.Exit(ExitCode(..))
+import Distribution.Simple.Setup(BuildFlags(..),Flag(..),CopyFlags(..),CopyDest(..),copyDest)
+import Distribution.Simple.LocalBuildInfo(LocalBuildInfo(..),datadir,buildDir,absoluteInstallDirs)
+import Distribution.PackageDescription(PackageDescription(..))
+
+{-
+   To test the GF web services, the minibar and the grammar editor, use
+   "cabal install" (or "runhaskell Setup.hs install") to install gf as usual.
+   Then start the server with the command "gf -server" and open
+   http://localhost:41296/ in your web browser (Firefox, Safari, Opera or
+   Chrome). The example grammars listed below will be available in the minibar.
+-}
+
+{-
+  Update 2018-07-04
+
+  The example grammars have now been removed from the GF repository.
+  This script will look for them in ../gf-contrib and build them from there if possible.
+  If not, the user will be given a message and nothing is build or copied.
+  (Unfortunately cabal install seems to hide all messages from stdout,
+  so users won't see this message unless they check the log.)
+-}
+
+example_grammars :: [(String, String, [String])] -- [(pgf, subdir, source modules)]
+example_grammars =
+   [("Letter.pgf","letter",letterSrc)
+   ,("Foods.pgf","foods",foodsSrc)
+   ,("Phrasebook.pgf","phrasebook",phrasebookSrc)
+   ]
+  where
+    foodsSrc = ["Foods"++lang++".gf"|lang<-foodsLangs]
+    foodsLangs = words "Afr Amh Bul Cat Cze Dut Eng Epo Fin Fre Ger Gle Heb Hin Ice Ita Jpn Lav Mlt Mon Nep Pes Por Ron Spa Swe Tha Tsn Tur Urd"
+
+    phrasebookSrc = ["Phrasebook"++lang++".gf"|lang<-phrasebookLangs]
+    phrasebookLangs = words "Bul Cat Chi Dan Dut Eng Lav Hin Nor Spa Swe Tha" -- only fastish languages
+
+    letterSrc = ["Letter"++lang++".gf"|lang<-letterLangs]
+    letterLangs = words "Eng Fin Fre Heb Rus Swe"
+
+contrib_dir :: FilePath
+contrib_dir = ".."</>"gf-contrib"
+
+buildWeb :: String -> BuildFlags -> (PackageDescription, LocalBuildInfo) -> IO ()
+buildWeb gf flags (pkg,lbi) = do
+  contrib_exists <- doesDirectoryExist contrib_dir
+  if contrib_exists
+  then mapM_ build_pgf example_grammars
+  else putStr $ unlines
+    [ "Example grammars are no longer included in the main GF repository, but have moved to gf-contrib."
+    , "If you want these example grammars to be built, clone this repository in the same top-level directory as GF:"
+    , "https://github.com/GrammaticalFramework/gf-contrib.git"
+    ]
+  where
+    gfo_dir = buildDir lbi </> "examples"
+
+    build_pgf :: (String, String, [String]) -> IO Bool
+    build_pgf (pgf,subdir,src) =
+      do createDirectoryIfMissing True tmp_dir
+         putStrLn $ "Building "++pgf
+         execute gf args
+      where
+        tmp_dir = gfo_dir</>subdir
+        dir = contrib_dir</>subdir
+        dest = NoCopyDest
+        gf_lib_path = datadir (absoluteInstallDirs pkg lbi dest) </> "lib"
+        args = numJobs flags++["-make","-s"] -- ,"-optimize-pgf"
+               ++["--gfo-dir="++tmp_dir,
+                --"--gf-lib-path="++gf_lib_path,
+                  "--name="++dropExtension pgf,
+                  "--output-dir="++gfo_dir]
+               ++[dir</>file|file<-src]
+
+installWeb :: (PackageDescription, LocalBuildInfo) -> IO ()
+installWeb = setupWeb NoCopyDest
+
+copyWeb :: CopyFlags -> (PackageDescription, LocalBuildInfo) -> IO ()
+copyWeb flags = setupWeb dest
+  where
+    dest = case copyDest flags of
+             NoFlag -> NoCopyDest
+             Flag d -> d
+
+setupWeb :: CopyDest -> (PackageDescription, LocalBuildInfo) -> IO ()
+setupWeb dest (pkg,lbi) = do
+  mapM_ (createDirectoryIfMissing True) [grammars_dir,cloud_dir]
+  contrib_exists <- doesDirectoryExist contrib_dir
+  if contrib_exists
+  then mapM_ copy_pgf example_grammars
+  else return () -- message already displayed from buildWeb
+  copyGFLogo
+  where
+    grammars_dir = www_dir </> "grammars"
+    cloud_dir = www_dir </> "tmp" -- hmm
+    logo_dir = www_dir </> "Logos"
+    www_dir = datadir (absoluteInstallDirs pkg lbi dest) </> "www"
+    gfo_dir = buildDir lbi </> "examples"
+
+    copy_pgf :: (String, String, [String]) -> IO ()
+    copy_pgf (pgf,subdir,_) =
+      do let src = gfo_dir </> pgf
+         let dst = grammars_dir </> pgf
+         ex <- doesFileExist src
+         if ex then do putStrLn $ "Installing "++dst
+                       copyFile src dst
+               else putStrLn $ "Not installing "++dst
+
+    gf_logo = "gf0.png"
+
+    copyGFLogo =
+      do createDirectoryIfMissing True logo_dir
+         copyFile ("doc"</>"Logos"</>gf_logo) (logo_dir</>gf_logo)
+
+-- | Run an arbitrary system command, returning False on failure
+execute :: String -> [String] -> IO Bool
+execute command args =
+  do let cmdline = command ++ " " ++ unwords (map showArg args)
+     e <- rawSystem command args
+     case e of
+       ExitSuccess   -> return True
+       ExitFailure i -> do putStrLn $ "Ran: " ++ cmdline
+                           putStrLn $ command++" exited with exit code: " ++ show i
+                           return False
+  where
+    showArg arg = if ' ' `elem` arg then "'" ++ arg ++ "'" else arg
+
+-- | This function is used to enable parallel compilation of the RGL and example grammars
+numJobs :: BuildFlags -> [String]
+numJobs flags =
+    if null n
+    then ["-j","+RTS","-A20M","-N","-RTS"]
+    else ["-j="++n,"+RTS","-A20M","-N"++n,"-RTS"]
+  where
+    -- buildNumJobs is only available in Cabal>=1.20
+    n = case buildNumJobs flags of
+          Flag mn | mn/=Just 1-> maybe "" show mn
+          _ -> ""

bin/build-binary-dist.sh

@@ -0,0 +1,104 @@
+#! /bin/bash
+
+### This script builds a binary distribution of GF from the source
+### package that this script is a part of. It assumes that you have installed
+### a recent version of the Haskell Platform.
+### Two binary package formats are supported: plain tar files (.tar.gz) and
+### OS X Installer packages (.pkg).
+
+os=$(uname)     # Operating system name (e.g. Darwin or Linux)
+hw=$(uname -m)  # Hardware name (e.g. i686 or x86_64)
+
+# GF version number:
+ver=$(grep -i ^version: gf.cabal | sed -e 's/version://' -e 's/ //g')
+
+name="gf-$ver"
+destdir="$PWD/dist/$name"          # assemble binary dist here
+prefix=${PREFIX:-/usr/local}       # where to install
+fmt=${FMT:-tar.gz}                 # binary package format (tar.gz or pkg)
+ghc=${GHC:-ghc}                    # which Haskell compiler to use
+
+extralib="$destdir$prefix/lib"
+extrainclude="$destdir$prefix/include"
+extra="--extra-lib-dirs=$extralib --extra-include-dirs=$extrainclude"
+
+set -e                             # Stop if an error occurs
+set -x                             # print commands before executing them
+
+## First configure & build the C run-time system
+pushd src/runtime/c
+bash setup.sh configure --prefix="$prefix"
+bash setup.sh build
+bash setup.sh install prefix="$destdir$prefix"
+popd
+
+## Build the python binding to the C run-time system
+if which >/dev/null python; then
+    pushd src/runtime/python
+    EXTRA_INCLUDE_DIRS="$extrainclude" EXTRA_LIB_DIRS="$extralib" python setup.py build
+    python setup.py install --prefix="$destdir$prefix"
+    if [ "$fmt" == pkg ] ; then
+	# A hack for Python on OS X to find the PGF modules
+	pyver=$(ls "$destdir$prefix/lib" | sed -n 's/^python//p')
+	pydest="$destdir/Library/Python/$pyver/site-packages"
+	mkdir -p "$pydest"
+	ln "$destdir$prefix/lib/python$pyver/site-packages"/pgf* "$pydest"
+    fi
+    popd
+else
+    echo "Python is not installed, so the Python binding will not be included"
+fi
+
+## Build the Java binding to the C run-time system
+if which >/dev/null javac && which >/dev/null jar ; then
+    pushd src/runtime/java
+    rm -f libjpgf.la # In case it contains the wrong INSTALL_PATH
+    if make CFLAGS="-I$extrainclude -L$extralib" INSTALL_PATH="$prefix/lib"
+    then
+	make INSTALL_PATH="$destdir$prefix/lib" install
+    else
+	echo "*** Skipping the Java binding because of errors"
+    fi
+    popd
+else
+    echo "Java SDK is not installed, so the Java binding will not be included"
+fi
+
+## Build GF, with C run-time support enabled
+cabal install -w "$ghc" --only-dependencies -fserver -fc-runtime $extra
+cabal configure -w "$ghc" --prefix="$prefix" -fserver -fc-runtime $extra
+DYLD_LIBRARY_PATH="$extralib" LD_LIBRARY_PATH="$extralib" cabal build
+  # Building the example grammars will fail, because the RGL is missing
+cabal copy --destdir="$destdir"  # create www directory
+
+## Build the RGL and copy it to $destdir
+PATH=$PWD/dist/build/gf:$PATH
+export GF_LIB_PATH="$(dirname $(find "$destdir" -name www))/lib"   # hmm
+mkdir -p "$GF_LIB_PATH"
+pushd ../gf-rgl
+make build
+make copy
+popd
+
+# Build GF again, including example grammars that need the RGL
+DYLD_LIBRARY_PATH="$extralib" LD_LIBRARY_PATH="$extralib" cabal build
+
+## Copy GF to $destdir
+cabal copy --destdir="$destdir"
+libdir=$(dirname $(find "$destdir" -name PGF.hi))
+cabal register --gen-pkg-config=$libdir/gf-$ver.conf
+
+## Create the binary distribution package
+case $fmt in
+    tar.gz)
+	targz="$name-bin-$hw-$os.tar.gz"     # the final tar file
+	tar -C "$destdir/$prefix" -zcf "dist/$targz" .
+	echo "Created $targz, consider renaming it to something more user friendly"
+	;;
+    pkg)
+	pkg=$name.pkg
+	pkgbuild --identifier org.grammaticalframework.gf.pkg --version "$ver" --root "$destdir" --install-location / dist/$pkg
+	echo "Created $pkg"
+esac
+
+rm -r "$destdir"

bin/clean_html

@@ -0,0 +1,20 @@
+#!/bin/bash
+
+# This script finds all .t2t (txt2tags) and .md (Markdown) files
+# and deletes the corresponding HTML file of the same name.
+
+find . -name '*.t2t' | while read t2t ; do
+  html="${t2t%.t2t}.html"
+  if [ -f "$html" ] ; then
+    echo "$html"
+    rm -f "$html"
+  fi
+done
+
+find . -name '*.md' | while read md ; do
+  html="${md%.md}.html"
+  if [ -f "$html" ] ; then
+    echo "$html"
+    rm -f "$html"
+  fi
+done

bin/template.html

@@ -0,0 +1,146 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" lang="$lang$" xml:lang="$lang$"$if(dir)$ dir="$dir$"$endif$>
+<head>
+  <meta charset="utf-8" />
+  <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+$for(author-meta)$
+  <meta name="author" content="$author-meta$" />
+$endfor$
+$if(date-meta)$
+  <meta name="dcterms.date" content="$date-meta$" />
+$endif$
+$if(keywords)$
+  <meta name="keywords" content="$for(keywords)$$keywords$$sep$, $endfor$" />
+$endif$
+  <title>$if(title-prefix)$$title-prefix$ – $endif$$pagetitle$</title>
+  <link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/bootstrap/4.1.3/css/bootstrap.min.css" integrity="sha384-MCw98/SFnGE8fJT3GXwEOngsV7Zt27NXFoaoApmYm81iuXoPkFOJwJ8ERdknLPMO" crossorigin="anonymous">
+  <link rel="stylesheet" href="https://use.fontawesome.com/releases/v5.4.2/css/all.css" integrity="sha384-/rXc/GQVaYpyDdyxK+ecHPVYJSN9bmVFBvjA/9eOB+pb3F2w2N6fc5qB9Ew5yIns" crossorigin="anonymous">
+$for(css)$
+  <link rel="stylesheet" href="$css$" />
+$endfor$
+$if(math)$
+  $math$
+$endif$
+  <!--[if lt IE 9]>
+    <script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
+  <![endif]-->
+$for(header-includes)$
+  $header-includes$
+$endfor$
+</head>
+<body class="bg-light">
+  <div class="bg-white pb-5">
+$for(include-before)$
+$include-before$
+$endfor$
+<div class="container-fluid py-5" style="max-width:1200px">
+
+$if(title)$
+<header id="title-block-header">
+<a href="$rel-root$" title="Home">
+  <img src="$rel-root$/doc/Logos/gf1.svg" height="200" class="float-md-right ml-3 mb-3 bg-white" alt="GF Logo">
+</a>
+<h1 class="title">$title$</h1>
+$if(subtitle)$
+<p class="subtitle">$subtitle$</p>
+$endif$
+$for(author)$
+<p class="author">$author$</p>
+$endfor$
+$if(date)$
+<p class="date">$date$</p>
+$endif$
+</header>
+$endif$
+$if(toc)$
+<nav id="$idprefix$TOC">
+$if(table-of-contents)$
+  <!-- pandoc >= 2.0 -->
+  $table-of-contents$
+$else$
+  <!-- pandoc < 2.0 -->
+  $toc$
+$endif$
+</nav>
+$endif$
+$body$
+</div><!-- .container -->
+</div><!-- .bg-white -->
+
+<footer class="py-5">
+  <div class="container">
+    <div class="row">
+
+      <div class="col-6 col-sm-3">
+        <a href="$rel-root$">
+          <i class="fas fa-home"></i>
+          Home
+        </a>
+        <h6 class="text-muted mt-3">Get started</h6>
+        <ul class="list-unstyled">
+          <li><a href="https://www.youtube.com/watch?v=x1LFbDQhbso">Google Tech Talk</a></li>
+          <li><a href="http://cloud.grammaticalframework.org/">GF Cloud</a></li>
+          <li>
+            <a href="$rel-root$/doc/tutorial/gf-tutorial.html">Tutorial</a>
+            /
+            <a href="$rel-root$/lib/doc/rgl-tutorial/index.html">RGL Tutorial</a>
+          </li>
+          <li><a href="$rel-root$/download"><strong>Download GF</strong></a></li>
+        </ul>
+      </div>
+
+      <div class="col-6 col-sm-3">
+        <h6 class="text-muted">Learn more</h6>
+        <ul class="list-unstyled">
+          <li><a href="$rel-root$/gf-book">The GF Book</a></li>
+          <li><a href="$rel-root$/doc/gf-refman.html">Reference Manual</a></li>
+          <li><a href="$rel-root$/doc/gf-shell-reference.html">GF Shell Reference</a></li>
+          <li><a href="http://www.molto-project.eu/sites/default/files/MOLTO_D2.3.pdf">Best Practices</a></li>
+          <li><a href="$rel-root$/lib/doc/synopsis/index.html"><strong>RGL Synopsis</strong></a></li>
+        </ul>
+      </div>
+
+      <div class="col-6 col-sm-3">
+        <h6 class="text-muted">Develop</h6>
+        <ul class="list-unstyled">
+          <li><a href="$rel-root$/doc/gf-developers.html">Developers Guide</a></li>
+          <li><a href="http://hackage.haskell.org/package/gf/docs/PGF.html">PGF library API (Haskell runtime)</a></li>
+          <li><a href="$rel-root$/doc/runtime-api.html">PGF library API (C runtime)</a></li>
+          <li><a href="http://hackage.haskell.org/package/gf/docs/GF.html">GF compiler API</a></li>
+          <li><a href="$rel-root$/doc/gf-editor-modes.html">Text Editor Support</a></li>
+        </ul>
+      </div>
+
+      <div class="col-6 col-sm-3">
+        <h6 class="text-muted">Contribute</h6>
+        <ul class="list-unstyled">
+          <li><a href="http://groups.google.com/group/gf-dev">Mailing List</a></li>
+          <li><a href="https://github.com/GrammaticalFramework/gf-core/issues">Issue Tracker</a></li>
+          <li><a href="$rel-root$/doc/gf-people.html">Authors</a></li>
+          <li><a href="http://school.grammaticalframework.org/2018/">Summer School</a></li>
+        </ul>
+        <h6 class="text-muted">
+          Repositories
+          <i class="fab fa-github ml-1"></i>
+        </h6>
+        <a href="https://github.com/GrammaticalFramework/gf-core">GF</a> ·
+        <a href="https://github.com/GrammaticalFramework/gf-rgl">RGL</a> ·
+        <a href="https://github.com/GrammaticalFramework/gf-contrib">Contributions</a>
+      </div>
+    </div>
+  </div>
+</footer>
+$for(include-after)$
+$include-after$
+$endfor$
+<script type="text/javascript">
+var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
+document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
+</script>
+<script type="text/javascript">
+try {
+var pageTracker = _gat._getTracker("UA-7811807-3");
+pageTracker._trackPageview();
+} catch(err) {}</script>
+</body>
+</html>

bin/update_html

@@ -1,11 +1,156 @@
 #!/bin/bash
 
-### This script finds all .t2t (txt2tags) files and updates the corresponding
-### .html file, if it is out-of-date.
+# Generate HTML from txt2tags (.t2t) and Markdown (.md)
+# Usage:
+# - update_html
+#   Look for all .t2t and .md files in the current directory and below,
+#   generating the output HTML when the source is newer than the HTML.
+# - update_html path/to/file.t2t path/to/another.md
+#   Generate HTML for the specified file(s), ignoring modification time.
+#
+# Requires:
+# - txt2tags for .t2t files. Tested with 2.6.
+# - pandoc for both .t2t and .md files. Tested with 1.16.0.2 and 2.3.1.
+# - the template file `template.html` in the same directory as this script.
+#
+# Tested with Ubuntu 16.04 and macOS Mojave.
+#
+# See also clean_html for removing the files generated by this script.
 
-find . -name '*.t2t' | while read t2t ; do
-  html="${t2t%.t2t}.html"
-  if [ "$t2t" -nt "$html" ] ; then
-    txt2tags -thtml "$t2t"
+# Path to directory where this script is
+# https://stackoverflow.com/a/246128/98600
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null && pwd )"
+
+# HTML template
+template="$DIR/template.html"
+
+# Render txt2tags into html file
+# Arguments:
+# 1. txt2tags source file, e.g. download/index.t2t
+# 2. html target file, e.g. download/index.html
+function render_t2t_html {
+  t2t="$1"
+  html="$2"
+  tmp="$2.tmp"
+  relroot="$( dirname $t2t | sed -E 's/^.\///' | sed -E 's/[^/]+/../g' )"
+
+  # First render with txt2tags to handle pre/post processing
+  txt2tags \
+    --target=html \
+    --no-headers \
+    --quiet \
+    --outfile="$tmp" \
+    --infile="$t2t"
+
+  # Replace <A NAME="toc3"></A> with <div id="toc3"></div> so that Pandoc retains it
+  # Do this for both cases since BSD sed doesn't support /i
+  sed -i.bak "s/<a name=\"\(.*\)\"><\/a>/<div id=\"\1\"><\/div>/" "$tmp"
+  sed -i.bak "s/<A NAME=\"\(.*\)\"><\/A>/<div id=\"\1\"><\/div>/" "$tmp"
+  rm -f "$tmp.bak"
+
+  # Capture first 3 lines of t2t file: title, author, date
+  # Documentation here: https://txt2tags.org/userguide/headerarea
+  l1=$(head -n 1 "$t2t")
+  l2=$(tail -n+2 "$t2t" | head -n 1)
+  l3=$(tail -n+3 "$t2t" | head -n 1)
+  title=
+  author=
+  date=
+  if [ -n "$l1" ] ; then
+    title="$l1"
+    if [ -n "$l2" ] ; then author="$l2" ; fi
+    if [ -n "$l3" ] ; then date="$l3" ; fi
   fi
-done
+
+  # Run txt2tag's HTML through Pandoc for cleanup
+  pandoc \
+    --from=html \
+    --to=html5 \
+    --standalone \
+    --template="$template" \
+    --variable="lang:en" \
+    --variable="rel-root:$relroot" \
+    --metadata="title:$title" \
+    --metadata="author:$author" \
+    --metadata="date:$date" \
+    "$tmp" \
+    --output="$html"
+  rm -f "$tmp"
+
+  # Final post-processing
+  if [ -f "$html" ] ; then
+    sed -i.bak "s/<table/<table class=\"table\"/" "$html" && rm "$html.bak"
+    echo "$html"
+  fi
+}
+
+# Render markdown into html file
+# Arguments:
+# 1. markdown source file, e.g. download/index.md
+# 2. html target file, e.g. download/index.html
+function render_md_html {
+  md="$1"
+  html="$2"
+  relroot="$( dirname $md | sed -E 's/^.\///' | sed -E 's/[^/]+/../g' )"
+
+  # Look for `show-toc: true` in metadata (first ten lines of file)
+  if head -n 10 "$md" | grep --quiet 'show-toc: true' ; then
+    tocflag='--table-of-contents'
+  else
+    tocflag=''
+  fi
+
+  pandoc \
+    --from=markdown \
+    --to=html5 \
+    --standalone \
+    $tocflag \
+    --template="$template" \
+    --variable="lang:en" \
+    --variable="rel-root:$relroot" \
+    "$md" \
+    --output="$html"
+
+  # Final post-processing
+  if [ -f "$html" ] ; then
+    # add "table" class to tables
+    sed -i.bak "s/<table/<table class=\"table\"/" "$html"
+    # rewrite anchors that Pandoc 1.16 ignores: [content]{#anchor} -> <span id="anchor">content</span>
+    sed -i.bak -E "s/\[(.*)\]\{#(.+)\}/<span id=\"\2\">\1<\/span>/" "$html"
+    rm -f "$html.bak"
+    echo "$html"
+  fi
+}
+
+# Main entry point
+# Script can be run in one of two modes:
+if [ $# -gt 0 ] ; then
+  # Render specific file(s) from args, ignoring dates
+  for file in "$@" ; do
+    ext="${file##*.}"
+    html="${file%.$ext}.html"
+    case $ext in
+      "md")
+        render_md_html "$file" "$html"
+        ;;
+      "t2t")
+        render_t2t_html "$file" "$html"
+        ;;
+    esac
+  done
+else
+  # Render all files found in cwd and deeper if source is newer
+  find . -name '*.t2t' | while read file ; do
+    html="${file%.t2t}.html"
+    if [ "$file" -nt "$html" ] || [ "$template" -nt "$html" ] ; then
+      render_t2t_html "$file" "$html"
+    fi
+  done
+  find . -name '*.md' | while read file ; do
+    if [[ "$file" == *"README.md" ]] ; then continue ; fi
+    html="${file%.md}.html"
+    if [ "$file" -nt "$html" ] || [ "$template" -nt "$html" ] ; then
+      render_md_html "$file" "$html"
+    fi
+  done
+fi

build-binary-dist.sh

@@ -1,35 +0,0 @@
-#! /bin/bash
-
-### This script builds a binary distribution of GF from the source package
-### that this script is a part of. It also assumes that you have installed
-### the Haskell Platform, version 2010.1.0.0 or 2010.2.0.0
-
-destdir=/tmp/gf-build-binary-dist  # assemble binary dist here
-prefix=/usr/local                  # where to install
-targz=gf-bin.tar.gz                # the final tar file, should be renamed 
-langs=""                           # which languages?
-#langs="langs=-Pol" # temporary problem with Polish, omit it
-
-set -e                             # Stop if an error occurs
-set -x                             # print commands before exuting them
-
-cabal install    # gf needs to be installed before building gf-server below
-
-runhaskell Setup.hs configure --user --prefix $prefix
-runhaskell Setup.hs build $langs
-runhaskell Setup.hs copy --destdir=$destdir $langs
-
-(
-cd src/server
-
-## If you don't already have the packages gf-server depends on, this is
-## the easiest way to install them:
-#cabal install
-
-runhaskell Setup.hs configure --user --prefix $prefix
-runhaskell Setup.hs build
-runhaskell Setup.hs copy --destdir=$destdir
-)
-tar -C $destdir/$prefix -zcf $targz .
-echo "Created $targz, rename it to something more informative"
-rm -r $destdir

contrib/c-bindings/PGFFFI.hs

@@ -1,232 +0,0 @@
--- GF C Bindings
--- Copyright (C) 2008-2010 Kevin Kofler
---
--- This library is free software; you can redistribute it and/or
--- modify it under the terms of the GNU Lesser General Public
--- License as published by the Free Software Foundation; either
--- version 2.1 of the License, or (at your option) any later version.
---
--- This library is distributed in the hope that it will be useful,
--- but WITHOUT ANY WARRANTY; without even the implied warranty of
--- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
--- Lesser General Public License for more details.
---
--- You should have received a copy of the GNU Lesser General Public
--- License along with this library; if not, see <http://www.gnu.org/licenses/>.
-
-
-module PGFFFI where
-
-import PGF
-import CString
-import Foreign
-import Foreign.C.Types
-import Control.Exception
-import IO
-import Data.Maybe
--- import GF.Text.Lexing
-
-
--- Utility functions used in the implementation (not exported):
-
--- This is a kind of a hack, the FFI spec doesn't guarantee that this will work.
--- The alternative would be to use Ptr () instead of StablePtr a everywhere.
-nullStablePtr :: StablePtr a
-nullStablePtr = (castPtrToStablePtr nullPtr)
-
-sizeOfStablePtr :: Int
-sizeOfStablePtr = (sizeOf (nullStablePtr))
-
-storeList :: [a] -> Ptr (StablePtr a) -> IO ()
-storeList list buf = do
-  case list of
-    carlist:cdrlist -> do
-      sptr <- (newStablePtr carlist)
-      (poke buf sptr)
-      (storeList cdrlist (plusPtr buf sizeOfStablePtr))
-    [] -> (poke buf nullStablePtr)
-
-listToArray :: [a] -> IO (Ptr (StablePtr a))
-listToArray list = do
-    buf <- (mallocBytes ((sizeOfStablePtr) * ((length list) + 1)))
-    (storeList list buf)
-    return buf
-
-
--- * PGF
-foreign export ccall "gf_freePGF" freeStablePtr :: StablePtr PGF -> IO ()
-
-foreign export ccall gf_readPGF :: CString -> IO (StablePtr PGF)
-gf_readPGF path = do
-  p <- (peekCString path)
-  result <- (readPGF p)
-  (newStablePtr result)
-
--- * Identifiers
-foreign export ccall "gf_freeCId" freeStablePtr :: StablePtr CId -> IO ()
-
-foreign export ccall gf_mkCId :: CString -> IO (StablePtr CId)
-gf_mkCId str = do
-  s <- (peekCString str)
-  (newStablePtr (mkCId s))
-
-foreign export ccall gf_wildCId :: IO (StablePtr CId)
-gf_wildCId = do
-  (newStablePtr (wildCId))
-
-foreign export ccall gf_showCId :: StablePtr CId -> IO CString
-gf_showCId cid = do
-  c <- (deRefStablePtr cid)
-  (newCString (showCId c))
-
-foreign export ccall gf_readCId :: CString -> IO (StablePtr CId)
-gf_readCId str = do
-  s <- (peekCString str)
-  case (readCId s) of
-    Just x -> (newStablePtr x)
-    Nothing -> (return (nullStablePtr))
-
--- TODO: So we can create, print and free a CId, but can we do anything useful with it?
---       We need some kind of C wrapper for the tree datastructures.
-
--- * Languages
-foreign export ccall "gf_freeLanguage" freeStablePtr :: StablePtr Language -> IO ()
-
-foreign export ccall gf_showLanguage :: StablePtr Language -> IO CString
-gf_showLanguage lang = do
-  l <- (deRefStablePtr lang)
-  (newCString (showLanguage l))
-
-foreign export ccall gf_readLanguage :: CString -> IO (StablePtr Language)
-gf_readLanguage str = do
-  s <- (peekCString str)
-  case (readLanguage s) of
-    Just x -> (newStablePtr x)
-    Nothing -> (return (nullStablePtr))
-
-foreign export ccall gf_languages :: StablePtr PGF -> IO (Ptr (StablePtr Language))
-gf_languages pgf = do
-  p <- (deRefStablePtr pgf)
-  (listToArray (languages p))
-
-foreign export ccall gf_abstractName :: StablePtr PGF -> IO (StablePtr Language)
-gf_abstractName pgf = do
-  p <- (deRefStablePtr pgf)
-  (newStablePtr (abstractName p))
-
-foreign export ccall gf_languageCode :: StablePtr PGF -> StablePtr Language -> IO CString
-gf_languageCode pgf lang = do
-  p <- (deRefStablePtr pgf)
-  l <- (deRefStablePtr lang)
-  case (languageCode p l) of
-    Just s -> (newCString s)
-    Nothing -> (return nullPtr)
-
--- * Types
-foreign export ccall "gf_freeType" freeStablePtr :: StablePtr Type -> IO ()
-
--- TODO: Hypo
-
--- TODO: allow nonempty scope
-foreign export ccall gf_showType :: StablePtr Type -> IO CString
-gf_showType tp = do
-  t <- (deRefStablePtr tp)
-  (newCString (showType [] t))
-
-foreign export ccall gf_readType :: CString -> IO (StablePtr Type)
-gf_readType str = do
-  s <- (peekCString str)
-  case (readType s) of
-    Just x -> (newStablePtr x)
-    Nothing -> (return (nullStablePtr))
-
--- TODO: mkType, mkHypo, mkDepHypo, mkImplHypo
-
-foreign export ccall gf_categories :: StablePtr PGF -> IO (Ptr (StablePtr CId))
-gf_categories pgf = do
-  p <- (deRefStablePtr pgf)
-  (listToArray (categories p))
-
-foreign export ccall gf_startCat :: StablePtr PGF -> IO (StablePtr Type)
-gf_startCat pgf = do
-  p <- (deRefStablePtr pgf)
-  (newStablePtr (startCat p))
-
--- TODO: * Functions
-
--- * Expressions & Trees
--- ** Tree
-foreign export ccall "gf_freeTree" freeStablePtr :: StablePtr Tree -> IO ()
-
--- ** Expr
-foreign export ccall "gf_freeExpr" freeStablePtr :: StablePtr Expr -> IO ()
-
--- TODO: allow nonempty scope
-foreign export ccall gf_showExpr :: StablePtr Expr -> IO CString
-gf_showExpr expr = do
-  e <- (deRefStablePtr expr)
-  (newCString (showExpr [] e))
-
-foreign export ccall gf_readExpr :: CString -> IO (StablePtr Expr)
-gf_readExpr str = do
-  s <- (peekCString str)
-  case (readExpr s) of
-    Just x -> (newStablePtr x)
-    Nothing -> (return (nullStablePtr))
-
--- * Operations
--- ** Linearization
-foreign export ccall gf_linearize :: StablePtr PGF -> StablePtr Language -> StablePtr Tree -> IO CString
-gf_linearize pgf lang tree = do
-  p <- (deRefStablePtr pgf)
-  l <- (deRefStablePtr lang)
-  t <- (deRefStablePtr tree)
-  (newCString (linearize p l t))
-
--- TODO: linearizeAllLang, linearizeAll, bracketedLinearize, tabularLinearizes
--- TODO: groupResults
-
-foreign export ccall gf_showPrintName :: StablePtr PGF -> StablePtr Language -> StablePtr CId -> IO CString
-gf_showPrintName pgf lang cid = do
-  p <- (deRefStablePtr pgf)
-  l <- (deRefStablePtr lang)
-  c <- (deRefStablePtr cid)
-  (newCString (showPrintName p l c))
-
--- TODO: BracketedString(..), FId, LIndex, Forest.showBracketedString
-
--- ** Parsing
-foreign export ccall gf_parse :: StablePtr PGF -> StablePtr Language -> StablePtr Type -> CString -> IO (Ptr (StablePtr Tree))
-gf_parse pgf lang cat input = do
-  p <- (deRefStablePtr pgf)
-  l <- (deRefStablePtr lang)
-  c <- (deRefStablePtr cat)
-  i <- (peekCString input)
-  (listToArray (parse p l c i))
-
--- TODO: parseAllLang, parseAll, parse_, parseWithRecovery
-
--- TODO: ** Evaluation
--- TODO: ** Type Checking
--- TODO: ** Low level parsing API
--- TODO: ** Generation
--- TODO: ** Morphological Analysis
--- TODO: ** Visualizations
-
--- TODO: * Browsing
-
--- GF.Text.Lexing:
-
--- foreign export ccall gf_stringOp :: CString -> CString -> IO CString
--- gf_stringOp op str = do
---   o <- (peekCString op)
---   s <- (peekCString str)
---   case (stringOp o) of
---     Just fn -> (newCString (fn s))
---     Nothing -> (return nullPtr)
-
-
--- Unused (exception handling):
---  (Control.Exception.catch (listToArray (parse p l c i)) (\(e::SomeException) -> do
---  (hPutStr stderr ("error: " ++ show e))
---  (return nullPtr)))

contrib/c-bindings/build-gfctest.sh

@@ -1,22 +0,0 @@
-#!/bin/sh
-
-# GF C Bindings
-# Copyright (C) 2008-2010 Kevin Kofler
-#
-# This library is free software; you can redistribute it and/or
-# modify it under the terms of the GNU Lesser General Public
-# License as published by the Free Software Foundation; either
-# version 2.1 of the License, or (at your option) any later version.
-#
-# This library is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-# Lesser General Public License for more details.
-#
-# You should have received a copy of the GNU Lesser General Public
-# License along with this library; if not, see <http://www.gnu.org/licenses/>.
-src=../../src
-import=-i$src/runtime/haskell:$src/compiler
-gf --make ../../examples/tutorial/embedded/QueryEng.gf &&
-ghc $import --make -fglasgow-exts -O2 -no-hs-main $* -c PGFFFI.hs &&
-ghc $import --make -fglasgow-exts -O2 -no-hs-main $* gfctest.c gf_lexing.c PGFFFI.hs -o gfctest

contrib/c-bindings/gf_lexing.c

@@ -1,287 +0,0 @@
-/* GF C Bindings
-   Copyright (C) 2010 Kevin Kofler
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License as published by the Free Software Foundation; either
-   version 2.1 of the License, or (at your option) any later version.
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, see <http://www.gnu.org/licenses/>.
-*/
-
-#include "gf_lexing.h"
-#include <stddef.h>
-#include <stdlib.h>
-#include <string.h>
-#include <ctype.h>
-
-typedef char **(*GF_Lexer)(const char *str);
-typedef char *(*GF_Unlexer)(char **arr);
-
-static inline void freev(char **p)
-{
-  char **q = p;
-  while (*q)
-    free(*(q++));
-  free(p);
-}
-
-static char **words(const char *str)
-{
-  unsigned char *buf = (unsigned char *) strdup(str);
-  unsigned char *p = buf, *q;
-  char **result, **r;
-  size_t count = 0u;
-  while (isspace(*p)) p++;
-  q = p;
-  if (*p) count++;
-  while (*p) {
-    if (isspace(*p)) {
-      *(p++) = 0;
-      while (isspace(*p)) *(p++) = 0;
-      if (*p) count++;
-    } else p++;
-  }
-  r = result = malloc((count+1)*sizeof(char *));
-  if (count) while (1) {
-    *(r++) = strdup((char *) q);
-    if (!--count) break;
-    while (*q) q++;
-    while (!*q) q++;
-  }
-  *r = NULL;
-  return result;
-}
-
-static char *unwords(char **arr)
-{
-  size_t len = 0u;
-  char **p = arr, *result, *r;
-  while (*p)
-    len += strlen(*(p++)) + 1u;
-  if (!len) return calloc(1, 1);
-  r = result = malloc(len);
-  p = arr;
-  while (1) {
-    size_t l = strlen(*p);
-    strcpy(r, *(p++));
-    if (!*p) break;
-    r += l;
-    *(r++) = ' ';
-  }
-  return result;
-}
-
-static char **lines(const char *str)
-{
-  unsigned char *buf = (unsigned char *) strdup(str);
-  unsigned char *p = buf, *q;
-  char **result, **r;
-  size_t count = 0u;
-  while (*p == '\n') p++;
-  q = p;
-  if (*p) count++;
-  while (*p) {
-    if (*p == '\n') {
-      *(p++) = 0;
-      while (*p == '\n') *(p++) = 0;
-      if (*p) count++;
-    } else p++;
-  }
-  r = result = malloc((count+1)*sizeof(char *));
-  if (count) while (1) {
-    *(r++) = strdup((char *) q);
-    if (!--count) break;
-    while (*q) q++;
-    while (!*q) q++;
-  }
-  *r = NULL;
-  return result;
-}
-
-static char *unlines(char **arr)
-{
-  size_t len = 0u;
-  char **p = arr, *result, *r;
-  while (*p)
-    len += strlen(*(p++)) + 1u;
-  if (!len) return calloc(1, 1);
-  r = result = malloc(len);
-  p = arr;
-  while (1) {
-    size_t l = strlen(*p);
-    strcpy(r, *(p++));
-    if (!*p) break;
-    r += l;
-    *(r++) = '\n';
-  }
-  return result;
-}
-
-static char *appLexer(GF_Lexer f, const char *str)
-{
-  char **arr = f(str), **p = arr, *result;
-  int ofs = 0;
-  while (*p && **p) p++;
-  while (*p) {
-    if (**p) p[-ofs] = *p; else ofs++;
-    p++;
-  }
-  p[-ofs] = NULL;
-  result = unwords(arr);
-  freev(arr);
-  return result;
-}
-
-static char *appUnlexer(GF_Unlexer f, const char *str)
-{
-  char **arr = lines(str), **p = arr, *result;
-  while (*p) {
-    char **warr = words(*p);
-    free(*p);
-    *(p++) = f(warr);
-    freev(warr);
-  }
-  result = unlines(arr);
-  freev(arr);
-  return result;
-}
-
-static inline int isPunct(char c)
-{
-  return c && strchr(".?!,:;", c);
-}
-
-static inline int isMajorPunct(char c)
-{
-  return c && strchr(".?!", c);
-}
-
-static inline int isMinorPunct(char c)
-{
-  return c && strchr(",:;", c);
-}
-
-static char *charToStr(char c)
-{
-  char *result = malloc(2), *p = result;
-  *(p++) = c;
-  *p = 0;
-  return result;
-}
-
-static char **lexChars(const char *str)
-{
-  char **result = malloc((strlen(str)+1)*sizeof(char *)), **r = result;
-  const char *p = str;
-  while (*p) {
-    if (!isspace(*p)) *(r++) = charToStr(*p);
-    p++;
-  }
-  *r = NULL;
-  return result;
-}
-
-static char **lexText(const char *str)
-{
-  char **result = malloc((strlen(str)+1)*sizeof(char *)), **r = result;
-  const char *p = str;
-  int uncap = 1;
-  while (*p) {
-    if (isMajorPunct(*p)) {
-      *(r++) = charToStr(*(p++));
-      uncap = 1;
-    } else if (isMinorPunct(*p)) {
-      *(r++) = charToStr(*(p++));
-      uncap = 0;
-    } else if (isspace(*p)) {
-      p++;
-      uncap = 0;
-    } else {
-      const char *q = p;
-      char *word;
-      size_t l;
-      while (*p && !isspace(*p) && !isPunct(*p)) p++;
-      l = p - q;
-      word = malloc(l + 1);
-      strncpy(word, q, l);
-      word[l] = 0;
-      if (uncap) *word = tolower(*word);
-      *(r++) = word;
-      uncap = 0;
-    }
-  }
-  *r = NULL;
-  return result;
-}
-
-static char *unlexText(char **arr)
-{
-  size_t len = 0u;
-  char **p = arr, *result, *r;
-  int cap = 1;
-  while (*p)
-    len += strlen(*(p++)) + 1u;
-  if (!len) return calloc(1, 1);
-  r = result = malloc(len);
-  p = arr;
-  while (1) {
-    size_t l = strlen(*p);
-    char *word = *(p++);
-    if (*word == '"' && word[l-1] == '"') word++, l--;
-    strncpy(r, word, l);
-    if (cap) *r = toupper(*r);
-    if (!*p) break;
-    r += l;
-    if (isPunct(**p) && !(*p)[1]) {
-      *(r++) = **p;
-      if (!p[1]) break;
-      cap = isMajorPunct(**(p++));
-    } else cap = 0;
-    *(r++) = ' ';
-  }
-  *r = 0;
-  return result;
-
-}
-
-static char *stringop_chars(const char *str)
-{
-  return appLexer(lexChars, str);
-}
-
-static char *stringop_lextext(const char *str)
-{
-  return appLexer(lexText, str);
-}
-
-static char *stringop_words(const char *str)
-{
-  return appLexer(words, str);
-}
-
-static char *stringop_unlextext(const char *str)
-{
-  return appUnlexer(unlexText, str);
-}
-
-static char *stringop_unwords(const char *str)
-{
-  return appUnlexer(unwords, str);
-}
-
-GF_StringOp gf_stringOp(const char *op)
-{
-  if (!strcmp(op, "chars")) return stringop_chars;
-  if (!strcmp(op, "lextext")) return stringop_lextext;
-  if (!strcmp(op, "words")) return stringop_words;
-  if (!strcmp(op, "unlextext")) return stringop_unlextext;
-  if (!strcmp(op, "unwords")) return stringop_unwords;
-  return NULL;
-}

contrib/c-bindings/gf_lexing.h

@@ -1,26 +0,0 @@
-/* GF C Bindings
-   Copyright (C) 2010 Kevin Kofler
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License as published by the Free Software Foundation; either
-   version 2.1 of the License, or (at your option) any later version.
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, see <http://www.gnu.org/licenses/>.
-*/
-
-/* Function pointer type which applies a string operation to str, which is
-   assumed to be non-NULL.
-   The resulting string can be assumed to be non-NULL and must be freed using
-   free. */
-typedef char *(*GF_StringOp)(const char *str);
-
-/* Returns a GF_StringOp applying the operation op if available, otherwise
-   NULL. op is assumed to be non-NULL. The GF_StringOp MUST NOT be freed. */
-GF_StringOp gf_stringOp(const char *op);

contrib/c-bindings/gfctest.c

@@ -1,50 +0,0 @@
-/* GF C Bindings
-   Copyright (C) 2008-2009 Kevin Kofler
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License as published by the Free Software Foundation; either
-   version 2.1 of the License, or (at your option) any later version.
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, see <http://www.gnu.org/licenses/>.
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include "pgf.h"
-#include "gf_lexing.h"
-
-int main(int argc, char *argv[])
-{
-  gf_init(&argc, &argv);
-
-  GF_PGF pgf = gf_readPGF("Query.pgf");
-  GF_Language lang = gf_readLanguage("QueryEng");
-  GF_Type cat = gf_startCat(pgf);
-  char *lexed = gf_stringOp("lextext")("Is 2 prime");
-  // char *lexed = "is 23 odd";
-  GF_Tree *result = gf_parse(pgf, lang, cat, lexed);
-  free(lexed);
-  GF_Tree *p = result;
-  if (*p) {
-    do {
-      char *str = gf_showExpr(*(p++));
-      puts(str);
-      free(str);
-    } while (*p);
-  } else
-    puts("no match");
-  gf_freeTrees(result);
-  gf_freeType(cat);
-  gf_freeLanguage(lang);
-  gf_freePGF(pgf);
-
-  gf_exit();
-  return 0;
-}

contrib/c-bindings/gpl-3.0.txt

@@ -1,674 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
-  The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works.  By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users.  We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors.  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
-  To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights.  Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received.  You must make sure that they, too, receive
-or can get the source code.  And you must show them these terms so they
-know their rights.
-
-  Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
-  For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software.  For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
-  Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so.  This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software.  The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable.  Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products.  If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
-  Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary.  To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                       TERMS AND CONDITIONS
-
-  0. Definitions.
-
-  "This License" refers to version 3 of the GNU General Public License.
-
-  "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
-  "The Program" refers to any copyrightable work licensed under this
-License.  Each licensee is addressed as "you".  "Licensees" and
-"recipients" may be individuals or organizations.
-
-  To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy.  The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
-  A "covered work" means either the unmodified Program or a work based
-on the Program.
-
-  To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy.  Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
-  To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies.  Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
-  An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License.  If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
-  1. Source Code.
-
-  The "source code" for a work means the preferred form of the work
-for making modifications to it.  "Object code" means any non-source
-form of a work.
-
-  A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
-  The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form.  A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
-  The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities.  However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work.  For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
-  The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
-  The Corresponding Source for a work in source code form is that
-same work.
-
-  2. Basic Permissions.
-
-  All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met.  This License explicitly affirms your unlimited
-permission to run the unmodified Program.  The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work.  This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
-  You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force.  You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright.  Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
-  Conveying under any other circumstances is permitted solely under
-the conditions stated below.  Sublicensing is not allowed; section 10
-makes it unnecessary.
-
-  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
-  No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
-  When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
-  4. Conveying Verbatim Copies.
-
-  You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
-  You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
-  5. Conveying Modified Source Versions.
-
-  You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
-    a) The work must carry prominent notices stating that you modified
-    it, and giving a relevant date.
-
-    b) The work must carry prominent notices stating that it is
-    released under this License and any conditions added under section
-    7.  This requirement modifies the requirement in section 4 to
-    "keep intact all notices".
-
-    c) You must license the entire work, as a whole, under this
-    License to anyone who comes into possession of a copy.  This
-    License will therefore apply, along with any applicable section 7
-    additional terms, to the whole of the work, and all its parts,
-    regardless of how they are packaged.  This License gives no
-    permission to license the work in any other way, but it does not
-    invalidate such permission if you have separately received it.
-
-    d) If the work has interactive user interfaces, each must display
-    Appropriate Legal Notices; however, if the Program has interactive
-    interfaces that do not display Appropriate Legal Notices, your
-    work need not make them do so.
-
-  A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit.  Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
-  6. Conveying Non-Source Forms.
-
-  You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
-    a) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by the
-    Corresponding Source fixed on a durable physical medium
-    customarily used for software interchange.
-
-    b) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by a
-    written offer, valid for at least three years and valid for as
-    long as you offer spare parts or customer support for that product
-    model, to give anyone who possesses the object code either (1) a
-    copy of the Corresponding Source for all the software in the
-    product that is covered by this License, on a durable physical
-    medium customarily used for software interchange, for a price no
-    more than your reasonable cost of physically performing this
-    conveying of source, or (2) access to copy the
-    Corresponding Source from a network server at no charge.
-
-    c) Convey individual copies of the object code with a copy of the
-    written offer to provide the Corresponding Source.  This
-    alternative is allowed only occasionally and noncommercially, and
-    only if you received the object code with such an offer, in accord
-    with subsection 6b.
-
-    d) Convey the object code by offering access from a designated
-    place (gratis or for a charge), and offer equivalent access to the
-    Corresponding Source in the same way through the same place at no
-    further charge.  You need not require recipients to copy the
-    Corresponding Source along with the object code.  If the place to
-    copy the object code is a network server, the Corresponding Source
-    may be on a different server (operated by you or a third party)
-    that supports equivalent copying facilities, provided you maintain
-    clear directions next to the object code saying where to find the
-    Corresponding Source.  Regardless of what server hosts the
-    Corresponding Source, you remain obligated to ensure that it is
-    available for as long as needed to satisfy these requirements.
-
-    e) Convey the object code using peer-to-peer transmission, provided
-    you inform other peers where the object code and Corresponding
-    Source of the work are being offered to the general public at no
-    charge under subsection 6d.
-
-  A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
-  A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling.  In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage.  For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product.  A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
-  "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source.  The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
-  If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information.  But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
-  The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed.  Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
-  Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
-  7. Additional Terms.
-
-  "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law.  If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
-  When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it.  (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.)  You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
-  Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
-    a) Disclaiming warranty or limiting liability differently from the
-    terms of sections 15 and 16 of this License; or
-
-    b) Requiring preservation of specified reasonable legal notices or
-    author attributions in that material or in the Appropriate Legal
-    Notices displayed by works containing it; or
-
-    c) Prohibiting misrepresentation of the origin of that material, or
-    requiring that modified versions of such material be marked in
-    reasonable ways as different from the original version; or
-
-    d) Limiting the use for publicity purposes of names of licensors or
-    authors of the material; or
-
-    e) Declining to grant rights under trademark law for use of some
-    trade names, trademarks, or service marks; or
-
-    f) Requiring indemnification of licensors and authors of that
-    material by anyone who conveys the material (or modified versions of
-    it) with contractual assumptions of liability to the recipient, for
-    any liability that these contractual assumptions directly impose on
-    those licensors and authors.
-
-  All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10.  If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term.  If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
-  If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
-  Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
-  8. Termination.
-
-  You may not propagate or modify a covered work except as expressly
-provided under this License.  Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
-  However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
-  Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
-  Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License.  If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
-  9. Acceptance Not Required for Having Copies.
-
-  You are not required to accept this License in order to receive or
-run a copy of the Program.  Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance.  However,
-nothing other than this License grants you permission to propagate or
-modify any covered work.  These actions infringe copyright if you do
-not accept this License.  Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
-  10. Automatic Licensing of Downstream Recipients.
-
-  Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License.  You are not responsible
-for enforcing compliance by third parties with this License.
-
-  An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations.  If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
-  You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License.  For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
-  11. Patents.
-
-  A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based.  The
-work thus licensed is called the contributor's "contributor version".
-
-  A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version.  For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
-  Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
-  In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement).  To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
-  If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients.  "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
-  If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
-  A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License.  You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
-  Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
-  12. No Surrender of Others' Freedom.
-
-  If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all.  For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
-  13. Use with the GNU Affero General Public License.
-
-  Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work.  The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
-  14. Revised Versions of this License.
-
-  The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-  Each version is given a distinguishing version number.  If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation.  If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
-  If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
-  Later license versions may give you additional or different
-permissions.  However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
-  15. Disclaimer of Warranty.
-
-  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. Limitation of Liability.
-
-  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
-  17. Interpretation of Sections 15 and 16.
-
-  If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.

contrib/c-bindings/lgpl-2.1.txt

@@ -1,504 +0,0 @@
-		  GNU LESSER GENERAL PUBLIC LICENSE
-		       Version 2.1, February 1999
-
- Copyright (C) 1991, 1999 Free Software Foundation, Inc.
- 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-[This is the first released version of the Lesser GPL.  It also counts
- as the successor of the GNU Library Public License, version 2, hence
- the version number 2.1.]
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-Licenses are intended to guarantee your freedom to share and change
-free software--to make sure the software is free for all its users.
-
-  This license, the Lesser General Public License, applies to some
-specially designated software packages--typically libraries--of the
-Free Software Foundation and other authors who decide to use it.  You
-can use it too, but we suggest you first think carefully about whether
-this license or the ordinary General Public License is the better
-strategy to use in any particular case, based on the explanations below.
-
-  When we speak of free software, we are referring to freedom of use,
-not price.  Our General Public Licenses are designed to make sure that
-you have the freedom to distribute copies of free software (and charge
-for this service if you wish); that you receive source code or can get
-it if you want it; that you can change the software and use pieces of
-it in new free programs; and that you are informed that you can do
-these things.
-
-  To protect your rights, we need to make restrictions that forbid
-distributors to deny you these rights or to ask you to surrender these
-rights.  These restrictions translate to certain responsibilities for
-you if you distribute copies of the library or if you modify it.
-
-  For example, if you distribute copies of the library, whether gratis
-or for a fee, you must give the recipients all the rights that we gave
-you.  You must make sure that they, too, receive or can get the source
-code.  If you link other code with the library, you must provide
-complete object files to the recipients, so that they can relink them
-with the library after making changes to the library and recompiling
-it.  And you must show them these terms so they know their rights.
-
-  We protect your rights with a two-step method: (1) we copyright the
-library, and (2) we offer you this license, which gives you legal
-permission to copy, distribute and/or modify the library.
-
-  To protect each distributor, we want to make it very clear that
-there is no warranty for the free library.  Also, if the library is
-modified by someone else and passed on, the recipients should know
-that what they have is not the original version, so that the original
-author's reputation will not be affected by problems that might be
-introduced by others.
-
-  Finally, software patents pose a constant threat to the existence of
-any free program.  We wish to make sure that a company cannot
-effectively restrict the users of a free program by obtaining a
-restrictive license from a patent holder.  Therefore, we insist that
-any patent license obtained for a version of the library must be
-consistent with the full freedom of use specified in this license.
-
-  Most GNU software, including some libraries, is covered by the
-ordinary GNU General Public License.  This license, the GNU Lesser
-General Public License, applies to certain designated libraries, and
-is quite different from the ordinary General Public License.  We use
-this license for certain libraries in order to permit linking those
-libraries into non-free programs.
-
-  When a program is linked with a library, whether statically or using
-a shared library, the combination of the two is legally speaking a
-combined work, a derivative of the original library.  The ordinary
-General Public License therefore permits such linking only if the
-entire combination fits its criteria of freedom.  The Lesser General
-Public License permits more lax criteria for linking other code with
-the library.
-
-  We call this license the "Lesser" General Public License because it
-does Less to protect the user's freedom than the ordinary General
-Public License.  It also provides other free software developers Less
-of an advantage over competing non-free programs.  These disadvantages
-are the reason we use the ordinary General Public License for many
-libraries.  However, the Lesser license provides advantages in certain
-special circumstances.
-
-  For example, on rare occasions, there may be a special need to
-encourage the widest possible use of a certain library, so that it becomes
-a de-facto standard.  To achieve this, non-free programs must be
-allowed to use the library.  A more frequent case is that a free
-library does the same job as widely used non-free libraries.  In this
-case, there is little to gain by limiting the free library to free
-software only, so we use the Lesser General Public License.
-
-  In other cases, permission to use a particular library in non-free
-programs enables a greater number of people to use a large body of
-free software.  For example, permission to use the GNU C Library in
-non-free programs enables many more people to use the whole GNU
-operating system, as well as its variant, the GNU/Linux operating
-system.
-
-  Although the Lesser General Public License is Less protective of the
-users' freedom, it does ensure that the user of a program that is
-linked with the Library has the freedom and the wherewithal to run
-that program using a modified version of the Library.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.  Pay close attention to the difference between a
-"work based on the library" and a "work that uses the library".  The
-former contains code derived from the library, whereas the latter must
-be combined with the library in order to run.
-
-		  GNU LESSER GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License Agreement applies to any software library or other
-program which contains a notice placed by the copyright holder or
-other authorized party saying it may be distributed under the terms of
-this Lesser General Public License (also called "this License").
-Each licensee is addressed as "you".
-
-  A "library" means a collection of software functions and/or data
-prepared so as to be conveniently linked with application programs
-(which use some of those functions and data) to form executables.
-
-  The "Library", below, refers to any such software library or work
-which has been distributed under these terms.  A "work based on the
-Library" means either the Library or any derivative work under
-copyright law: that is to say, a work containing the Library or a
-portion of it, either verbatim or with modifications and/or translated
-straightforwardly into another language.  (Hereinafter, translation is
-included without limitation in the term "modification".)
-
-  "Source code" for a work means the preferred form of the work for
-making modifications to it.  For a library, complete source code means
-all the source code for all modules it contains, plus any associated
-interface definition files, plus the scripts used to control compilation
-and installation of the library.
-
-  Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running a program using the Library is not restricted, and output from
-such a program is covered only if its contents constitute a work based
-on the Library (independent of the use of the Library in a tool for
-writing it).  Whether that is true depends on what the Library does
-and what the program that uses the Library does.
-
-  1. You may copy and distribute verbatim copies of the Library's
-complete source code as you receive it, in any medium, provided that
-you conspicuously and appropriately publish on each copy an
-appropriate copyright notice and disclaimer of warranty; keep intact
-all the notices that refer to this License and to the absence of any
-warranty; and distribute a copy of this License along with the
-Library.
-
-  You may charge a fee for the physical act of transferring a copy,
-and you may at your option offer warranty protection in exchange for a
-fee.
-
-  2. You may modify your copy or copies of the Library or any portion
-of it, thus forming a work based on the Library, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) The modified work must itself be a software library.
-
-    b) You must cause the files modified to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    c) You must cause the whole of the work to be licensed at no
-    charge to all third parties under the terms of this License.
-
-    d) If a facility in the modified Library refers to a function or a
-    table of data to be supplied by an application program that uses
-    the facility, other than as an argument passed when the facility
-    is invoked, then you must make a good faith effort to ensure that,
-    in the event an application does not supply such function or
-    table, the facility still operates, and performs whatever part of
-    its purpose remains meaningful.
-
-    (For example, a function in a library to compute square roots has
-    a purpose that is entirely well-defined independent of the
-    application.  Therefore, Subsection 2d requires that any
-    application-supplied function or table used by this function must
-    be optional: if the application does not supply it, the square
-    root function must still compute square roots.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Library,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Library, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote
-it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Library.
-
-In addition, mere aggregation of another work not based on the Library
-with the Library (or with a work based on the Library) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may opt to apply the terms of the ordinary GNU General Public
-License instead of this License to a given copy of the Library.  To do
-this, you must alter all the notices that refer to this License, so
-that they refer to the ordinary GNU General Public License, version 2,
-instead of to this License.  (If a newer version than version 2 of the
-ordinary GNU General Public License has appeared, then you can specify
-that version instead if you wish.)  Do not make any other change in
-these notices.
-
-  Once this change is made in a given copy, it is irreversible for
-that copy, so the ordinary GNU General Public License applies to all
-subsequent copies and derivative works made from that copy.
-
-  This option is useful when you wish to copy part of the code of
-the Library into a program that is not a library.
-
-  4. You may copy and distribute the Library (or a portion or
-derivative of it, under Section 2) in object code or executable form
-under the terms of Sections 1 and 2 above provided that you accompany
-it with the complete corresponding machine-readable source code, which
-must be distributed under the terms of Sections 1 and 2 above on a
-medium customarily used for software interchange.
-
-  If distribution of object code is made by offering access to copy
-from a designated place, then offering equivalent access to copy the
-source code from the same place satisfies the requirement to
-distribute the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  5. A program that contains no derivative of any portion of the
-Library, but is designed to work with the Library by being compiled or
-linked with it, is called a "work that uses the Library".  Such a
-work, in isolation, is not a derivative work of the Library, and
-therefore falls outside the scope of this License.
-
-  However, linking a "work that uses the Library" with the Library
-creates an executable that is a derivative of the Library (because it
-contains portions of the Library), rather than a "work that uses the
-library".  The executable is therefore covered by this License.
-Section 6 states terms for distribution of such executables.
-
-  When a "work that uses the Library" uses material from a header file
-that is part of the Library, the object code for the work may be a
-derivative work of the Library even though the source code is not.
-Whether this is true is especially significant if the work can be
-linked without the Library, or if the work is itself a library.  The
-threshold for this to be true is not precisely defined by law.
-
-  If such an object file uses only numerical parameters, data
-structure layouts and accessors, and small macros and small inline
-functions (ten lines or less in length), then the use of the object
-file is unrestricted, regardless of whether it is legally a derivative
-work.  (Executables containing this object code plus portions of the
-Library will still fall under Section 6.)
-
-  Otherwise, if the work is a derivative of the Library, you may
-distribute the object code for the work under the terms of Section 6.
-Any executables containing that work also fall under Section 6,
-whether or not they are linked directly with the Library itself.
-
-  6. As an exception to the Sections above, you may also combine or
-link a "work that uses the Library" with the Library to produce a
-work containing portions of the Library, and distribute that work
-under terms of your choice, provided that the terms permit
-modification of the work for the customer's own use and reverse
-engineering for debugging such modifications.
-
-  You must give prominent notice with each copy of the work that the
-Library is used in it and that the Library and its use are covered by
-this License.  You must supply a copy of this License.  If the work
-during execution displays copyright notices, you must include the
-copyright notice for the Library among them, as well as a reference
-directing the user to the copy of this License.  Also, you must do one
-of these things:
-
-    a) Accompany the work with the complete corresponding
-    machine-readable source code for the Library including whatever
-    changes were used in the work (which must be distributed under
-    Sections 1 and 2 above); and, if the work is an executable linked
-    with the Library, with the complete machine-readable "work that
-    uses the Library", as object code and/or source code, so that the
-    user can modify the Library and then relink to produce a modified
-    executable containing the modified Library.  (It is understood
-    that the user who changes the contents of definitions files in the
-    Library will not necessarily be able to recompile the application
-    to use the modified definitions.)
-
-    b) Use a suitable shared library mechanism for linking with the
-    Library.  A suitable mechanism is one that (1) uses at run time a
-    copy of the library already present on the user's computer system,
-    rather than copying library functions into the executable, and (2)
-    will operate properly with a modified version of the library, if
-    the user installs one, as long as the modified version is
-    interface-compatible with the version that the work was made with.
-
-    c) Accompany the work with a written offer, valid for at
-    least three years, to give the same user the materials
-    specified in Subsection 6a, above, for a charge no more
-    than the cost of performing this distribution.
-
-    d) If distribution of the work is made by offering access to copy
-    from a designated place, offer equivalent access to copy the above
-    specified materials from the same place.
-
-    e) Verify that the user has already received a copy of these
-    materials or that you have already sent this user a copy.
-
-  For an executable, the required form of the "work that uses the
-Library" must include any data and utility programs needed for
-reproducing the executable from it.  However, as a special exception,
-the materials to be distributed need not include anything that is
-normally distributed (in either source or binary form) with the major
-components (compiler, kernel, and so on) of the operating system on
-which the executable runs, unless that component itself accompanies
-the executable.
-
-  It may happen that this requirement contradicts the license
-restrictions of other proprietary libraries that do not normally
-accompany the operating system.  Such a contradiction means you cannot
-use both them and the Library together in an executable that you
-distribute.
-
-  7. You may place library facilities that are a work based on the
-Library side-by-side in a single library together with other library
-facilities not covered by this License, and distribute such a combined
-library, provided that the separate distribution of the work based on
-the Library and of the other library facilities is otherwise
-permitted, and provided that you do these two things:
-
-    a) Accompany the combined library with a copy of the same work
-    based on the Library, uncombined with any other library
-    facilities.  This must be distributed under the terms of the
-    Sections above.
-
-    b) Give prominent notice with the combined library of the fact
-    that part of it is a work based on the Library, and explaining
-    where to find the accompanying uncombined form of the same work.
-
-  8. You may not copy, modify, sublicense, link with, or distribute
-the Library except as expressly provided under this License.  Any
-attempt otherwise to copy, modify, sublicense, link with, or
-distribute the Library is void, and will automatically terminate your
-rights under this License.  However, parties who have received copies,
-or rights, from you under this License will not have their licenses
-terminated so long as such parties remain in full compliance.
-
-  9. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Library or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Library (or any work based on the
-Library), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Library or works based on it.
-
-  10. Each time you redistribute the Library (or any work based on the
-Library), the recipient automatically receives a license from the
-original licensor to copy, distribute, link with or modify the Library
-subject to these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties with
-this License.
-
-  11. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Library at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Library by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Library.
-
-If any portion of this section is held invalid or unenforceable under any
-particular circumstance, the balance of the section is intended to apply,
-and the section as a whole is intended to apply in other circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  12. If the distribution and/or use of the Library is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Library under this License may add
-an explicit geographical distribution limitation excluding those countries,
-so that distribution is permitted only in or among countries not thus
-excluded.  In such case, this License incorporates the limitation as if
-written in the body of this License.
-
-  13. The Free Software Foundation may publish revised and/or new
-versions of the Lesser General Public License from time to time.
-Such new versions will be similar in spirit to the present version,
-but may differ in detail to address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Library
-specifies a version number of this License which applies to it and
-"any later version", you have the option of following the terms and
-conditions either of that version or of any later version published by
-the Free Software Foundation.  If the Library does not specify a
-license version number, you may choose any version ever published by
-the Free Software Foundation.
-
-  14. If you wish to incorporate parts of the Library into other free
-programs whose distribution conditions are incompatible with these,
-write to the author to ask for permission.  For software which is
-copyrighted by the Free Software Foundation, write to the Free
-Software Foundation; we sometimes make exceptions for this.  Our
-decision will be guided by the two goals of preserving the free status
-of all derivatives of our free software and of promoting the sharing
-and reuse of software generally.
-
-			    NO WARRANTY
-
-  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
-WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
-EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
-OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
-KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
-LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
-THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
-WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
-AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
-FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
-CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
-LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
-RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
-FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
-SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
-DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-           How to Apply These Terms to Your New Libraries
-
-  If you develop a new library, and you want it to be of the greatest
-possible use to the public, we recommend making it free software that
-everyone can redistribute and change.  You can do so by permitting
-redistribution under these terms (or, alternatively, under the terms of the
-ordinary General Public License).
-
-  To apply these terms, attach the following notices to the library.  It is
-safest to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least the
-"copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the library's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This library is free software; you can redistribute it and/or
-    modify it under the terms of the GNU Lesser General Public
-    License as published by the Free Software Foundation; either
-    version 2.1 of the License, or (at your option) any later version.
-
-    This library is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-    Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public
-    License along with this library; if not, write to the Free Software
-    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
-
-Also add information on how to contact you by electronic and paper mail.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the library, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the
-  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
-
-  <signature of Ty Coon>, 1 April 1990
-  Ty Coon, President of Vice
-
-That's all there is to it!
-
-

contrib/c-bindings/pgf.h

@@ -1,68 +0,0 @@
-/* GF C Bindings
-   Copyright (C) 2008-2009 Kevin Kofler
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License as published by the Free Software Foundation; either
-   version 2.1 of the License, or (at your option) any later version.
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, see <http://www.gnu.org/licenses/>.
-*/
-
-#include "HsFFI.h"
-
-#ifdef __GLASGOW_HASKELL__
-#include "PGFFFI_stub.h"
-
-extern void __stginit_PGFFFI ( void );
-#endif
-
-static inline void gf_init(int *argc, char ***argv)
-{
-  hs_init(argc, argv);
-#ifdef __GLASGOW_HASKELL__
-  hs_add_root(__stginit_PGFFFI);
-#endif
-}
-
-static inline void gf_exit(void)
-{
-  hs_exit();
-}
-
-typedef HsStablePtr GF_PGF;
-typedef HsStablePtr GF_CId;
-typedef HsStablePtr GF_Language;
-typedef HsStablePtr GF_Type;
-typedef HsStablePtr GF_Tree;
-typedef HsStablePtr GF_Expr;
-
-static inline void gf_freeCIds(GF_CId *p)
-{
-  GF_CId *q = p;
-  while (*q)
-    gf_freeCId(*(q++));
-  free(p);
-}
-
-static inline void gf_freeLanguages(GF_Language *p)
-{
-  GF_Language *q = p;
-  while (*q)
-    gf_freeLanguage(*(q++));
-  free(p);
-}
-
-static inline void gf_freeTrees(GF_Tree *p)
-{
-  GF_Type *q = p;
-  while (*q)
-    gf_freeTree(*(q++));
-  free(p);
-}

contrib/c-bindings/readme-ffi.txt

@@ -1,120 +0,0 @@
-GF C Bindings
-Copyright (C) 2008-2010 Kevin Kofler
-
-This library is free software; you can redistribute it and/or
-modify it under the terms of the GNU Lesser General Public
-License as published by the Free Software Foundation; either
-version 2.1 of the License, or (at your option) any later version.
-
-This library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-Lesser General Public License for more details.
-
-You should have received a copy of the GNU Lesser General Public
-License along with this library; if not, see <http://www.gnu.org/licenses/>.
-
-
-This library provides access to the GF embedded grammars (PGF) API to C/C++
-applications. To use it:
-1. #include "pgf.h"
-2. call gf_init(&argc, &argv); at the beginning of main()
-3. call gf_exit(); before exiting the program
-4. build with: ghc --make -fglasgow-exts -O2 -no-hs-main $* x.c PGFFFI.hs -o x
-
-
-Currently, the following functions from PGF are wrapped:
-readPGF  :: FilePath -> IO PGF
-mkCId :: String -> CId
-wildCId :: CId
-showCId :: CId -> String
-readCId :: String -> Maybe CId
-showLanguage :: Language -> String
-readLanguage :: String -> Maybe Language
-languages :: PGF -> [Language]
-abstractName :: PGF -> Language
-languageCode :: PGF -> Language -> Maybe String
-showType :: Type -> [CId] -> String (*)
-readType :: String -> Maybe Type
-categories :: PGF -> [CId]
-startCat :: PGF -> Type
-showExpr :: Expr -> [CId] -> String (*)
-readExpr :: String -> Maybe Expr
-linearize :: PGF -> Language -> Tree -> String
-showPrintName :: PGF -> Language -> CId -> String
-parse :: PGF -> Language -> Type -> String -> [Tree]
-(*) The [CId] parameter is currently not mapped; instead, [] is always passed.
-
-
-Some notes about the wrapping:
-* "gf_" is prepended to the wrapped functions as a form of namespacing.
-* Object types T are mapped to opaque C types GF_T which are handles to the
-  object. Whenever returned by a function, they get marked as used (so the
-  Haskell garbage collection won't delete them), so when you are done using
-  them, you should free them (assuming they're non-NULL) with the corresponding
-  gf_freeT function (i.e. one of: gf_freePGF, gf_freeLanguage, gf_freeType,
-  gf_freeCId, gf_freeTree, gf_freeExpr). (Internally, they are all Haskell
-  StablePtr handles, but this is subject to change.)
-* Strings are mapped to char *. Strings returned by functions, when not NULL,
-  are allocated with malloc and should thus be freed with free when no longer
-  needed.
-* A FilePath is a string.
-* A type Maybe T is mapped the same way as just T, except that the returned
-  handle or char * can be NULL, so you should test them with a test like if (p).
-  Otherwise functions can be expected to always return non-NULL
-  handles/pointers. Conversely, arguments to functions are always assumed to be
-  non-NULL.
-* Lists [T] are mapped to null-terminated arrays GF_T[], passed/returned as
-  pointers GF_T *. All objects in the array should be freed with the correct
-  gf_freeT function when no longer needed, the array itself with free. For your
-  convenience, the C header defines inline functions gf_freeLanguages,
-  gf_freeTypes and gf_freeTrees which free an entire array.
-* Bool is wrapped to int using the usual C convention of 1 = True, 0 = False.
-* A constant like wildCId is mapped to a function with no arguments, e.g.
-  GF_CId wildCId(void). The returned handle has to be freed as for any other
-  function.
-
-
-Thus, the C prototypes for the wrapped functions are:
-GF_PGF *gf_readPGF(char *path);
-GF_CId gf_mkCId(char *str);
-GF_CId wildCId(void);
-char *gf_showCId(GF_CID cid);
-GF_CId gf_readCId(char *str); /* may return NULL */
-char *gf_showLanguage(GF_Language lang);
-GF_Language gf_readLanguage(char *str); /* may return NULL */
-GF_Language *gf_languages(GF_PGF pgf);
-GF_Language gf_abstractName(GF_PGF pgf);
-char *gf_languageCode(GF_PGF pgf, GF_Language lang); /* may return NULL */
-char *gf_showType(GF_Type tp);
-GF_Type gf_readType(char *str); /* may return NULL */
-GF_CId *gf_categories(GF_PGF pgf);
-GF_Type gf_startCat(GF_PGF pgf);
-char *gf_showExpr(GF_Expr expr);
-GF_Expr gf_readExpr(char *str); /* may return NULL */
-char *gf_linearize(GF_PGF pgf, GF_Language lang, GF_Tree tree);
-char *gf_showPrintName(GF_PGF pgf, GF_Language lang, GF_CId cid);
-GF_Tree *gf_parse(GF_PGF pgf, GF_Language lang, GF_Type cat, char *input);
-
-The C prototypes for the freeing functions are:
-void gf_freePGF(GF_PGF pgf);
-void gf_freeCId(GF_CId cid);
-void gf_freeLanguage(GF_Language lang);
-void gf_freeType(GF_Type tp);
-void gf_freeTree(GF_Tree tree);
-void gf_freeExpr(GF_Expr expr);
-void gf_freeCIds(GF_Type *p);
-void gf_freeLanguages(GF_Language *p);
-void gf_freeTrees(GF_Tree *p);
-
-
-
-In addition, a C equivalent to the following function from GF.Text.Lexing:
-stringOp :: String -> Maybe (String -> String)
-is provided as:
-typedef char *(*GF_StringOp)(const char *str);
-GF_StringOp gf_stringOp(const char *op); /* may return NULL */
-which returns NULL if op is not a valid operation name, otherwise a pointer to a
-function which applies the function corresponding to op to the string str. The
-resulting string must be freed with free. The function pointer MUST NOT be
-freed.

contrib/py-bindings/Makefile

@@ -1,37 +0,0 @@
-src=../../src
-import=-i$(src)/runtime/haskell:$(src)/compiler
-cbind=../c-bindings
-pyversion = $(shell python -c 'import sys; print ".".join(`t` for t in sys.version_info[:2])')
-pythoninc=/usr/include/python$(pyversion)
-debug= #-optc '-DDEBUG=1'
-exdir=../../examples/tutorial/embedded
-
-build: gf.so
-
-test:
-	python test.py
-
-gf.so:  PyGF.hs gfmodule.c Query.pgf
-	ghc $(import) --make -fglasgow-exts -O2 -no-hs-main -c $<
-	ghc -O2 --make -fglasgow-exts -no-hs-main -optl '-shared' \
-	 -optc '-DMODULE=$(basename $<)' $(debug) -optc '-I$(pythoninc)' -o $@ \
-	$(filter-out %.pgf, $^)
-
-
-
-clean:
-	rm -f *.hi  *.o
-	rm -f *_stub.*
-	rm -f PyGF.hs
-
-superclean: 
-	make clean
-	rm -f Query.pgf
-	rm -f gf.so
-	rm -f mtest
-
-PyGF.hs: PyGF.hsc
-	hsc2hs -I$(pythoninc) $<
-
-Query.pgf:
-	gf --make  $(exdir)/QueryEng.gf $(exdir)/QuerySpa.gf 

contrib/py-bindings/PyGF.hsc

@@ -1,266 +0,0 @@
-{-# LANGUAGE ForeignFunctionInterface #-} 
--- GF Python bindings                                                                                                                                        -- Jordi Saludes, upc.edu 2010
--- Jordi Saludes, upc.edu 2010
---
-module PyGF where
-
-import PGF
-import Foreign
-import CString
-import Foreign.C.Types
-import Control.Monad
-
-#include "pygf.h"
-
-freeSp :: String -> Ptr a -> IO ()
-freeSp tname p = do
-    --DEBUG putStrLn $ "about to free pointer " ++ tname ++ " at " ++ (show p)
-    sp <- (#peek PyGF, sp) p
-    --DEBUG putStrLn "peeked"
-    freeStablePtr sp
-    --DEBUG putStrLn $ "freeing " ++ tname ++ " at " ++ (show p)
-
-instance Storable PGF where
-    sizeOf _ = (#size PyGF)
-    alignment _ = alignment (undefined::CInt)
-    poke p o = do
-      sp <- newStablePtr o
-      (#poke PyGF, sp) p sp
-    peek p = do
-      sp <- (#peek PyGF, sp) p
-      deRefStablePtr sp
-
-instance Storable Type where
-    sizeOf _ = (#size PyGF)
-    alignment _ = alignment (undefined::CInt)
-    poke p o = do
-      sp <- newStablePtr o
-      (#poke PyGF, sp) p sp
-    peek p = do
-      sp <- (#peek PyGF, sp) p
-      deRefStablePtr sp
-
-instance Storable Language where
-    sizeOf _ = (#size PyGF)
-    alignment _ = alignment (undefined::CInt)
-    poke p o = do
-      sp <- newStablePtr o
-      (#poke PyGF, sp) p sp
-    peek p = do
-      sp <- (#peek PyGF, sp) p
-      deRefStablePtr sp
-
-instance Storable Tree where
-    sizeOf _ = (#size PyGF)
-    alignment _ = alignment (undefined::CInt)
-    poke p o = do
-      sp <- newStablePtr o
-      (#poke PyGF, sp) p sp
-    peek p = do
-      sp <- (#peek PyGF, sp) p
-      deRefStablePtr sp
-
--- It is CId the same as Tree?
-
-{- instance Storable CId where
-    sizeOf _ = (#size PyGF)
-    alignment _ = alignment (undefined::CInt)
-    poke p o = do
-      sp <- newStablePtr o
-      (#poke PyGF, sp) p sp
-    peek p = do
-      sp <- (#peek PyGF, sp) p
-      deRefStablePtr sp
--}
-
-foreign export ccall gf_freePGF :: Ptr PGF -> IO ()
-foreign export ccall gf_freeType :: Ptr Type -> IO ()
-foreign export ccall gf_freeLanguage :: Ptr Language -> IO ()
-foreign export ccall gf_freeTree :: Ptr Tree -> IO ()
-foreign export ccall gf_freeExpr :: Ptr Expr -> IO ()
-foreign export ccall gf_freeCId :: Ptr CId -> IO ()
-gf_freePGF = freeSp "pgf"
-gf_freeType = freeSp "type"
-gf_freeLanguage = freeSp "language"
-gf_freeTree = freeSp "tree"
-gf_freeExpr = freeSp "expression"
-gf_freeCId = freeSp "CId"
-
-           
-{-foreign export ccall gf_printCId :: Ptr CId-> IO CString
-gf_printCId p = do
-    c <- peek p
-    newCString (showCId c)
--}
-
-foreign export ccall gf_readPGF :: CString -> IO (Ptr PGF)
-gf_readPGF path = do
-  ppgf <- pyPGF
-  p <- peekCString path
-  readPGF p >>= poke ppgf
-  return ppgf
-  
-foreign export ccall gf_readLanguage :: Ptr Language -> CString -> IO Bool
-gf_readLanguage pt str = do
-  s <- (peekCString str)
-  case (readLanguage s) of
-    Just x -> do
-            poke pt x
-            return True
-    Nothing -> return False
-
-foreign export ccall gf_startCat :: Ptr PGF -> IO (Ptr Type)
-gf_startCat ppgf = do
-  pgf <- peek ppgf
-  pcat <- pyType
-  poke pcat (startCat pgf)
-  return pcat
-
-foreign export ccall gf_parse :: Ptr PGF -> Ptr Language -> Ptr Type -> CString -> IO  (Ptr ())
-gf_parse ppgf plang pcat input = do
-  p <- peek ppgf
-  c <- peek pcat
-  i <- peekCString input
-  l <- peek plang
-  let parsed = parse p l c i
-  --DEBUG putStrLn $  (show $ length  parsed) ++ " parsings"
-  listToPy pyTree parsed
-  
-foreign export ccall gf_showExpr :: Ptr Expr -> IO CString
-gf_showExpr pexpr = do
-  e <- peek pexpr
-  newCString (showExpr [] e)
-
-listToPy :: Storable a => IO (Ptr a) -> [a] -> IO (Ptr ()) -- opaque -- IO (Ptr (Ptr Language))
-listToPy mk ls = do
-    pyls <- pyList
-    mapM_ (mpoke pyls)  ls
-    return pyls
-  where  mpoke pyl l = do
-          pl <- mk
-          poke pl l
-          pyl << pl
-       
--- foreign export ccall "gf_freeArray" free :: Ptr a -> IO ()
-
-              
-foreign export ccall gf_showLanguage :: Ptr Language -> IO CString
-gf_showLanguage plang = do
-  l <- peek plang
-  newCString $ showLanguage l
-
-foreign export ccall gf_showType :: Ptr Type -> IO CString
-gf_showType ptp = do
-  t <- peek ptp
-  newCString $ showType [] t
-
-foreign export ccall gf_showPrintName :: Ptr PGF -> Ptr Language -> Ptr CId -> IO CString
-gf_showPrintName ppgf plang pcid = do
-  pgf <- peek ppgf
-  lang <- peek plang
-  cid <- peek pcid
-  newCString (showPrintName pgf lang cid)
-
-foreign export ccall gf_abstractName :: Ptr PGF -> IO (Ptr Language)
-gf_abstractName ppgf = do
-  pabs <- pyLang
-  pgf <- peek ppgf
-  poke pabs $ abstractName pgf
-  return pabs
-
-foreign export ccall gf_linearize :: Ptr PGF -> Ptr Language -> Ptr Tree -> IO CString
-gf_linearize ppgf plang ptree = do
-  pgf <- peek ppgf
-  lang <- peek plang
-  tree <- peek ptree
-  newCString $ linearize pgf lang tree
-
-foreign export ccall gf_languageCode :: Ptr PGF -> Ptr Language -> IO CString
-gf_languageCode ppgf plang = do
-  pgf <- peek ppgf
-  lang <- peek plang
-  case languageCode pgf lang of
-    Just s -> newCString s
-    Nothing -> return nullPtr
-
-foreign export ccall gf_languages :: Ptr PGF -> IO (Ptr ()) -- (Ptr (Ptr Language))
-gf_languages ppgf = do
-  pgf <- peek ppgf
-  listToPy pyLang $ languages pgf
-
-foreign export ccall gf_categories :: Ptr PGF -> IO (Ptr ())
-gf_categories ppgf = do
-  pgf <- peek ppgf
-  listToPy pyCId $ categories pgf
-
-foreign export ccall gf_showCId :: Ptr CId -> IO CString
-gf_showCId pcid = do
-  cid <- peek pcid
-  newCString $ showCId cid
-
-foreign export ccall gf_unapp :: Ptr Expr -> IO (Ptr ())
-foreign export ccall gf_unint :: Ptr Expr -> IO CInt
-foreign export ccall gf_unstr :: Ptr Expr -> IO CString
-
-gf_unapp pexp = do
-    exp <- peek pexp
-    case unApp exp of
-        Just (f,args) -> do
-                   puexp <- pyList
-                   pf <- pyCId
-                   poke pf f
-                   puexp << pf
-                   mapM_ (\e -> do
-                              pe <- pyExpr
-                              poke pe e
-                              puexp << pe) args 
-                   return puexp
-        Nothing -> return nullPtr
-gf_unint pexp = do
-    exp <- peek pexp
-    return $ fromIntegral $ case unInt exp of
-                              Just n -> n
-                              _      -> (-9)
-gf_unstr pexp = do
-   exp <- peek pexp
-   case unStr exp of
-        Just s -> newCString s
-        _      -> return nullPtr
-
-foreign export ccall gf_inferexpr :: Ptr PGF -> Ptr Expr -> IO (Ptr Type)
-gf_inferexpr ppgf pexp = do
-    pgf <- peek ppgf
-    exp <- peek pexp
-    case inferExpr pgf exp of
-      Right (_,t) -> do
-                 ptype <- pyType
-                 poke ptype t
-                 return ptype
-      Left _       -> return nullPtr 
-
-
-foreign export ccall gf_functions :: Ptr PGF -> IO (Ptr ())
-gf_functions ppgf = do
-    pgf <- peek ppgf
-    listToPy pyCId $ functions pgf 
-
-foreign export ccall gf_functiontype :: Ptr PGF -> Ptr CId -> IO (Ptr Type)
-gf_functiontype ppgf pcid = do
-    pgf <- peek ppgf
-    cid <- peek pcid
-    case functionType pgf cid of
-        Just t -> do
-               ptp <- pyType
-               poke ptp t
-               return ptp
-        _      -> return nullPtr
-
-
-foreign import ccall "newLang" pyLang :: IO (Ptr Language) 
-foreign import ccall "newPGF" pyPGF :: IO (Ptr PGF) 
-foreign import ccall "newTree" pyTree :: IO (Ptr Tree) 
-foreign import ccall "newgfType" pyType :: IO (Ptr Type) 
-foreign import ccall "newCId" pyCId :: IO (Ptr CId) 
-foreign import ccall "newExpr" pyExpr :: IO (Ptr Expr) 
-foreign import ccall "newList" pyList :: IO (Ptr ()) 
-foreign import ccall "append" (<<) :: Ptr () -> Ptr a -> IO ()

contrib/py-bindings/gfmodule.c

@@ -1,314 +0,0 @@
-// GF Python bindings
-// Jordi Saludes, upc.edu 2010
-//
-
-#include <Python.h>
-#include <sys/stat.h>
-#include "pygf.h"
-
-/* utilities */
-
-int
-checkType(void* obj, PyTypeObject* tp)
-{
-  int isRight = PyObject_TypeCheck((PyObject*)obj, tp);
-  if (!isRight)
-    PyErr_Format(PyExc_TypeError, "Expecting a %s.", tp->tp_doc);
-  return isRight;
-}
-
-
-/* new types and declarations */
-
-NEWGF(CId,GF_CId,CIdType,"gf.cid","identifier")
-NEWGF(Lang,GF_Language,LangType,"gf.lang","language")
-NEWGF(gfType,GF_Type,gfTypeType,"gf.type","gf type")
-NEWGF(PGF,GF_PGF,PGFType,"gf.pgf","PGF module")
-NEWGF(Expr,GF_Expr,ExprType,"gf.expr","gf expression")	
-NEWGF(Tree,GF_Tree,TreeType,"gf.tree","gf tree")
-
-
-/* CId methods, constructor and destructor */
-
-DEALLOCFN(CId_dealloc, CId, gf_freeCId, "freeCId")
-
-
-/* PGF methods, constructor and destructor */
-
-DEALLOCFN(PGF_dealloc, PGF, gf_freePGF, "freePGF")
-
-static PyObject* 
-pgf_repr(PGF *self) {
-  Lang* lang = gf_abstractName(self);
-  char* abs = gf_showLanguage(lang);
-  Py_DECREF(lang);					     
-  PyObject* str = PyString_FromFormat("<gf.pgf with abstract %s>", abs);
-  free(abs);
-return str;
-}
-
-static PyObject*
-languageCode(PGF *self, PyObject *args)
-{
-  Lang *lang;
-  if (!PyArg_ParseTuple(args, "O", &lang))
-    return NULL;
-  if (!checkType(lang, &LangType)) return NULL;
-  char* scode = gf_languageCode(self, lang);
-  if (scode) {
-    PyObject* result = PyString_FromString(scode);
-    free(scode);
-    return result;
-  } else {
-    Py_INCREF(Py_None);
-    return Py_None;
-  }
-}
-
-static PyObject*
-linearize(PGF *self, PyObject *args)
-{
-  Lang *lang;
-  Tree *tree;
-  if (!PyArg_ParseTuple(args, "OO", &lang, &tree))
-    return NULL;
-  if (!checkType(lang,&LangType)) return NULL;
-  if (!checkType(tree,&TreeType)) return NULL;
-  char* c_lin = gf_linearize(self, lang, tree);
-  PyObject* lin = PyString_FromString(c_lin);
-  free(c_lin);
-  return lin;
-}
-
-static Lang*
-abstractName(PGF *self)
-{
-  if (!checkType(self,&PGFType)) return NULL;
-  return gf_abstractName(self);
-}
-
-static PyObject*
-printName(PGF *self, PyObject *args)
-{
-	Lang* lang;
-	CId* id;
-	if (!PyArg_ParseTuple(args, "OO", &lang, &id))
-		return NULL;
-	if (!checkType(lang,&LangType)) return NULL;
-	if (!checkType(id,&CIdType)) return NULL;
-	char *pname = gf_showPrintName(self, lang, id);
-	PyObject* result = PyString_FromString(pname);
-	free(pname);
-	return result;
-}
-
-static gfType*
-functiontype(PGF *self, PyObject* args)
-{
-  CId* cid;
-  gfType* gftp;
-  if (!PyArg_ParseTuple(args, "O", &cid))
-    return NULL;
-  if (!checkType(cid,&CIdType)) {
-    PyErr_Format(PyExc_TypeError, "Must be a gf identifier.");
-    return NULL;
-  }
-  return gf_functiontype(self, cid);
-}
-
-
-static PyObject*
-parse(PGF *self, PyObject *args, PyObject *kws)
-{
-	Lang *lang;
-	gfType *cat = NULL;
-	char *lexed;
-	static char *kwlist[] = {"lexed", "lang", "cat", NULL};
-	if (!PyArg_ParseTupleAndKeywords(args, kws, "sO|O", kwlist,
-				       &lexed, &lang, &cat))
-    	return NULL;
-	if (!checkType(self, &PGFType)) return NULL;
-	if (!checkType(lang, &LangType)) return NULL;
-	if (cat) {
-	  if (!checkType(cat, &gfTypeType)) return NULL;
-	} else { 
-	  cat = gf_startCat(self);		
-	} 
-	return gf_parse(self, lang, cat, lexed);
-}
-
-static PGF*
-readPGF(PyObject *self, PyObject *args)
-{
-  char *path;
-  struct stat info;
-  if (!PyArg_ParseTuple(args, "s", &path))
-    return NULL;
-  if (stat(path, &info) == 0) {
-    	PGF* pgf = gf_readPGF(path);
-    	return pgf;
-  } else {
-		PyErr_Format(PyExc_IOError, "No such file: %s", path);
-    	return NULL;
-  }
-}
-
-
-
-static PyMethodDef pgf_methods[] = {
-  {"parse", (PyCFunction)parse, METH_VARARGS|METH_KEYWORDS,"Parse a string."},
-  {"lin", (PyCFunction)linearize, METH_VARARGS,"Linearize tree."},
-  {"lang_code", (PyCFunction)languageCode, METH_VARARGS,"Get the language code."},
-  {"print_name", (PyCFunction)printName, METH_VARARGS,"Get the print name for a id."},
-  {"fun_type", (PyCFunction)functiontype, METH_VARARGS,"Get the type of a fun expression."},
-  {"startcat", (PyCFunction)gf_startCat, METH_NOARGS,"Get the start category."},
-  {"categories", (PyCFunction)gf_categories, METH_NOARGS,"Get all categories."},
-  {"functions", (PyCFunction)gf_functions, METH_NOARGS,"Get all functions."},
-  {"abstract", (PyCFunction)abstractName, METH_NOARGS,"Get the module abstract name."},
-  {"languages", (PyCFunction)gf_languages, METH_NOARGS,"Get the module languages."},
-  {NULL, NULL, 0, NULL}  /* Sentinel */
-};
-
-REPRCB(CId_repr, CId, gf_showCId)
-
-
-/* Language methods, constructor and destructor */
-
-REPRCB(lang_repr, Lang, gf_showLanguage)
-DEALLOCFN(Lang_dealloc, Lang, gf_freeLanguage, "freeLanguage")
-
-static Lang*
-readLang(PyObject *self, PyObject *args)
-{
-  char *langName;
-  Lang *l;
-  if (!PyArg_ParseTuple(args,"s",&langName))
-    return NULL;
-  l = (Lang*)LangType.tp_new(&LangType,NULL,NULL);
-  if(!l) return NULL;
-  gf_readLanguage(l,langName);
-  return l;
-}
-
-
-
-/* gf types: methods, constructor and destructor */
-
-DEALLOCFN(gfType_dealloc, gfType, gf_freeType, "freeType")
-REPRCB(gfType_repr, gfType, gf_showType)
-
-
-/* expression type: methods, destructor */
-
-DEALLOCFN(expr_dealloc, Expr, gf_freeExpr, "freeExpr")
-REPRCB(expr_repr, Expr, gf_showExpr)
-
-
-static PyObject*
-unapp(Expr *self) {
-  PyObject* obj = gf_unapp(self);
-  if (!obj) {
-    char* s = gf_unstr(self);
-    if (s) {
-      obj = PyString_FromString(s);
-      free(s);
-    } else {
-      long n = gf_unint(self);
-      if (n != -9) {
-	obj = PyInt_FromLong(n);
-      } else {
-	PyErr_Format(PyExc_TypeError, "Cannot unapply expr.");
-      }
-    }
-  }
-  return obj;
-}
-
-static PyObject*
-infer_expr(Expr *self, PyObject* args) {
-  PGF* pgf;
-  if (!PyArg_ParseTuple(args, "O", &pgf))
-    return NULL;
-  if (!checkType(pgf, &PGFType)) {
-    PyErr_Format(PyExc_ValueError, "Must be a pgf module.");
-    return NULL;
-  }
-  return gf_inferexpr(pgf, self);
-}
-
-
-
-/* todo: Is Tree == Expr ? */
-
-static PyMethodDef expr_methods[] = {
-  {"unapply", (PyCFunction)unapp, METH_NOARGS, "Unapply an expression."},
-  {"infer", (PyCFunction)infer_expr, METH_VARARGS, "Infer the type of an expression."},
-  {NULL, NULL, 0, NULL}  /* Sentinel */
-};
-
-
-
-/* tree typr: methods, constructor and destructor */
-//  Are Expr and Tree equivalent ? 
-
-REPRCB(tree_repr, Tree, gf_showExpr)
-DEALLOCFN(Tree_dealloc, Tree, gf_freeTree, "freeTree")
-
-
-
-
-
-/* gf module methods */
-
-static PyMethodDef gf_methods[] = {
-  {"read_pgf", (PyCFunction)readPGF, METH_VARARGS,"Read pgf file."},
-  {"read_language", (PyCFunction)readLang, METH_VARARGS,"Get the language."},
-  {NULL, NULL, 0, NULL}  /* Sentinel */
-};
-
-
-#ifndef PyMODINIT_FUNC/* declarations for DLL import/export */
-#define PyMODINIT_FUNC void
-#endif
-
-PyMODINIT_FUNC
-initgf(void) 
-{
-  PyObject* m;
-#define READYTYPE(t,trepr,tdealloc) t.tp_new = PyType_GenericNew; \
-    t.tp_repr = (reprfunc)trepr; \
-	t.tp_dealloc = (destructor)tdealloc; \
-	if (PyType_Ready(&t) < 0) return;
-	
-        READYTYPE(CIdType, CId_repr, CId_dealloc)
-	PGFType.tp_methods = pgf_methods;
-	READYTYPE(PGFType, pgf_repr, PGF_dealloc)
-	READYTYPE(LangType, lang_repr, Lang_dealloc)
-	READYTYPE(gfTypeType, gfType_repr, gfType_dealloc)
-        ExprType.tp_methods = expr_methods;
-	READYTYPE(ExprType, expr_repr, expr_dealloc)
-	TreeType.tp_methods = expr_methods; // Tree == Expr ?
-	READYTYPE(TreeType, tree_repr, Tree_dealloc)	
-
-  m = Py_InitModule3("gf", gf_methods,
-		     "Grammatical Framework.");
-  static char *argv[] = {"gf.so", 0}, **argv_ = argv;
-  static int argc = 1;
-  gf_init (&argc, &argv_);
-  hs_add_root (__stginit_PyGF);
-
-#define ADDTYPE(t) Py_INCREF(&t);\
-PyModule_AddObject(m, "gf", (PyObject *)&t);
-
-	ADDTYPE(PGFType)
-	ADDTYPE(LangType)
-	ADDTYPE(gfTypeType)
-	ADDTYPE(TreeType)
-	ADDTYPE(ExprType)
-}
-
-
-/* List utilities to be imported by FFI */
-
-inline PyObject* newList() { return  PyList_New(0); }
-inline void append(PyObject* l, PyObject* ob) { PyList_Append(l, ob); }

contrib/py-bindings/lgpl-3.0.txt

@@ -1,165 +0,0 @@
-		   GNU LESSER GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-
-  This version of the GNU Lesser General Public License incorporates
-the terms and conditions of version 3 of the GNU General Public
-License, supplemented by the additional permissions listed below.
-
-  0. Additional Definitions.
-
-  As used herein, "this License" refers to version 3 of the GNU Lesser
-General Public License, and the "GNU GPL" refers to version 3 of the GNU
-General Public License.
-
-  "The Library" refers to a covered work governed by this License,
-other than an Application or a Combined Work as defined below.
-
-  An "Application" is any work that makes use of an interface provided
-by the Library, but which is not otherwise based on the Library.
-Defining a subclass of a class defined by the Library is deemed a mode
-of using an interface provided by the Library.
-
-  A "Combined Work" is a work produced by combining or linking an
-Application with the Library.  The particular version of the Library
-with which the Combined Work was made is also called the "Linked
-Version".
-
-  The "Minimal Corresponding Source" for a Combined Work means the
-Corresponding Source for the Combined Work, excluding any source code
-for portions of the Combined Work that, considered in isolation, are
-based on the Application, and not on the Linked Version.
-
-  The "Corresponding Application Code" for a Combined Work means the
-object code and/or source code for the Application, including any data
-and utility programs needed for reproducing the Combined Work from the
-Application, but excluding the System Libraries of the Combined Work.
-
-  1. Exception to Section 3 of the GNU GPL.
-
-  You may convey a covered work under sections 3 and 4 of this License
-without being bound by section 3 of the GNU GPL.
-
-  2. Conveying Modified Versions.
-
-  If you modify a copy of the Library, and, in your modifications, a
-facility refers to a function or data to be supplied by an Application
-that uses the facility (other than as an argument passed when the
-facility is invoked), then you may convey a copy of the modified
-version:
-
-   a) under this License, provided that you make a good faith effort to
-   ensure that, in the event an Application does not supply the
-   function or data, the facility still operates, and performs
-   whatever part of its purpose remains meaningful, or
-
-   b) under the GNU GPL, with none of the additional permissions of
-   this License applicable to that copy.
-
-  3. Object Code Incorporating Material from Library Header Files.
-
-  The object code form of an Application may incorporate material from
-a header file that is part of the Library.  You may convey such object
-code under terms of your choice, provided that, if the incorporated
-material is not limited to numerical parameters, data structure
-layouts and accessors, or small macros, inline functions and templates
-(ten or fewer lines in length), you do both of the following:
-
-   a) Give prominent notice with each copy of the object code that the
-   Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the object code with a copy of the GNU GPL and this license
-   document.
-
-  4. Combined Works.
-
-  You may convey a Combined Work under terms of your choice that,
-taken together, effectively do not restrict modification of the
-portions of the Library contained in the Combined Work and reverse
-engineering for debugging such modifications, if you also do each of
-the following:
-
-   a) Give prominent notice with each copy of the Combined Work that
-   the Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the Combined Work with a copy of the GNU GPL and this license
-   document.
-
-   c) For a Combined Work that displays copyright notices during
-   execution, include the copyright notice for the Library among
-   these notices, as well as a reference directing the user to the
-   copies of the GNU GPL and this license document.
-
-   d) Do one of the following:
-
-       0) Convey the Minimal Corresponding Source under the terms of this
-       License, and the Corresponding Application Code in a form
-       suitable for, and under terms that permit, the user to
-       recombine or relink the Application with a modified version of
-       the Linked Version to produce a modified Combined Work, in the
-       manner specified by section 6 of the GNU GPL for conveying
-       Corresponding Source.
-
-       1) Use a suitable shared library mechanism for linking with the
-       Library.  A suitable mechanism is one that (a) uses at run time
-       a copy of the Library already present on the user's computer
-       system, and (b) will operate properly with a modified version
-       of the Library that is interface-compatible with the Linked
-       Version.
-
-   e) Provide Installation Information, but only if you would otherwise
-   be required to provide such information under section 6 of the
-   GNU GPL, and only to the extent that such information is
-   necessary to install and execute a modified version of the
-   Combined Work produced by recombining or relinking the
-   Application with a modified version of the Linked Version. (If
-   you use option 4d0, the Installation Information must accompany
-   the Minimal Corresponding Source and Corresponding Application
-   Code. If you use option 4d1, you must provide the Installation
-   Information in the manner specified by section 6 of the GNU GPL
-   for conveying Corresponding Source.)
-
-  5. Combined Libraries.
-
-  You may place library facilities that are a work based on the
-Library side by side in a single library together with other library
-facilities that are not Applications and are not covered by this
-License, and convey such a combined library under terms of your
-choice, if you do both of the following:
-
-   a) Accompany the combined library with a copy of the same work based
-   on the Library, uncombined with any other library facilities,
-   conveyed under the terms of this License.
-
-   b) Give prominent notice with the combined library that part of it
-   is a work based on the Library, and explaining where to find the
-   accompanying uncombined form of the same work.
-
-  6. Revised Versions of the GNU Lesser General Public License.
-
-  The Free Software Foundation may publish revised and/or new versions
-of the GNU Lesser General Public License from time to time. Such new
-versions will be similar in spirit to the present version, but may
-differ in detail to address new problems or concerns.
-
-  Each version is given a distinguishing version number. If the
-Library as you received it specifies that a certain numbered version
-of the GNU Lesser General Public License "or any later version"
-applies to it, you have the option of following the terms and
-conditions either of that published version or of any later version
-published by the Free Software Foundation. If the Library as you
-received it does not specify a version number of the GNU Lesser
-General Public License, you may choose any version of the GNU Lesser
-General Public License ever published by the Free Software Foundation.
-
-  If the Library as you received it specifies that a proxy can decide
-whether future versions of the GNU Lesser General Public License shall
-apply, that proxy's public statement of acceptance of any version is
-permanent authorization for you to choose that version for the
-Library.

contrib/py-bindings/pygf.h

@@ -1,96 +0,0 @@
-#include <Python.h>
-#include "HsFFI.h"
-
-#ifdef __GLASGOW_HASKELL__
-#include "PyGF_stub.h"
-
-extern void __stginit_PyGF ( void );
-#endif
-
-static inline void gf_init(int *argc, char ***argv)
-{
-  hs_init(argc, argv);
-#ifdef __GLASGOW_HASKELL__
-  hs_add_root(__stginit_PyGF);
-#endif
-}
-
-static inline void gf_exit(void)
-{
-  hs_exit();
-}
-
-typedef HsStablePtr GF_PGF;
-typedef HsStablePtr GF_CId;
-typedef HsStablePtr GF_Language;
-typedef HsStablePtr GF_Type;
-typedef HsStablePtr GF_Tree;
-typedef HsStablePtr GF_Expr;
-typedef struct {
-  PyObject_HEAD;
-  HsStablePtr sp;
-} PyGF;
-
-
-#define NEWOBJECT(OBJ, GFTYPE) typedef struct {\
-  PyObject_HEAD \
-  GFTYPE obj; \
-  } OBJ;
-
-#define PYTYPE(OBJ) OBJ ## Type
-#define NEWCONSTRUCTOR(OBJ) inline OBJ* new ## OBJ () {\
-    return (OBJ*)PYTYPE(OBJ).tp_new(&PYTYPE(OBJ),NULL,NULL); }
-
-#define NEWTYPE(TYPE,NAME,OBJECT,DOC) static PyTypeObject TYPE = {\
-    PyObject_HEAD_INIT(NULL)\
-    0,                         /*ob_size*/\
-    NAME,             /*tp_name*/\
-    sizeof(OBJECT), /*tp_basicsize*/\
-    0,                         /*tp_itemsize*/\
-    0,                         /*tp_dealloc*/\
-    0,                         /*tp_print*/\
-    0,                         /*tp_getattr*/\
-    0,                         /*tp_setattr*/\
-    0,                         /*tp_compare*/\
-    0,                         /*tp_repr*/\
-    0,                         /*tp_as_number*/\
-    0,                         /*tp_as_sequence*/\
-    0,                         /*tp_as_mapping*/\
-    0,                         /*tp_hash */\
-    0,                         /*tp_call*/\
-    0,                         /*tp_str*/\
-    0,                         /*tp_getattro*/\
-    0,                         /*tp_setattro*/\
-    0,                         /*tp_as_buffer*/\
-    Py_TPFLAGS_DEFAULT,        /*tp_flags*/\
-    DOC,           /* tp_doc */\
-  };
-#define NEWGF(OBJ,GFTYPE,TYPE,NAME,DOC) NEWOBJECT(OBJ,GFTYPE)   \
-  NEWTYPE(TYPE,NAME,OBJ,DOC)\
-  NEWCONSTRUCTOR(OBJ)
-
-
-// NEWOBJECT(CID, GF_CId)
-
-#ifdef DEBUG
-#define DEALLOCFN(delname,t,cb,cbname) static void \
-delname(t *self){ cb(self);\
-	printf("gf_%s has been called for stable pointer 0x%x\n", cbname, self->obj);\
-	self->ob_type->tp_free((PyObject*)self); }
-#else
-#define DEALLOCFN(delname,t,cb,cbname) static void \
-delname(t *self){ cb(self);\
-	self->ob_type->tp_free((PyObject*)self); }
-#endif
-
-#ifdef DEBUG
-#define REPRCB(cbid,t,gfcb) static PyObject* \
-cbid(t *self) { \
-	const char *str = gfcb(self); \
- 	return PyString_FromFormat("0x%x: %s", self->obj, str); }
-#else
-#define REPRCB(cbid,t,gfcb) static PyObject* \
-cbid(t *self) { \
-	const char *str = gfcb(self); \
- 	return PyString_FromString(str); }
-#endif

contrib/py-bindings/test.py

@@ -1,167 +0,0 @@
-#!/usr/bin/env python
-# GF Python bindings
-# Jordi Saludes 2010
-#
- 
-
-import gf
-import unittest
-
-
-samples = [
-	(['Odd', ['Number', 89]],
-	 {'eng': "is 89 odd",
-	  'spa': "89 es impar"}),
-	(['Prime', ['Number', 21]],
-	 {'eng': "is 21 prime",
-	  'spa': "21 es primo"})]
-
-def lang2iso(l):
-	s = rmprefix(l)
-	assert s[:5]=="Query"
-	return s[5:].lower()
-
-def exp2str(e):
-	def e2s(e,n):
-		if type(e) == type([2]):
-			f = e[0]
-			sr = ' '.join([e2s(arg,n+1) for arg in e[1:]])
-			ret =f + ' ' + sr
-			return n and '('+ret+')' or ret
-		elif type(e) == type('2'):
-			return e
-		elif type(e) == type(2):
-			return `e`
-		else:
-			raise ValueError, "Do not know how to render " + `e`
-	return e2s(e,0)
-		
-
-import re
-hexre = re.compile('0x[0-9a-f]+:[ ]*')
-def rmprefix(obj):
-	return `obj`
-#	s = `obj`
-#	m = hexre.match(s)
-#	return m and s[m.end(0):]
-
-class TestPgfInfo(unittest.TestCase):
-	def pgf(self, path=None):
-		path = path or self.path
-		return gf.read_pgf(path)
-	def setUp(self):
-		self.path = 'Query.pgf'
-	def test_readPgf(self):
-		pgf = self.pgf()
-		self.assertNotEqual(pgf,None)
-	def test_readNonExistent(self):
-		nopath = 'x' + self.path
-		self.assertRaises(IOError, self.pgf, nopath)
-	def test_startcat(self):
-		pgf = self.pgf()
-		cat = pgf.startcat()
-		self.assertEqual(rmprefix(cat),'Question')
-	def test_categories(self):
-		pgf = self.pgf()
-		cats = [`c` for c in pgf.categories()]
-		self.failUnless('Float' in cats)
-		self.failUnless('Int' in cats)
-		self.failUnless('String' in cats)
-	def test_createLanguage(self):
-		pgf = self.pgf()
-		for lang in 'QueryEng QuerySpa'.split():
-			l = gf.read_language(lang) 
-			self.assertEqual(rmprefix(l),lang)
-	def test_functions(self):
-		pgf = self.pgf()
-		self.assertTrue('Even' in [`f` for f in pgf.functions()])
-	def test_function_types(self):
-		pgf = self.pgf()
-		gftypes = dict((`f`,`pgf.fun_type(f)`) for f in pgf.functions())
-		for p in "Prime : Object -> Question; Yes : Answer".split(';'):
-			lhs,rhs = [s.strip() for s in p.split(':')]
-			self.assertEqual(gftypes[lhs],rhs)
-
-class TestParsing(unittest.TestCase):
-	def setUp(self):
-		self.lexed = samples
-		self.lang = 'QueryEng'
-		self.pgf = "Query.pgf"
-
-	def test_parse(self):
-		pgf = gf.read_pgf(self.pgf)
-		l = gf.read_language(self.lang)
-		for abs,cnc in self.lexed:
-			rabs = exp2str(abs)
-			ps = pgf.parse(cnc['eng'], l)
-			self.failUnless(ps)
-			pt = rmprefix(ps[0])
-			self.assertEqual(pt,rabs)
-
-
-class TestLinearize(unittest.TestCase):
-	def setUp(self):
-		self.samples = samples
-		self.pgf = gf.read_pgf('Query.pgf') 
-		self.lang = gf.read_language('QueryEng')
-
-	def test_Linearize(self):
-		l = self.lang
-		for abs,cnc in self.samples:
-			ts = self.pgf.parse(cnc['eng'], l)
-			self.assertEqual(cnc['eng'],self.pgf.lin(l,ts[0]))
-
-class TestTranslate(unittest.TestCase):
-	def setUp(self):
-		self.samples = samples
-		self.pgf = gf.read_pgf('Query.pgf')
-		self.langs = [(lang2iso(l),l) for l in self.pgf.languages()]
-
-	def test_translate(self):
-		for abs,cnc in self.samples:
-			for i,l in self.langs:
-				for j,m in self.langs:
-					if i==j: continue
-					parsed = self.pgf.parse(cnc[i],l)
-					assert len(parsed) == 1
-					lin = self.pgf.lin(m,parsed[0])
-					self.assertEqual(lin,cnc[j])
-
-class TestUnapplyExpr(unittest.TestCase):
-	def setUp(self):
-		self.samples = samples
-		self.pgf = gf.read_pgf('Query.pgf')
-		self.langs = dict([(lang2iso(l),l) for l in self.pgf.languages()])
-
-	def deep_unapp(self,exp):
-		exp = exp.unapply()
-		if type(exp) == type([2]):
-			f = exp[0]
-			return [`f`] + map(self.deep_unapp,exp[1:])
-		else:
-			return exp
-		
-
-	def test_unapply(self):
-		lg = 'eng'
-		lang = self.langs[lg]
-		for abs,cnc in self.samples:
-			parsed = self.pgf.parse(cnc[lg],lang)
-			uparsed = self.deep_unapp(parsed[0])
-			self.assertEqual(abs,uparsed)
-
-	def test_infer(self):
-		lg = 'eng'
-		lang = self.langs[lg]
-		cnc = self.samples[0][1]
-		parsed = self.pgf.parse(cnc[lg],lang)
-		exp = parsed[0]
-		for t in 'Question Object Int'.split():
-			self.assertEqual(`exp.infer(self.pgf)`, t)
-			uexp = exp.unapply()
-			if type(uexp) != type(2) and type(uexp) != type('2'):
-				exp = uexp[1]
-
-
-if __name__ == '__main__':
-	unittest.main()

contrib/summerschool/foods/Foods.gf

@@ -1,15 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-abstract Foods = {
-  flags startcat = Comment ;
-  cat
-    Comment ; Item ; Kind ; Quality ;
-  fun
-    Pred : Item -> Quality -> Comment ;
-    This, That, These, Those : Kind -> Item ;
-    Mod : Quality -> Kind -> Kind ;
-    Wine, Cheese, Fish, Pizza : Kind ;
-    Very : Quality -> Quality ;
-    Fresh, Warm, Italian, 
-      Expensive, Delicious, Boring : Quality ;
-}

contrib/summerschool/foods/FoodsAfr.gf

@@ -1,76 +0,0 @@
--- (c) 2009 Laurette Pretorius Sr & Jr and Ansu Berg under LGPL
-
-concrete FoodsAfr of Foods = open Prelude, Predef in{
-	lincat
-		Comment = {s: Str} ;
-		Kind = {s: Number => Str} ;
-		Item = {s: Str ; n: Number} ;
-		Quality = {s: AdjAP => Str} ;
-		
-	lin	
-		Pred item quality = {s = item.s ++ "is" ++ (quality.s ! Predic)};
-		This kind = {s = "hierdie" ++ (kind.s ! Sg); n = Sg};
-		That kind = {s = "daardie" ++ (kind.s ! Sg); n = Sg};
-		These kind = {s = "hierdie" ++ (kind.s ! Pl); n = Pl};
-		Those kind = {s = "daardie" ++ (kind.s ! Pl); n = Pl};
-		Mod quality kind = {s = table{n => (quality.s ! Attr) ++ (kind.s!n)}};
-		
-		Wine = declNoun_e "wyn";
-		Cheese = declNoun_aa "kaas";
-		Fish = declNoun_ss "vis";
-		Pizza = declNoun_s "pizza";
-		
-		Very quality = veryAdj quality;
-		
-		Fresh = regAdj "vars";
-		Warm = regAdj "warm";
-		Italian = smartAdj_e "Italiaans";
-		Expensive = regAdj "duur";
-		Delicious = smartAdj_e "heerlik";
-		Boring = smartAdj_e "vervelig";
-		
-	param
-		AdjAP = Attr | Predic ;
-		Number = Sg | Pl ;
-	
-	oper
-		--Noun operations (wyn, kaas, vis, pizza)
-		
-		declNoun_aa: Str -> {s: Number => Str} = \x ->
-		let v = tk 2 x
-		in
-		{s = table{Sg => x ; Pl => v + (last x) +"e"}}; 
-		
-		declNoun_e: Str -> {s: Number => Str} = \x -> {s = table{Sg => x ; Pl => x + "e"}} ;
-		declNoun_s: Str -> {s: Number => Str} = \x -> {s = table{Sg => x ; Pl => x + "s"}} ;
-		
-		declNoun_ss: Str -> {s: Number => Str} = \x -> {s = table{Sg => x ; Pl => x + (last x) + "e"}} ;
-
-		
-		--Adjective operations
-		
-		mkAdj : Str -> Str -> {s: AdjAP => Str} = \x,y -> {s = table{Attr => x; Predic => y}};
-		
-		declAdj_e : Str -> {s : AdjAP=> Str} = \x -> mkAdj (x + "e") x;
-		declAdj_g : Str -> {s : AdjAP=> Str} = \w ->
-			let v = init w
-			in mkAdj (v + "ë") w ;
-		
-		declAdj_oog : Str -> {s : AdjAP=> Str} = \w ->
-			let v = init w
-			in 
-				let i = init v
-				in mkAdj (i + "ë") w ;
-					
-		regAdj : Str -> {s : AdjAP=> Str} = \x -> mkAdj x x;
-		
-		veryAdj : {s: AdjAP => Str} -> {s : AdjAP=> Str} =  \x -> {s = table{a => "baie" ++ (x.s!a)}};
-		
-		
-		smartAdj_e : Str -> {s : AdjAP=> Str} = \a -> case a of 
-		{
-			_ + "oog" 			   		=> declAdj_oog a ;
-			_ + ("e" | "ie" | "o" | "oe") + "g" 	=> declAdj_g a ;
-			_					   	=> declAdj_e a 
-		};
-}

contrib/summerschool/foods/FoodsAmh.gf

@@ -1,21 +0,0 @@
-concrete FoodsAmh of Foods ={
- flags coding = utf8;
- lincat
-  Comment,Item,Kind,Quality = Str;
- lin
-  Pred item quality = item ++ quality++ "ነው::" ;
-  This kind = "ይህ" ++ kind;
-  That kind = "ያ" ++ kind;
-  Mod quality kind = quality ++ kind;
-  Wine = "ወይን";
-  Cheese = "አይብ";
-  Fish = "ዓሳ";
-  Very quality = "በጣም" ++ quality;
-  Fresh = "አዲስ";
-  Warm = "ትኩስ";
-  Italian = "የጥልያን";
-  Expensive = "ውድ";
-  Delicious = "ጣፋጭ";
-  Boring = "አስቀያሚ";
-  
-}   

contrib/summerschool/foods/FoodsBul.gf

@@ -1,43 +0,0 @@
--- (c) 2009 Krasimir Angelov under LGPL
-
-concrete FoodsBul of Foods = {
-  
-  flags
-    coding = utf8;
-
-  param
-    Gender = Masc | Fem | Neutr;
-    Number = Sg | Pl;
-    Agr    = ASg Gender | APl ;
-
-  lincat
-    Comment = Str ;
-    Quality = {s : Agr => Str} ;
-    Item = {s : Str; a : Agr} ;
-    Kind = {s : Number => Str; g : Gender} ;
-
-  lin
-    Pred item qual = item.s ++ case item.a of {ASg _ => "е"; APl => "са"} ++ qual.s ! item.a ;
-    
-    This  kind = {s=case kind.g of {Masc=>"този"; Fem=>"тази";  Neutr=>"това" } ++ kind.s ! Sg; a=ASg kind.g} ;
-    That  kind = {s=case kind.g of {Masc=>"онзи"; Fem=>"онази"; Neutr=>"онова"} ++ kind.s ! Sg; a=ASg kind.g} ;
-    These kind = {s="тези"  ++ kind.s ! Pl; a=APl} ;
-    Those kind = {s="онези" ++ kind.s ! Pl; a=APl} ;
-    
-    Mod qual kind = {s=\\n => qual.s ! (case n of {Sg => ASg kind.g; Pl => APl}) ++ kind.s ! n; g=kind.g} ;
-
-    Wine   = {s = table {Sg => "вино";   Pl => "вина"};   g = Neutr};
-    Cheese = {s = table {Sg => "сирене"; Pl => "сирена"}; g = Neutr};
-    Fish   = {s = table {Sg => "риба";   Pl => "риби"};   g = Fem};
-    Pizza  = {s = table {Sg => "пица";   Pl => "пици"};   g = Fem};
-
-    Very qual = {s = \\g => "много" ++ qual.s ! g};
-
-    Fresh     = {s = table {ASg Masc => "свеж";        ASg Fem => "свежа";       ASg Neutr => "свежо";       APl => "свежи"}};
-    Warm      = {s = table {ASg Masc => "горещ";       ASg Fem => "гореща";      ASg Neutr => "горещо";      APl => "горещи"}};
-    Italian   = {s = table {ASg Masc => "италиански";  ASg Fem => "италианска";  ASg Neutr => "италианско";  APl => "италиански"}}; 
-    Expensive = {s = table {ASg Masc => "скъп";        ASg Fem => "скъпа";       ASg Neutr => "скъпо";       APl => "скъпи"}};
-    Delicious = {s = table {ASg Masc => "превъзходен"; ASg Fem => "превъзходна"; ASg Neutr => "превъзходно"; APl => "превъзходни"}};
-    Boring    = {s = table {ASg Masc => "еднообразен"; ASg Fem => "еднообразна"; ASg Neutr => "еднообразно"; APl => "еднообразни"}};
-    
-}

contrib/summerschool/foods/FoodsCat.gf

@@ -1,7 +0,0 @@
---# -path=.:present
-
--- (c) 2009 Jordi Saludes under LGPL
-
-concrete FoodsCat of Foods = FoodsI with 
-  (Syntax = SyntaxCat),
-  (LexFoods = LexFoodsCat) ;

contrib/summerschool/foods/FoodsDut.gf

@@ -1,58 +0,0 @@
--- (c) 2009 Femke Johansson under LGPL
-
-concrete FoodsDut of Foods = {
-
-	lincat
-		Comment = {s : Str};
-		Quality = {s : AForm => Str};
-		Kind = { s : Number => Str};
-		Item = {s : Str ; n : Number};
-	
-	lin
-		Pred item quality = 
-			{s = item.s ++ copula ! item.n ++ quality.s ! APred};
-		This = det Sg "deze";
-		These = det Pl "deze";
-		That = det Sg "die";
-		Those = det Pl "die";
-		
-		Mod quality kind =
-			{s = \\n => quality.s ! AAttr ++ kind.s ! n};
-			Wine = regNoun "wijn";
-			Cheese = noun "kaas" "kazen";
-			Fish = noun "vis" "vissen";
-			Pizza = noun "pizza" "pizza's";
-			
-			Very a = {s = \\f => "erg" ++ a.s ! f};
-			
-			Fresh = regadj "vers";
-			Warm = regadj "warm";
-			Italian = regadj "Italiaans";
-			Expensive = adj "duur" "dure";
-			Delicious = regadj "lekker";
-			Boring = regadj "saai";
-		
-		param
-			Number = Sg | Pl;
-			AForm = APred | AAttr;
-		
-		oper
-			det : Number -> Str ->
-				{s : Number => Str} -> {s : Str ; n: Number} =
-				\n,det,noun -> {s = det ++ noun.s ! n ; n=n};
-				
-			noun : Str -> Str -> {s : Number => Str} = 
-				\man,men -> {s = table {Sg => man; Pl => men}};
-				
-			regNoun : Str -> {s : Number => Str} =
-				\wijn -> noun wijn (wijn + "en");
-				
-			regadj : Str -> {s : AForm => Str} =
-				\koud -> adj koud (koud+"e");
-			
-			adj : Str -> Str -> {s : AForm => Str} =
-				\duur, dure -> {s = table {APred => duur; AAttr => dure}};
-				
-			copula : Number => Str =
-				table {Sg => "is" ; Pl => "zijn"};
-}

contrib/summerschool/foods/FoodsEng.gf

@@ -1,43 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsEng of Foods = {
-  flags language = en_US;
-  lincat
-    Comment, Quality = {s : Str} ; 
-    Kind = {s : Number => Str} ; 
-    Item = {s : Str ; n : Number} ; 
-  lin
-    Pred item quality = 
-      {s = item.s ++ copula ! item.n ++ quality.s} ;
-    This  = det Sg "this" ;
-    That  = det Sg "that" ;
-    These = det Pl "these" ;
-    Those = det Pl "those" ;
-    Mod quality kind = 
-      {s = \\n => quality.s ++ kind.s ! n} ;
-    Wine = regNoun "wine" ;
-    Cheese = regNoun "cheese" ;
-    Fish = noun "fish" "fish" ;
-    Pizza = regNoun "pizza" ;
-    Very a = {s = "very" ++ a.s} ;
-    Fresh = adj "fresh" ;
-    Warm = adj "warm" ;
-    Italian = adj "Italian" ;
-    Expensive = adj "expensive" ;
-    Delicious = adj "delicious" ;
-    Boring = adj "boring" ;
-  param
-    Number = Sg | Pl ;
-  oper
-    det : Number -> Str -> 
-      {s : Number => Str} -> {s : Str ; n : Number} = 
-        \n,det,noun -> {s = det ++ noun.s ! n ; n = n} ;
-    noun : Str -> Str -> {s : Number => Str} = 
-      \man,men -> {s = table {Sg => man ; Pl => men}} ;
-    regNoun : Str -> {s : Number => Str} = 
-      \car -> noun car (car + "s") ;
-    adj : Str -> {s : Str} = 
-      \cold -> {s = cold} ;
-    copula : Number => Str = 
-      table {Sg => "is" ; Pl => "are"} ;
-}

contrib/summerschool/foods/FoodsEpo.gf

@@ -1,48 +0,0 @@
--- (c) 2009 Julia Hammar under LGPL
-
-concrete FoodsEpo of Foods = open Prelude in {
-
-  flags coding =utf8 ;
-
-  lincat
-    Comment = SS ; 
-    Kind, Quality = {s : Number => Str} ; 
-    Item = {s : Str ; n : Number} ; 
-
-  lin
-    Pred item quality = ss (item.s ++ copula ! item.n ++ quality.s ! item.n) ;
-    This = det Sg "ĉi tiu" ;
-    That  = det Sg "tiu" ;
-    These = det Pl "ĉi tiuj" ;
-    Those = det Pl "tiuj" ;
-    Mod quality kind = {s = \\n => quality.s ! n ++ kind.s ! n} ;
-    Wine = regNoun "vino" ;
-    Cheese = regNoun "fromaĝo" ;
-    Fish = regNoun "fiŝo" ;
-    Pizza = regNoun "pico" ;
-    Very quality = {s = \\n => "tre" ++ quality.s ! n} ;
-    Fresh = regAdj "freŝa" ;
-    Warm = regAdj "varma" ;
-    Italian = regAdj "itala" ;
-    Expensive = regAdj "altekosta" ;
-    Delicious = regAdj "bongusta" ;
-    Boring = regAdj "enuiga" ;
-
-  param
-    Number = Sg | Pl ;
-
-  oper
-    det : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = 
-      \n,d,cn -> {
-        s = d ++ cn.s ! n ;
-        n = n
-      } ;
-    regNoun : Str -> {s : Number => Str} = 
-      \vino -> {s = table {Sg => vino ; Pl => vino + "j"}
-	} ;
-    regAdj : Str -> {s : Number => Str} =
-      \nova -> {s = table {Sg => nova ; Pl => nova + "j"}
-      } ;
-    copula : Number => Str = \\_ => "estas" ;
-}
-    

contrib/summerschool/foods/FoodsFin.gf

@@ -1,7 +0,0 @@
---# -path=.:present
-
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsFin of Foods = FoodsI with 
-  (Syntax = SyntaxFin),
-  (LexFoods = LexFoodsFin) ;

contrib/summerschool/foods/FoodsGer.gf

@@ -1,7 +0,0 @@
---# -path=.:present
-
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsGer of Foods = FoodsI with 
-  (Syntax = SyntaxGer),
-  (LexFoods = LexFoodsGer) ;

contrib/summerschool/foods/FoodsHeb.gf

@@ -1,108 +0,0 @@
---# -path=alltenses
-
---(c) 2009 Dana Dannells
--- Licensed under LGPL
-
-concrete FoodsHeb of Foods = open Prelude in {
-  
-  flags coding=utf8 ;
-
-    lincat
-      Comment = SS ;
-      Quality = {s: Number => Species => Gender =>  Str} ;  
-      Kind = {s : Number => Species => Str ; g : Gender ; mod : Modified} ; 
-      Item = {s : Str ; g : Gender ; n : Number ; sp : Species ; mod : Modified} ; 
-  
- 
-    lin
-      Pred item quality = ss (item.s ++ quality.s ! item.n ! Indef ! item.g ) ; 
-      This  = det Sg Def "הזה" "הזאת"; 
-      That  = det Sg Def "ההוא" "ההיא" ; 
-      These = det Pl Def "האלה" "האלה" ; 
-      Those = det Pl Def "ההם" "ההן" ; 
-      Mod quality kind = {
-	s = \\n,sp => kind.s ! n ! sp ++ quality.s ! n ! sp ! kind.g;
-	g = kind.g ;
-	mod = T
-	} ;     
-      Wine = regNoun "יין" "יינות" Masc ; 
-      Cheese = regNoun "גבינה" "גבינות" Fem ;  
-      Fish = regNoun "דג" "דגים" Masc ; 
-      Pizza = regNoun "פיצה" "פיצות" Fem ; 
-      Very qual = {s = \\g,n,sp => "מאוד" ++  qual.s ! g ! n ! sp} ;
-      Fresh = regAdj "טרי" ; 
-      Warm = regAdj "חם" ;
-      Italian = regAdj2 "איטלקי" ;
-      Expensive = regAdj "יקר" ; 
-      Delicious = regAdj "טעים" ; 
-      Boring = regAdj2 "משעמם"; 
-
-    param 
-      Number = Sg | Pl ;
-      Gender = Masc | Fem ;
-      Species = Def | Indef ;  
-      Modified = T | F ;
-
-    oper
-	Noun : Type = {s : Number => Species => Str ; g : Gender ; mod : Modified } ;
-  	Adj : Type = {s : Number => Species => Gender => Str} ;
-
-      det : Number -> Species -> Str -> Str -> Noun -> 
-	{s : Str ; g :Gender ; n : Number ; sp : Species ; mod : Modified} = 
-        \n,sp,m,f,cn -> {
-	  s = case cn.mod of { _ => cn.s ! n ! sp ++ case cn.g of {Masc => m ; Fem  => f} };
-	  g = cn.g ; 
-          n = n ;
-	  sp = sp ;
-	  mod = cn.mod
-        } ;
-      
-	noun : (gvina,hagvina,gvinot,hagvinot : Str) ->  Gender -> Noun =  
-      		\gvina,hagvina,gvinot,hagvinot,g -> {
-        	s = table {
-          		Sg  => table {
-             			Indef => gvina ;
-             			Def =>  hagvina 
-            		} ;
-          		Pl => table {
-             			Indef => gvinot ;
-             			Def => hagvinot  
-            		} 
-       	  	} ;
-        	g = g ;
-		mod = F 
-      } ;
-
-	regNoun : Str -> Str -> Gender -> Noun = 
-	        \gvina,gvinot, g -> 
-		noun gvina (defH gvina) gvinot (defH gvinot) g ; 
-
-      defH : Str -> Str = \cn ->
-	case cn of {_ => "ה" + cn};	
-
-      replaceLastLetter : Str -> Str = \c ->
-	 case c of {"ף" => "פ" ; "ם" => "מ" ; "ן" => "נ" ; "ץ" => "צ" ; "ך" => "כ"; _ => c} ;
-	      
-      adjective : (_,_,_,_ : Str) -> Adj = 
-       \tov,tova,tovim,tovot -> {
-        s = table {
-          Sg => table { 
-			Indef => table { Masc => tov ; Fem => tova } ; 
-			Def => table { Masc => defH tov ; Fem => defH tova }  
-            		} ; 
-          Pl => table { 
-			Indef => table {Masc => tovim ; Fem  => tovot } ; 
-			Def => table { Masc => defH tovim ; Fem  => defH tovot }  
-            		}
-	}
-      } ;
-    
-      regAdj : Str -> Adj = \tov ->
-	case tov of { to + c@? =>
-	adjective tov (to + replaceLastLetter (c) + "ה" ) (to + replaceLastLetter (c) +"ים" ) (to + replaceLastLetter (c) + "ות" )};	 
-     
-     regAdj2 : Str -> Adj = \italki ->
- 	case italki of { italk+ c@? => 
-    adjective italki (italk + replaceLastLetter (c)  +"ת" )  (italk + replaceLastLetter (c)+ "ים" ) (italk + replaceLastLetter (c)  + "ות" )};
-
-}  -- FoodsHeb  

contrib/summerschool/foods/FoodsHin.gf

@@ -1,75 +0,0 @@
--- (c) 2010 Vikash Rauniyar under LGPL
-
-concrete FoodsHin of Foods = {
-
-  flags coding=utf8 ;
-
-  param
-    Gender = Masc | Fem ;
-    Number = Sg | Pl ;
-  lincat
-    Comment = {s : Str} ;
-    Item    = {s : Str ; g : Gender ; n : Number} ;
-    Kind    = {s : Number => Str ; g : Gender} ;
-    Quality = {s : Gender => Number => Str} ;
-  lin
-    Pred item quality = {
-      s = item.s ++ quality.s ! item.g ! item.n ++ copula item.n
-      } ;
-    This kind = {s = "यह" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;
-    That kind = {s = "वह" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;
-    These kind = {s = "ये" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;
-    Those kind = {s = "वे" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;
-    Mod quality kind = {
-      s = \\n => quality.s ! kind.g ! n ++ kind.s ! n ; 
-      g = kind.g
-      } ;
-    Wine = regN "मदिरा" ;
-    Cheese = regN "पनीर" ;
-    Fish = regN "मछली" ;
-    Pizza = regN "पिज़्ज़ा" ;
-    Very quality = {s = \\g,n => "अति" ++ quality.s ! g ! n} ;
-    Fresh = regAdj "ताज़ा" ;
-    Warm = regAdj "गरम" ;
-    Italian = regAdj "इटली" ; 
-    Expensive = regAdj "बहुमूल्य" ;
-    Delicious = regAdj "स्वादिष्ट" ;
-    Boring = regAdj "अरुचिकर" ;
-
-  oper
-    mkN : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = 
-      \s,p,g -> {
-        s = table {
-          Sg => s ;
-          Pl => p
-          } ;
-        g = g
-      } ;
-
-    regN : Str -> {s : Number => Str ; g : Gender} = \s -> case s of {
-      lark + "ा" => mkN s (lark + "े") Masc ;
-      lark + "ी" => mkN s (lark + "ीयँा") Fem ;
-      _           => mkN s s Masc 
-      } ;
-
-    mkAdj : Str -> Str -> Str -> {s : Gender => Number => Str} = \ms,mp,f -> {
-      s = table {
-        Masc => table {
-          Sg => ms ;
-          Pl => mp
-          } ;
-        Fem  => \\_ => f
-        }
-      } ;
-
-    regAdj : Str -> {s : Gender => Number => Str} = \a -> case a of {
-      acch + "ा" => mkAdj a (acch + "े") (acch + "ी") ;
-      _          => mkAdj a a a
-      } ;
-
-    copula : Number -> Str = \n -> case n of {
-      Sg => "है" ;
-      Pl => "हैं"
-      } ;
-
-  }

contrib/summerschool/foods/FoodsI.gf

@@ -1,29 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-incomplete concrete FoodsI of Foods = 
-    open Syntax, LexFoods in {
-  lincat
-    Comment = Utt ; 
-    Item = NP ;
-    Kind = CN ;
-    Quality = AP ;
-  lin
-    Pred item quality = mkUtt (mkCl item quality) ;
-    This kind = mkNP this_Det kind ;
-    That kind = mkNP that_Det kind ;
-    These kind = mkNP these_Det kind ;
-    Those kind = mkNP those_Det kind ;
-    Mod quality kind = mkCN quality kind ;
-    Very quality = mkAP very_AdA quality ;
-
-    Wine = mkCN wine_N ;
-    Pizza = mkCN pizza_N ;
-    Cheese = mkCN cheese_N ;
-    Fish = mkCN fish_N ;
-    Fresh = mkAP fresh_A ;
-    Warm = mkAP warm_A ;
-    Italian = mkAP italian_A ;
-    Expensive = mkAP expensive_A ;
-    Delicious = mkAP delicious_A ;
-    Boring = mkAP boring_A ;
-}

contrib/summerschool/foods/FoodsIce.gf

@@ -1,84 +0,0 @@
---# -path=.:prelude
-
--- (c) 2009 Martha Dis Brandt under LGPL
-
-concrete FoodsIce of Foods = open Prelude in {
-
---flags coding=utf8;
-
-  lincat
-    Comment = SS ; 
-    Quality = {s : Gender => Number => Defin => Str} ; 
-    Kind = {s : Number => Str ; g : Gender} ; 
-    Item = {s : Str ; g : Gender ; n : Number} ; 
-
-  lin
-    Pred item quality =  ss (item.s ++ copula item.n ++ quality.s ! item.g ! item.n ! Ind) ;
-         This, That  = det Sg "þessi"   "þessi"  "þetta" ;
-         These, Those = det Pl "þessir" "þessar" "þessi" ;
-    Mod quality kind = { s = \\n => quality.s ! kind.g ! n ! Def ++ kind.s ! n ; g = kind.g } ;
-         Wine = noun "vín" "vín" Neutr ;
-         Cheese = noun "ostur" "ostar" Masc ; 
-         Fish = noun "fiskur" "fiskar" Masc ; 
-         -- the word "pizza" is more commonly used in Iceland, but "flatbaka" is the Icelandic word for it
-         Pizza = noun "flatbaka" "flatbökur" Fem ;
-    Very qual = {s = \\g,n,defOrInd => "mjög" ++ qual.s ! g ! n ! defOrInd } ;
-         Fresh = regAdj "ferskur" ;
-         Warm = regAdj "heitur" ;
-         Boring = regAdj "leiðinlegur" ;
-         -- the order of the given adj forms is: mSg fSg nSg mPl fPl nPl mSgDef f/nSgDef _PlDef
-         Italian = adjective "ítalskur" "ítölsk" "ítalskt" "ítalskir" "ítalskar" "ítölsk" "ítalski" "ítalska" "ítalsku" ;
-         Expensive = adjective "dýr" "dýr" "dýrt" "dýrir" "dýrar" "dýr" "dýri" "dýra" "dýru" ; 
-         Delicious = adjective "ljúffengur" "ljúffeng" "ljúffengt" "ljúffengir" "ljúffengar" "ljúffeng" "ljúffengi" "ljúffenga" "ljúffengu" ;
-
-  param
-    Number = Sg | Pl ;
-    Gender = Masc | Fem | Neutr ;
-    Defin = Ind | Def ;
-
-  oper
-    det : Number -> Str -> Str -> Str -> {s : Number => Str ; g : Gender} -> 
-        {s : Str ; g : Gender ; n : Number} = 
-      \n,masc,fem,neutr,cn -> {
-        s = case cn.g of {Masc => masc ; Fem => fem; Neutr => neutr } ++ cn.s ! n ;
-        g = cn.g ;
-        n = n
-      } ;
-
-    noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = 
-      \man,men,g -> {
-        s = table {
-          Sg => man ;
-          Pl => men 
-          } ;
-        g = g
-      } ;
-
-    adjective : (x1,_,_,_,_,_,_,_,x9 : Str) -> {s : Gender => Number => Defin => Str} =
-      \ferskur,fersk,ferskt,ferskir,ferskar,fersk_pl,ferski,ferska,fersku -> {
-         s = \\g,n,t => case <g,n,t> of {
-            < Masc, Sg, Ind > => ferskur ;
-            < Masc, Pl, Ind > => ferskir ;
-            < Fem, Sg, Ind > => fersk ;
-            < Fem, Pl, Ind > => ferskar ;
-            < Neutr, Sg, Ind > => ferskt ;
-            < Neutr, Pl, Ind > => fersk_pl;
-            < Masc, Sg, Def > => ferski ;
-            < Fem, Sg, Def > | < Neutr, Sg, Def > => ferska ;
-            < _ , Pl, Def > => fersku 
-            }
-          } ;
-
-    regAdj : Str -> {s : Gender => Number => Defin => Str} = \ferskur ->
-      let fersk = Predef.tk 2 ferskur
-      in adjective
-        ferskur fersk (fersk + "t")
-        (fersk + "ir") (fersk + "ar") fersk
-        (fersk + "i") (fersk + "a") (fersk + "u") ;
-
-    copula : Number -> Str = 
-      \n -> case n of {
-        Sg => "er" ;
-        Pl => "eru"
-        } ;
-}

contrib/summerschool/foods/FoodsIta.gf

@@ -1,8 +0,0 @@
---# -path=.:present
-
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsIta of Foods = FoodsI with 
-  (Syntax = SyntaxIta),
-  (LexFoods = LexFoodsIta) ;
-

contrib/summerschool/foods/FoodsJpn.gf

@@ -1,72 +0,0 @@
---# -path=.:../lib/src/prelude
-
--- (c) 2009 Zofia Stankiewicz under LGPL
-
-concrete FoodsJpn of Foods = open Prelude in {
-
-flags coding=utf8 ;
-
-  lincat
-    Comment = {s: Style => Str};
-    Quality = {s: AdjUse => Str ; t: AdjType} ;
-    Kind = {s : Number => Str} ; 
-    Item = {s : Str ; n : Number} ; 
-
-  lin
-    Pred item quality = {s = case quality.t of {
-      IAdj => table {Plain => item.s ++ quality.s ! APred ; Polite => item.s ++ quality.s ! APred ++ copula ! Polite ! item.n } ;
-      NaAdj => \\p => item.s ++ quality.s ! APred ++ copula ! p ! item.n } 
-      } ;
-    This  = det Sg "この" ;
-    That  = det Sg "その" ;
-    These = det Pl "この" ;
-    Those = det Pl "その" ;
-    Mod quality kind = {s = \\n => quality.s ! Attr ++ kind.s ! n} ;
-    Wine = regNoun "ワインは" ;
-    Cheese = regNoun "チーズは" ;
-    Fish = regNoun "魚は" ;
-    Pizza = regNoun "ピザは" ;
-    Very quality =  {s = \\a => "とても" ++ quality.s ! a ; t = quality.t } ;
-    Fresh = adj "新鮮な" "新鮮";
-    Warm = regAdj "あたたかい" ;
-    Italian = adj "イタリアの" "イタリアのもの";
-    Expensive = regAdj "たかい" ;
-    Delicious = regAdj "おいしい" ;
-    Boring = regAdj "つまらない" ;
-
-  param
-    Number = Sg | Pl ;
-    AdjUse = Attr | APred ;        -- na-adjectives have different forms as noun attributes and predicates
-    Style = Plain | Polite ;      -- for phrase types
-    AdjType = IAdj | NaAdj ;      -- IAdj can form predicates without the copula, NaAdj cannot
-
-  oper
-    det : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = 
-      \n,d,cn -> {
-        s = d ++ cn.s ! n ;
-        n = n
-      } ;
-   noun : Str -> Str -> {s : Number => Str} = 
-      \sakana,sakana -> {s = \\_ => sakana } ;
-
-   regNoun : Str -> {s : Number => Str} = 
-      \sakana -> noun sakana sakana ;
-
-   adj : Str -> Str -> {s : AdjUse => Str ; t : AdjType} =
-      \chosenna, chosen -> {
-       s = table { 
-         Attr => chosenna ;
-         APred => chosen
-       } ;
-       t = NaAdj 
-      } ;
-   
-   regAdj : Str -> {s: AdjUse => Str ; t : AdjType} =\akai -> {
-     s = \\_ => akai ; t = IAdj} ;
-
-    copula : Style => Number => Str = 
-      table { 
-        Plain => \\_ => "だ" ;
-        Polite => \\_ => "です" } ;
-
-}   

contrib/summerschool/foods/FoodsLav.gf

@@ -1,91 +0,0 @@
---# -path=.:prelude
-
--- (c) 2009 Inese Bernsone under LGPL
-
-concrete FoodsLav of Foods = open Prelude in {
-
-  flags
-    coding=utf8 ;
-    
-  lincat
-    Comment = SS ; 
-    Quality = {s : Q => Gender => Number => Defin => Str } ; 
-    Kind = {s : Number => Str ; g : Gender} ; 
-    Item = {s : Str ; g : Gender ; n : Number } ; 
-
-  lin
-    Pred item quality = ss (item.s ++ {- copula item.n -} "ir" ++ quality.s ! Q1 ! item.g ! item.n ! Ind ) ;
-      This  = det Sg "šis" "šī" ;
-      That  = det Sg "tas" "tā" ;
-      These = det Pl "šie" "šīs" ;
-      Those = det Pl "tie" "tās" ;
-    Mod quality kind = {s = \\n => quality.s ! Q1 ! kind.g ! n ! Def ++ kind.s ! n ; g = kind.g } ;
-      Wine = noun "vīns" "vīni" Masc ;
-      Cheese = noun "siers" "sieri" Masc ;
-      Fish = noun "zivs" "zivis" Fem ;
-      Pizza = noun "pica" "picas" Fem ;
-    Very qual = {s = \\q,g,n,spec => "ļoti" ++ qual.s ! Q2 ! g ! n ! spec }; 
- 
-      Fresh = adjective "svaigs" "svaiga" "svaigi" "svaigas" "svaigais" "svaigā" "svaigie" "svaigās" ;
-      Warm = regAdj "silts" ;
-      Italian = specAdj "itāļu" (regAdj "itālisks") ;
-      Expensive = regAdj "dārgs" ;
-      Delicious = regAdj "garšīgs" ;
-      Boring = regAdj "garlaicīgs" ;
-
-  param
-    Number = Sg | Pl ;
-    Gender = Masc | Fem ;
-    Defin = Ind | Def ;
-    Q = Q1 | Q2 ;
-
-  oper
-   det : Number -> Str -> Str -> {s : Number => Str ; g : Gender} -> 
-        {s : Str ; g : Gender ; n : Number} = 
-      \n,m,f,cn -> {
-        s = case cn.g of {Masc => m ; Fem => f} ++ cn.s ! n ;
-        g = cn.g ;
-        n = n
-      } ;
-    noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = 
-      \man,men,g -> {
-        s = table {
-          Sg => man ;
-          Pl => men 
-          } ;
-        g = g
-      } ;
-    adjective : (_,_,_,_,_,_,_,_ : Str) -> {s : Q => Gender => Number => Defin => Str} = 
-      \skaists,skaista,skaisti,skaistas,skaistais,skaistaa,skaistie,skaistaas -> {
-        s = table {
-		  _ => table {
-            Masc => table {
-              Sg => table {Ind => skaists ; Def => skaistais} ;
-              Pl => table {Ind => skaisti ; Def => skaistie}
-              } ; 
-            Fem => table {
-              Sg => table {Ind => skaista ; Def => skaistaa} ;
-              Pl => table {Ind => skaistas ; Def => skaistaas} 
-              }
-            } 
-		  }
-        } ;
-      
- {-   irregAdj : Str -> {s : Gender => Number => Defin => Str} = \itaalju ->
-     let itaalju = itaalju
-     in adjective itaalju (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) ; -}
-     
-    regAdj : Str -> {s : Q => Gender => Number => Defin => Str} = \skaists ->
-      let skaist = init skaists 
-      in adjective skaists (skaist + "a") (skaist + "i") (skaist + "as") (skaist + "ais") (skaist + "ā") (skaist + "ie") (skaist + "ās");
-
-    Adjective : Type = {s : Q => Gender => Number => Defin => Str} ;
-
-	specAdj : Str -> Adjective -> Adjective = \s,a -> {
-      s = table {
-        Q2 => a.s ! Q1 ;
-        Q1 => \\_,_,_ => s
-        }		
-	  } ;
-	
-	}

contrib/summerschool/foods/FoodsMlt.gf

@@ -1,103 +0,0 @@
--- (c) 2009 John Camilleri under LGPL
-
-concrete FoodsMlt of Foods = open Prelude in {
-	flags coding=utf8 ;
-
-	param
-		Number = Sg | Pl ;
-		Gender = Masc | Fem ;
-
-   lincat
-		Comment = SS ; 
-		Quality = {s : Gender => Number => Str} ; 
-		Kind = {s : Number => Str ; g : Gender} ; 
-		Item = {s : Str ; g : Gender ; n : Number} ; 
-
-   oper
-		--Create an adjective (full function)
-		--Params: Sing Masc, Sing Fem, Plural
-		adjective : (_,_,_ : Str) -> {s : Gender => Number => Str} = \iswed,sewda,suwed -> {
-			s = table {
-				Masc => table {
-					Sg => iswed ;
-					Pl => suwed
-				} ; 
-				Fem => table {
-					Sg => sewda ;
-					Pl => suwed
-				}
-			}
-		} ;
-
-		--Create a regular adjective
-		--Param: Sing Masc
-		regAdj : Str -> {s : Gender => Number => Str} = \frisk ->
-			adjective frisk (frisk + "a") (frisk + "i") ;
-
-		--Create a "uni-adjective" eg tal-buzz
-		--Param: Sing Masc
-		uniAdj : Str -> {s : Gender => Number => Str} = \uni ->
-			adjective uni uni uni ;
-			
-		--Create a noun
-		--Params: Singular, Plural, Gender (inherent)
-		noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = \ktieb,kotba,g -> {
-			s = table {
-				Sg => ktieb ;
-				Pl => kotba
-			} ;
-			g = g
-		} ;
-
-		--Copula is a linking verb
-		--Params: Number, Gender
-		copula : Number -> Gender -> Str = \n,g -> case n of {
-			Sg => case g of { Masc => "huwa" ; Fem => "hija" } ;
-			Pl => "huma"
-		} ;
-
-		--Create an article, taking into account first letter of next word
-		article = pre {
-			"a"|"e"|"i"|"o"|"u" => "l-" ;
-			--cons@("ċ"|"d"|"n"|"r"|"s"|"t"|"x"|"ż") => "i" + cons + "-" ;
-			_ => "il-"
-		} ;
-		
-		--Create a determinant
-		--Params: Sg/Pl, Masc, Fem
-		det : Number -> Str -> Str -> Kind -> {s : Str ; g : Gender ; n : Number} = \n,m,f,cn -> {
-			s = case n of {
-				Sg => case cn.g of {Masc => m ; Fem => f}; --string
-				Pl => m --default to masc
-			} ++ article ++ cn.s ! n ;
-			g = cn.g ; --gender
-			n = n --number
-		} ;
-
-   lin
-		Pred item quality = ss (item.s ++ copula item.n item.g ++ quality.s ! item.g ! item.n) ;
-		
-		This kind = det Sg "dan" "din" kind ;
-		That kind = det Sg "dak" "dik" kind ;
-		These kind = det Pl "dawn" "" kind ;
-		Those kind = det Pl "dawk" "" kind ;
-		
-		Mod quality kind = {
-			s = \\n => kind.s ! n ++ quality.s ! kind.g ! n ;
-			g = kind.g
-		} ;
-		
-		Wine = noun "inbid" "inbejjed" Masc ;
-		Cheese = noun "ġobon" "ġobniet" Masc ;
-		Fish = noun "ħuta" "ħut" Fem ;
-		Pizza = noun "pizza" "pizzez" Fem ;
-		
-		Very qual = {s = \\g,n => qual.s ! g ! n ++ "ħafna"} ;
-		
-		Warm = adjective "sħun" "sħuna" "sħan" ;
-		Expensive = adjective "għali" "għalja" "għaljin" ;
-		Delicious = adjective "tajjeb" "tajba" "tajbin" ;
-		Boring = uniAdj "tad-dwejjaq" ;
-		Fresh = regAdj "frisk" ;
-		Italian = regAdj "Taljan" ;
-}

contrib/summerschool/foods/FoodsMon.gf

@@ -1,49 +0,0 @@
---# -path=.:/GF/lib/src/prelude
-
--- (c) 2009 Nyamsuren Erdenebadrakh under LGPL
-
-concrete FoodsMon of Foods = open Prelude in {
-  flags coding=utf8;
-
-  lincat
-    Comment, Quality = SS ; 
-	Kind = {s : Number => Str} ; 
-    Item = {s : Str ; n : Number} ; 
-
-  lin
-	Pred item quality = ss (item.s ++ "бол" ++ quality.s) ;
-	This  = det Sg "энэ" ;
-	That  = det Sg "тэр" ;
-	These = det Pl "эдгээр" ;
-	Those = det Pl "тэдгээр" ;
-	Mod quality kind = {s = \\n => quality.s ++ kind.s ! n} ;
-	Wine = regNoun "дарс" ;
-	Cheese = regNoun "бяслаг" ;
-	Fish = regNoun "загас" ;
-	Pizza = regNoun "пицца" ;
-	Very = prefixSS "маш" ;
-	Fresh = ss "шинэ" ;
-	Warm = ss "халуун" ;
-	Italian = ss "итали" ;
-	Expensive = ss "үнэтэй" ;
-	Delicious = ss "амттай" ;
-	Boring = ss "амтгүй" ;
-
-  param
-    Number = Sg | Pl ;
-
-  oper
-	det : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = 
-	\n,d,cn -> {
-		s = d ++ cn.s ! n ;
-		n = n
-	} ;
-  	
-	regNoun : Str -> {s : Number => Str} = 
-	\x -> {s = table {
-		Sg => x ; 
-		Pl => x + "нууд"}
-		} ;
-	}
-	 
-    

contrib/summerschool/foods/FoodsPes.gf

@@ -1,65 +0,0 @@
-concrete FoodsPes of Foods = {
-
-      flags optimize=noexpand ; coding=utf8 ;
-	  
-      lincat
-        Comment = {s : Str} ;
-		Quality = {s : Add => Str; prep : Str} ;
-        Kind = {s : Add => Number => Str ; prep : Str};
-        Item = {s : Str ; n : Number};
-      lin
-        Pred item quality = {s = item.s ++ quality.s ! Indep ++ copula ! item.n} ;
-        This = det Sg "این" ;
-        That = det Sg "آن" ;
-        These = det Pl "این" ;
-        Those = det Pl "آن" ;
-        
-        Mod quality kind = {s = \\a,n =>  kind.s ! Attr ! n ++ kind.prep ++ quality.s ! a ;                                  
-                            prep = quality.prep             
-                            };
-        Wine = regN "شراب" ; 
-        Cheese = regN "پنیر" ;
-        Fish = regN "ماهى" ;
-        Pizza = regN "پیتزا" ;
-        Very a = {s = \\at => "خیلی" ++ a.s ! at ; prep = a.prep} ;
-        Fresh = adj "تازه" ;
-        Warm = adj "گرم" ;
-        Italian = adj "ایتالیایی" ;
-        Expensive = adj "گران" ;
-        Delicious = adj "لذىذ" ;
-        Boring = adj "ملال آور" ;  -- it must be written as ملال آور. 
-     
-     param
-        Number = Sg | Pl ;
-		Add = Indep | Attr ;
-     oper
-        det : Number -> Str -> {s: Add => Number => Str ; prep : Str} -> {s : Str ; n: Number} =
-           \n,det,noun -> {s = det ++ noun.s ! Indep ! n ; n = n };
-           
-        noun : (x1,_,_,x4 : Str) -> {s : Add => Number => Str ; prep : Str} = \pytzA, pytzAy, pytzAhA,pr -> 
-         {s = \\a,n => case <a,n> of
-		        {<Indep,Sg> => pytzA ; <Indep,Pl> => pytzAhA ;
-  				 <Attr,Sg>  =>pytzA ; <Attr,Pl>  => pytzAhA + "ى" };
-		 prep = pr
-		 };		 
-         
-        regN : Str -> {s: Add => Number => Str ; prep : Str} = \mrd -> 
-		case mrd of 
-		{ _ + ("ا"|"ه"|"ى"|"و"|"") => noun mrd (mrd+"ى") (mrd + "ها") "";
-		  _                        => noun mrd mrd (mrd + "ها") "e"
-		};
-        
-        adj : Str -> {s : Add => Str; prep : Str} = \tAzh -> 
-		case tAzh of 
-		{ _ + ("ا"|"ه"|"ى"|"و"|"") => mkAdj tAzh (tAzh ++ "ى") "" ;
-		  _                        => mkAdj tAzh tAzh "ه"
-        };
-		
-		mkAdj : Str -> Str -> Str -> {s : Add => Str; prep : Str} = \tAzh, tAzhy, pr  ->
-		{s = table {Indep => tAzh;
-		            Attr => tAzhy};
-		 prep = pr 			
-		};
-        copula : Number => Str = table {Sg => "است"; Pl => "هستند"};
-      
-}

contrib/summerschool/foods/FoodsPor.gf

@@ -1,77 +0,0 @@
--- (c) 2009 Rami Shashati under LGPL
-
-concrete FoodsPor of Foods = open Prelude in {
-	lincat
-	  Comment = {s : Str} ;
-	  Quality = {s : Gender => Number => Str} ;
-	  Kind = {s : Number => Str ; g : Gender} ;
-	  Item = {s : Str ; n : Number ; g : Gender } ;
-	
-	lin 
-	  Pred item quality =
-	    {s = item.s ++ copula ! item.n ++ quality.s ! item.g ! item.n } ;
-	  This = det Sg (table {Masc => "este" ; Fem => "esta"}) ;
-	  That = det Sg (table {Masc => "esse" ; Fem => "essa"}) ;
-	  These = det Pl (table {Masc => "estes" ; Fem => "estas"}) ; 
-	  Those = det Pl (table {Masc => "esses" ; Fem => "essas"}) ;
-	 
-	  Mod quality kind = { s = \\n => kind.s ! n ++ quality.s ! kind.g ! n ; g = kind.g } ;
-	  
-	  Wine = regNoun "vinho" Masc ;
-	  Cheese = regNoun "queijo" Masc ;
-	  Fish = regNoun "peixe" Masc ;
-	  Pizza = regNoun "pizza" Fem ;
-	  
-      Very a = { s = \\g,n => "muito" ++ a.s ! g ! n } ;
-      
-      Fresh = mkAdjReg "fresco" ;
-      Warm = mkAdjReg "quente" ;
-      Italian = mkAdjReg "Italiano" ;
-      Expensive = mkAdjReg "caro" ;
-      Delicious = mkAdjReg "delicioso" ;
-      Boring = mkAdjReg "chato" ;
-	
-	param
-	  Number = Sg | Pl ;
-	  Gender = Masc | Fem ;
-	
-	oper
-	  QualityT : Type = {s : Gender => Number => Str} ;
-	  
-	  mkAdj : (_,_,_,_ : Str) -> QualityT = \bonito,bonita,bonitos,bonitas -> {
-	  	s = table {
-	  		Masc => table { Sg => bonito ; Pl => bonitos } ;
-	  		Fem => table { Sg => bonita ; Pl => bonitas }
-	    } ;
-	  } ;
-	  
-	  -- regular pattern
-	  adjSozinho : Str -> QualityT = \sozinho ->
-        let sozinh = Predef.tk 1 sozinho
-        in mkAdj sozinho (sozinh + "a") (sozinh + "os") (sozinh + "as") ;
-
-      -- for gender-independent adjectives
-      adjUtil : Str -> Str -> QualityT = \util,uteis ->
-        mkAdj util util uteis uteis ;
-
-      -- smart paradigm for adjcetives
-      mkAdjReg : Str -> QualityT = \a -> case last a of {
-      	"o" => adjSozinho a ;
-        "e" => adjUtil a (a + "s")
-      } ;
-      
-      ItemT : Type = {s : Str ; n : Number ; g : Gender } ;
-      
-      det : Number -> (Gender => Str) -> KindT -> ItemT =
-        \num,det,noun -> {s = det ! noun.g ++ noun.s ! num ; n = num ; g = noun.g } ;
-	    
-	  KindT : Type = {s : Number => Str ; g : Gender} ;
-	    
-	  noun : Str -> Str -> Gender -> KindT =
-	    \animal,animais,gen -> {s = table {Sg => animal ; Pl => animais} ; g = gen } ;
-	    
-	  regNoun : Str -> Gender -> KindT =
-	    \carro,gen -> noun carro (carro + "s") gen ;
-	  
-	  copula : Number => Str = table {Sg => "é" ; Pl => "são"} ;
-}

contrib/summerschool/foods/FoodsRon.gf

@@ -1,72 +0,0 @@
--- (c) 2009 Ramona Enache under LGPL
-
-concrete FoodsRon of Foods = 
-{
-flags coding=utf8 ;
-
-param Number = Sg | Pl ;
-      Gender = Masc | Fem ;
-      NGender = NMasc | NFem | NNeut ;
-lincat 
-Comment = {s : Str};
-Quality = {s : Number => Gender => Str};
-Kind = {s : Number => Str; g : NGender};
-Item = {s : Str ; n : Number; g : Gender};
-
-lin
-
-This = det Sg (mkTab "acest" "această");
-That = det Sg (mkTab "acel" "acea");
-These = det Pl (mkTab "acești" "aceste");
-Those = det Pl (mkTab "acei" "acele");
-
-Wine = mkNoun "vin" "vinuri" NNeut ;
-Cheese = mkNoun "brânză" "brânzeturi" NFem ;
-Fish = mkNoun "peşte" "peşti" NMasc ;
-Pizza = mkNoun "pizza" "pizze" NFem;
-
-Very a = {s = \\n,g => "foarte" ++ a.s ! n ! g};
-
-Fresh = mkAdj "proaspăt" "proaspătă" "proaspeţi" "proaspete" ;
-Warm = mkAdj "cald" "caldă" "calzi" "calde" ;
-Italian = mkAdj "italian" "italiană" "italieni" "italiene" ;
-Expensive = mkAdj "scump" "scumpă" "scumpi" "scumpe" ;
-Delicious = mkAdj "delicios" "delcioasă" "delicioşi" "delicioase" ;
-Boring = mkAdj "plictisitor" "plictisitoare" "plictisitori" "plictisitoare" ;
-
-Pred item quality = {s = item.s ++ copula ! item.n ++ quality.s ! item.n ! item.g} ;
-
-Mod quality kind = {s = \\n => kind.s ! n ++ quality.s ! n ! (getAgrGender kind.g n) ; g = kind.g};
-
-oper 
-
-mkTab : Str -> Str -> {s : Gender => Str} = \acesta, aceasta ->
-{s = table{Masc => acesta;
-      Fem  => aceasta}};
-
-det : Number -> {s : Gender => Str} -> {s : Number => Str ; g : NGender} -> {s : Str; n : Number; g : Gender} =
-\n,det,noun -> let gg = getAgrGender noun.g n 
-  in
-   {s =  det.s ! gg  ++ noun.s ! n  ; n = n ; g = gg};
-
-mkNoun : Str -> Str -> NGender -> {s : Number => Str; g : NGender} = \peste, pesti,g ->
-{s = table {Sg => peste;
-            Pl => pesti};
- g = g
-};
-
-oper mkAdj : (x1,_,_,x4 : Str) -> {s : Number => Gender => Str} = \scump, scumpa, scumpi, scumpe ->
-{s = \\n,g => case <n,g> of
-{<Sg,Masc> => scump ; <Sg,Fem> => scumpa;
-<Pl,Masc> => scumpi ; <Pl,Fem> => scumpe
-}};
-
-copula : Number => Str = table {Sg => "este" ; Pl => "sunt"};
-
-getAgrGender : NGender -> Number -> Gender = \ng,n ->
-case <ng,n> of
-{<NMasc,_> => Masc ; <NFem,_> => Fem;
-<NNeut,Sg> => Masc ; <NNeut,Pl> => Fem
-};
-
-}

contrib/summerschool/foods/FoodsSwe.gf

@@ -1,7 +0,0 @@
---# -path=.:present
-
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsSwe of Foods = FoodsI with 
-  (Syntax = SyntaxSwe),
-  (LexFoods = LexFoodsSwe) ** {flags language = sv_SE;} ;

contrib/summerschool/foods/FoodsTsn.gf

@@ -1,178 +0,0 @@
---# -path=alltenses
-
--- (c) 2009 Laurette Pretorius Sr & Jr and Ansu Berg under LGPL
-
-concrete FoodsTsn of Foods = open Prelude, Predef in {
-	flags coding = utf8;
-	lincat
-		Comment = {s:Str};
-		Item = {s:Str; c:NounClass; n:Number};
-		Kind = {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool};
-		Quality = {s: NounClass => Number => Str; p_form: Str; t: TType};
-	lin	
-		Pred item quality = {s = item.s ++ ((mkPredDescrCop quality.t) ! item.c ! item.n) ++ quality.p_form};
-
-		This kind = {s = (kind.w ! Sg) ++ (mkDemPron1 ! kind.c ! Sg) ++ (kind.q ! Sg); c = kind.c; n = Sg};
-		That kind = {s = (kind.w ! Sg) ++ (mkDemPron2 ! kind.c ! Sg) ++ (kind.q ! Sg); c = kind.c; n = Sg};
-		These kind = {s = (kind.w ! Pl) ++ (mkDemPron1 ! kind.c ! Pl) ++ (kind.q ! Pl); c = kind.c; n = Pl};
-		Those kind = {s = (kind.w ! Pl) ++ (mkDemPron2 ! kind.c ! Pl) ++ (kind.q ! Pl); c = kind.c; n = Pl};	
-		
-		Mod quality kind = mkMod quality kind;
-
-	-- Lexicon
-		Wine = mkNounNC14_6 "jalwa";
-		Cheese = mkNounNC9_10 "kase";
-		Fish = mkNounNC9_10 "thlapi";
-		Pizza = mkNounNC9_10 "pizza";
-		Very quality = smartVery quality; 
-		Fresh = mkVarAdj "ntsha";
-		Warm = mkOrdAdj "bothitho";
-		Italian = mkPerAdj "Itali";
-		Expensive = mkVerbRel "tura"; 
-		Delicious = mkOrdAdj "monate";
-		Boring = mkOrdAdj "bosula";
-		
-	param
-		NounClass = NC9_10 | NC14_6;
-		Number = Sg | Pl;
-		TType = P | V | ModV | R ;				
-	oper
-		mkMod : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; 
-		b: Bool} = \x,y -> case y.b of
-		{
-			True => {w = y.w; r = y.r; c = y.c; 
-				q = table {
-				Sg => ((y.q ! Sg) ++ "le" ++ ((smartQualRelPart (x.t)) ! y.c ! Sg) ++ ((smartDescrCop (x.t)) ! 					y.c ! Sg) ++ (x.s ! y.c ! Sg)); 
-				Pl => ((y.q ! Pl) ++ "le" ++ ((smartQualRelPart (x.t))! y.c ! Pl) ++ ((smartDescrCop (x.t)) ! 					y.c ! Pl) ++(x.s ! y.c ! Pl))
-				  }; b = True
-				};
-			False => {w = y.w; r = y.r; c = y.c; 
-				q = table {
-				Sg => ((y.q ! Sg) ++ ((smartQualRelPart (x.t)) ! y.c ! Sg) ++ ((smartDescrCop (x.t)) ! y.c ! Sg) 					++ (x.s ! y.c ! Sg)); 
-				Pl => ((y.q ! Pl) ++ ((smartQualRelPart (x.t)) ! y.c ! Pl) ++ ((smartDescrCop (x.t)) ! y.c ! Pl) 					++(x.s ! y.c ! Pl))
-				  }; b = True
-				}
-		};
-
-		mkNounNC14_6 : Str -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} = \x -> {w = table {Sg => "bo" + x; Pl => "ma" + x}; r = x; c = NC14_6; 
-		q = table {Sg => ""; Pl => ""}; b = False};
-		
-		mkNounNC9_10 : Str -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} = \x -> {w = table {Sg => "" + x; Pl => "di" + x}; r = x; c = NC9_10; 
-		q = table {Sg => ""; Pl => ""}; b = False};
-
-		mkVarAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x -> 
-		{
-			s = table {
-				NC9_10 => table {Sg => "" + x; Pl => "di" + x};
-				NC14_6 => table {Sg => "bo" + x; Pl => "ma" + x}
-				};
-			p_form = x;
-			t = R;
-		};
-
-		mkOrdAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x -> 
-		{
-			s = table {
-				NC9_10 => table {Sg => "" + x; Pl => "" + x};
-				NC14_6 => table {Sg => "" + x; Pl => "" + x}
-				};
-			p_form = x;
-			t = R;
-		};
-
-		mkVerbRel : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x -> 
-		{
-			s = table {
-				NC9_10 => table {Sg => x + "ng"; Pl => x + "ng"};
-				NC14_6 => table {Sg => x + "ng"; Pl => x + "ng"}
-				};
-			p_form = x;
-			t = V;
-		};
-
-		mkPerAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x -> 
-		{
-			s = table {
-				NC9_10 => table {Sg => "" + x; Pl => "" + x};
-				NC14_6 => table {Sg => "" + x; Pl => "" + x}
-				};
-			p_form = "mo" ++ x;
-			t = P;
-		};
-
-		mkVeryAdj : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x ->
-		{
-			s = table{c => table{n => (x.s!c!n) ++ "thata"}}; p_form = x.p_form ++ "thata"; t = x.t
-		};
-
-		mkVeryVerb : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \x ->
-		{
-			s = table{c => table{n => (x.s!c!n) ++ "thata"}}; p_form = x.p_form ++ "thata"; t = ModV
-		};
-
-		smartVery : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = 
-\x -> case x.t of --(x.s!c!n)
-		{
-			(V | ModV)	=>	mkVeryVerb x;
-			--ModV	=>	mkVeryVerb x;
-			_	=>	mkVeryAdj x
-		};
-
-		mkDemPron1 : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "e"; Pl => "tse"};
-				NC14_6 => table {Sg => "bo"; Pl => "a"}
-			};
-		
-		mkDemPron2 : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "eo"; Pl => "tseo"};
-				NC14_6 => table {Sg => "boo"; Pl => "ao"}
-			};
-
-		smartQualRelPart : TType -> (NounClass => Number => Str) = \x -> case x of 
-		{
-			P	=> mkQualRelPart_PName;
-			_	=> mkQualRelPart
-		};
-
-		mkQualRelPart : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "e"; Pl => "tse"};
-				NC14_6 => table {Sg => "bo"; Pl => "a"}
-			};
-
-		mkQualRelPart_PName : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "ya"; Pl => "tsa"};
-				NC14_6 => table {Sg => "ba"; Pl => "a"}
-			};
-
-		smartDescrCop : TType -> (NounClass => Number => Str) = \x -> case x of
-		{
-			P	=> mkDescrCop_PName;
-			_	=> mkDescrCop
-		};
-
-		mkDescrCop : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "e"; Pl => "di"};
-				NC14_6 => table {Sg => "bo"; Pl => "a"}
-			};
-
-		mkDescrCop_PName : NounClass => Number => Str = table
-			{
-				NC9_10 => table {Sg => "ga"; Pl => "ga"};
-				NC14_6 => table {Sg => "ga"; Pl => "ga"}
-			};
-
-		mkPredDescrCop : TType -> (NounClass => Number => Str) = \x -> case x of
-			{
-				V => table 	{NC9_10 => table {Sg => "e" ++ "a"; Pl => "di" ++ "a"};
-						NC14_6 => table {Sg => "bo" ++ "a"; Pl => "a" ++ "a"}};
-
-				_ => table	{NC9_10 => table {Sg => "e"; Pl => "di"};
-						NC14_6 => table {Sg => "bo"; Pl => "a"}}
-			};
-
-}

contrib/summerschool/foods/FoodsTur.gf

@@ -1,140 +0,0 @@
-{-
-  File      : FoodsTur.gf
-  Author    : Server Çimen
-  Version   : 1.0
-  Created on: August 26, 2009
-
-  This file contains concrete grammar of Foods abstract grammar for Turkish Language.
-  This grammar is to be used for Fridge demo and developed in the scope of GF Resource
-  Grammar Summer School.
-
--}
-
-concrete FoodsTur of Foods = open Predef in {
-  flags
-    coding=utf8 ;
-  lincat
-    Comment = {s : Str} ;
-    Quality = {s : Str ; c : Case; softness : Softness; h : Harmony} ;
-    Kind = {s : Case => Number => Str} ;
-    Item = {s : Str; n : Number} ;
-  lin
-    This = det Sg "bu" ;
-    That = det Sg "şu" ;
-    These = det Pl "bu" ;
-    Those = det Pl "şu" ;
-    -- Reason for excluding plural form of copula: In Turkish if subject is not a human being,
-    -- then singular form of copula is used regardless of the number of subject. Since all
-    -- possible subjects are non human, copula do not need to have plural form.
-    Pred item quality = {s = item.s ++ quality.s ++ "&+" ++ copula ! quality.softness ! quality.h} ;--! item.n} ;
-    Mod quality kind = {s = case quality.c of {
-                              Nom => \\t,n => quality.s ++ kind.s ! t ! n ;
-                              Gen => \\t,n => quality.s ++ kind.s ! Gen ! n
-                            }
-                       } ;
-    Wine = mkN "şarap" "şaraplar" "şarabı" "şarapları" ;
-    Cheese = mkN "peynir" "peynirler" "peyniri" "peynirleri" ;
-    Fish = mkN "balık" "balıklar" "balığı" "balıkları" ;
-    Pizza = mkN "pizza" "pizzalar" "pizzası" "pizzaları" ;
-    Very a = {s = "çok" ++ a.s ; c = a.c; softness = a.softness; h = a.h} ;
-    Fresh = adj "taze" Nom;
-    Warm = adj "ılık" Nom;
-    Italian = adj "İtalyan" Gen ;
-    Expensive = adj "pahalı" Nom;
-    Delicious = adj "lezzetli" Nom;
-    Boring = adj "sıkıcı" Nom;
-  param
-    Number = Sg | Pl ;
-    Case = Nom | Gen ;
-    Harmony = I_Har | Ih_Har | U_Har | Uh_Har ; --Ih = İ; Uh = Ü
-    Softness = Soft | Hard ;
-  oper
-    det : Number -> Str -> {s : Case => Number => Str} -> {s : Str; n : Number} =
-      \num,det,noun -> {s = det ++ noun.s ! Nom ! num; n = num} ;
-    mkN = overload {
-      mkN : Str -> Str -> {s : Case => Number => Str} = regNoun ;
-      mkn : Str -> Str -> Str -> Str-> {s : Case => Number => Str} = noun ;
-    } ;
-    regNoun : Str -> Str -> {s : Case => Number => Str} =
-      \peynir,peynirler -> noun peynir peynirler [] [] ;
-    noun : Str -> Str -> Str -> Str-> {s : Case => Number => Str} = 
-      \sarap,saraplar,sarabi,saraplari -> {
-        s = table {
-	      Nom =>  table {
-			Sg => sarap ;
-			Pl => saraplar
-	              } ;
-              Gen =>  table {
-                        Sg => sarabi ;
-			Pl => saraplari
-	              }
-              }
-      };
-  {-
-    Since there is a bug in overloading, this overload is useless.
-
-    mkA = overload {
-      mkA : Str -> {s : Str; c : Case; softness : Softness; h : Harmony} = \base -> adj base Nom ;
-      mkA : Str -> Case -> {s : Str; c : Case; softness : Softness; h : Harmony} = adj ;
-    } ;
-  -}
-    adj : Str -> Case -> {s : Str; c : Case; softness : Softness; h : Harmony} =
-      \italyan,ca -> {s = italyan ; c = ca; softness = (getSoftness italyan); h = (getHarmony italyan)} ;
-    -- See the comment at lines 26 and 27 for excluded plural form of copula.
-    copula : Softness => Harmony {-=> Number-} => Str =
-      table {
-        Soft => table {
-                  I_Har => "dır" ;--table {
-			   -- Sg => "dır" ;
-			   -- Pl => "dırlar"
-		  --} ;
-		  Ih_Har => "dir" ;--table {
-			    --Sg => "dir" ;
-			    --Pl => "dirler"
-		  --} ;
-		  U_Har => "dur" ;--table {
-			   -- Sg => "dur" ;
-			   -- Pl => "durlar"
-		  --} ;
-		  Uh_Har => "dür" --table {
-			    --Sg => "dür" ;
-			    --Pl => "dürler"
-		  --}
-        } ;
-        Hard => table {
-                  I_Har => "tır" ;--table {
-			    --Sg => "tır" ;
-			    --Pl => "tırlar"
-		  --} ;
-		  Ih_Har => "tir" ;--table {
-			    --Sg => "tir" ;
-			    --Pl => "tirler"
-		  --} ;
-		  U_Har => "tur" ;--table {
-			   -- Sg => "tur" ;
-			   -- Pl => "turlar"
-		  --} ;
-		  Uh_Har => "tür"--table {
-			    --Sg => "tür" ;
-			    --Pl => "türler"
-		  --}
-        }
-      } ;
-
-    getHarmony : Str -> Harmony
-      = \base -> case base of {
-                 _+c@("ı"|"a"|"i"|"e"|"u"|"o"|"ü"|"ö")+
-                 ("b"|"v"|"d"|"z"|"j"|"c"|"g"|"ğ"|"l"|"r"|"m"|"n"|"y"|"p"|"f"|"t"|"s"|"ş"|"ç"|"k"|"h")* =>
-                    case c of {
-                      ("ı"|"a") => I_Har ;
-                      ("i"|"e") => Ih_Har ;
-                      ("u"|"o") => U_Har  ;
-                      ("ü"|"ö") => Uh_Har
-                    }
-        } ;
-    getSoftness : Str -> Softness
-      = \base -> case base of {
-		   _+("f"|"s"|"t"|"k"|"ç"|"ş"|"h"|"p") => Hard ;
-		   _ => Soft
-		 } ;
-}

contrib/summerschool/foods/FoodsUrd.gf

@@ -1,53 +0,0 @@
--- (c) 2009 Shafqat Virk under LGPL
-
-concrete FoodsUrd of Foods = {
-
-  flags coding=utf8 ;
-
-  
-	  param Number = Sg | Pl ;
-        param Gender = Masc | Fem;
-	  
-	 oper coupla : Number -> Str =\n -> case n of {Sg => "ہے" ; Pl => "ہیں"};
-	  
-	 	  
-      lincat
-        Comment = {s : Str} ; 
-	  Item = {s: Str ; n: Number ; g:Gender};
-	  Kind = {s: Number => Str ; g:Gender};
-        Quality = {s: Gender => Number => Str};
-  
-   lin
-    Pred item quality = {s = item.s ++ quality.s ! item.g ! item.n ++  coupla item.n} ;
-	This kind = {s = "یھ" ++ kind.s ! Sg; n= Sg ; g = kind.g } ;
-	These kind = {s = "یھ" ++ kind.s ! Pl; n = Pl ; g = kind.g} ;
-    That kind = {s = "وہ"  ++ kind.s ! Sg; n= Sg ; g = kind.g} ;
-	Those kind = {s = "وہ" ++ kind.s ! Pl; n=Pl ; g = kind.g} ;
-    Mod quality kind = {s = \\n => quality.s ! kind.g ! n  ++ kind.s ! n ;  g = kind.g};
-	Wine = {s = table { Sg => "شراب" ; Pl => "شرابیں"} ; g = Fem};
-    Cheese = {s = table { Sg => "پنیر" ; Pl => "پنیریں"} ; g = Fem};
-    Fish = {s = table { Sg => "مچھلی" ; Pl => "مچھلیاں"} ; g = Fem};
-    Pizza = {s = table { Sg => "پیزہ" ; Pl => "پیزے"} ; g = Masc};
-	Very quality = {s = \\g,n => "بہت" ++ quality.s ! g ! n} ;
-    Fresh = regAdj "تازہ" ;
-    Warm = regAdj "گرم" ;
-    Italian = regAdj "اٹا لوی" ;
-    Expensive = regAdj "مہنگا" ;
-    Delicious = regAdj "مزیدار" ;
-    Boring = regAdj "فضول" ;
-   
-   oper
-    regAdj : Str -> {s: Gender => Number => Str} = \a -> case a of {
-        x + "ا" => mkAdj a (x+"ے") (x+"ی");
-        _      => mkAdj a a a
-       };
-    mkAdj : Str -> Str -> Str -> {s: Gender => Number => Str} = \s,p,f -> {
-      s = table {
-           Masc => table {
-              Sg => s;
-              Pl => p
-              };
-           Fem => \\_ => f
-         }
-       };
-	}  

contrib/summerschool/foods/LexFoods.gf

@@ -1,15 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-interface LexFoods = open Syntax in {
-  oper
-    wine_N : N ;
-    pizza_N : N ;
-    cheese_N : N ;
-    fish_N : N ;
-    fresh_A : A ;
-    warm_A : A ;
-    italian_A : A ;
-    expensive_A : A ;
-    delicious_A : A ;
-    boring_A : A ;
-}

contrib/summerschool/foods/LexFoodsCat.gf

@@ -1,18 +0,0 @@
--- (c) 2009 Jordi Saludes under LGPL
-
-instance LexFoodsCat of LexFoods = 
-    open SyntaxCat, ParadigmsCat, (M = MorphoCat) in {
-  flags
-	coding = utf8 ;
-  oper
-    wine_N = mkN "vi" "vins" M.Masc ;
-    pizza_N = mkN "pizza" ;
-    cheese_N = mkN "formatge" ;
-    fish_N = mkN "peix" "peixos" M.Masc;
-    fresh_A = mkA "fresc" "fresca" "frescos" "fresques" "frescament";
-    warm_A = mkA "calent" ;
-    italian_A = mkA "italià" "italiana" "italians" "italianes" "italianament" ;
-    expensive_A = mkA "car" ;
-    delicious_A = mkA "deliciós" "deliciosa" "deliciosos" "delicioses" "deliciosament";
-    boring_A = mkA "aburrit" "aburrida" "aburrits" "aburrides" "aburridament" ;
-}

contrib/summerschool/foods/LexFoodsFin.gf

@@ -1,20 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-instance LexFoodsFin of LexFoods = 
-    open SyntaxFin, ParadigmsFin in {
-  oper
-    wine_N = mkN "viini" ;
-    pizza_N = mkN "pizza" ;
-    cheese_N = mkN "juusto" ;
-    fish_N = mkN "kala" ;
-    fresh_A = mkA "tuore" ;
-    warm_A = mkA 
-    (mkN "lämmin" "lämpimän" "lämmintä" "lämpimänä" "lämpimään" 
-         "lämpiminä" "lämpimiä" "lämpimien" "lämpimissä" "lämpimiin"
-	 ) 
-    "lämpimämpi" "lämpimin" ;
-    italian_A = mkA "italialainen" ;
-    expensive_A = mkA "kallis" ;
-    delicious_A = mkA "herkullinen" ;
-    boring_A = mkA "tylsä" ;
-}

contrib/summerschool/foods/LexFoodsGer.gf

@@ -1,16 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-instance LexFoodsGer of LexFoods = 
-    open SyntaxGer, ParadigmsGer in {
-  oper
-    wine_N = mkN "Wein" ;
-    pizza_N = mkN "Pizza" "Pizzen" feminine ;
-    cheese_N = mkN "Käse" "Käse" masculine ;
-    fish_N = mkN "Fisch" ;
-    fresh_A = mkA "frisch" ;
-    warm_A = mkA "warm" "wärmer" "wärmste" ;
-    italian_A = mkA "italienisch" ;
-    expensive_A = mkA "teuer" ;
-    delicious_A = mkA "köstlich" ;
-    boring_A = mkA "langweilig" ;
-}

contrib/summerschool/foods/LexFoodsIta.gf

@@ -1,16 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-instance LexFoodsIta of LexFoods = 
-    open SyntaxIta, ParadigmsIta in {
-  oper
-    wine_N = mkN "vino" ;
-    pizza_N = mkN "pizza" ;
-    cheese_N = mkN "formaggio" ;
-    fish_N = mkN "pesce" ;
-    fresh_A = mkA "fresco" ;
-    warm_A = mkA "caldo" ;
-    italian_A = mkA "italiano" ;
-    expensive_A = mkA "caro" ;
-    delicious_A = mkA "delizioso" ;
-    boring_A = mkA "noioso" ;
-}

contrib/summerschool/foods/LexFoodsSwe.gf

@@ -1,16 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-instance LexFoodsSwe of LexFoods = 
-    open SyntaxSwe, ParadigmsSwe in {
-  oper
-    wine_N = mkN "vin" "vinet" "viner" "vinerna" ;
-    pizza_N = mkN "pizza" ;
-    cheese_N = mkN "ost" ;
-    fish_N = mkN "fisk" ;
-    fresh_A = mkA "färsk" ;
-    warm_A = mkA "varm" ;
-    italian_A = mkA "italiensk" ;
-    expensive_A = mkA "dyr" ;
-    delicious_A = mkA "läcker" ;
-    boring_A = mkA "tråkig" ;
-}

contrib/summerschool/foods/Makefile

@@ -1,8 +0,0 @@
-
-all:: Foods.pgf
-
-Foods.pgf: Foods???.gf
-	gf -make -s -optimize-pgf Foods???.gf
-
-clean:
-	rm -rf *.gfo Foods.pgf

contrib/summerschool/foods/README

@@ -1,8 +0,0 @@
-Foods grammars from GF Summer School 2009. To build:
-
-  $ gf -make -s Foods???.gf                        -- to create Foods.pgf
-
-  $ mv Foods.pgf ~/GF/src/server/gwt/www/grammars/ -- to use in web applications
-
-
-

contrib/summerschool/foods/transFoodsHin.gf

@@ -1,75 +0,0 @@
--- (c) 2009 Aarne Ranta under LGPL
-
-concrete FoodsHin of Foods = {
-
-  flags coding=utf8 ;
-
-  param
-    Gender = Masc | Fem ;
-    Number = Sg | Pl ;
-  lincat
-    Comment = {s : Str} ;
-    Item    = {s : Str ; g : Gender ; n : Number} ;
-    Kind    = {s : Number => Str ; g : Gender} ;
-    Quality = {s : Gender => Number => Str} ;
-  lin
-    Pred item quality = {
-      s = item.s ++ quality.s ! item.g ! item.n ++ copula item.n
-      } ;
-    This kind = {s = "yah" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;
-    That kind = {s = "vah" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;
-    These kind = {s = "ye" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;
-    Those kind = {s = "ve" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;
-    Mod quality kind = {
-      s = \\n => quality.s ! kind.g ! n ++ kind.s ! n ; 
-      g = kind.g
-      } ;
-    Wine = regN "madirA" ;
-    Cheese = regN "panIr" ;
-    Fish = regN "maClI" ;
-    Pizza = regN "pijjA" ;
-    Very quality = {s = \\g,n => "bahut" ++ quality.s ! g ! n} ;
-    Fresh = regAdj "tAzA" ;
-    Warm = regAdj "garam" ;
-    Italian = regAdj "i-t.alI" ; 
-    Expensive = regAdj "mahaNgA" ;
-    Delicious = regAdj "rucikar" ;
-    Boring = regAdj "pEriyA" ;
-
-  oper
-    mkN : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = 
-      \s,p,g -> {
-        s = table {
-          Sg => s ;
-          Pl => p
-          } ;
-        g = g
-      } ;
-
-    regN : Str -> {s : Number => Str ; g : Gender} = \s -> case s of {
-      lark + "A" => mkN s (lark + "e") Masc ;
-      lark + "I" => mkN s (lark + "iyaM") Fem ;
-      _           => mkN s s Masc 
-      } ;
-
-    mkAdj : Str -> Str -> Str -> {s : Gender => Number => Str} = \ms,mp,f -> {
-      s = table {
-        Masc => table {
-          Sg => ms ;
-          Pl => mp
-          } ;
-        Fem  => \\_ => f
-        }
-      } ;
-
-    regAdj : Str -> {s : Gender => Number => Str} = \a -> case a of {
-      acch + "A" => mkAdj a (acch + "e") (acch + "I") ;
-      _          => mkAdj a a a
-      } ;
-
-    copula : Number -> Str = \n -> case n of {
-      Sg => "hE" ;
-      Pl => "hEN"
-      } ;
-
-  }

contrib/summerschool/mini/Grammar.gf

@@ -1,36 +0,0 @@
-abstract Grammar = {
-
-  flags startcat = S ;
-
-  cat 
-    S ; Cl ; NP ; VP ; AP ; CN ; 
-    Det ; N ; A ; V ; V2 ; AdA ; 
-    Tense ; Pol ;
-    Conj ;
-  fun
-    UseCl   : Tense -> Pol -> Cl -> S ;
-    PredVP  : NP -> VP -> Cl ;
-    ComplV2 : V2 -> NP -> VP ;
-    DetCN   : Det -> CN -> NP ;
-    ModCN   : AP -> CN -> CN ;
-
-    CompAP  : AP -> VP ;
-    AdAP    : AdA -> AP -> AP ;
-
-    ConjNP  : Conj -> NP -> NP -> NP ;
-
-    UseV    : V -> VP ;
-    UseN    : N -> CN ;
-    UseA    : A -> AP ;
-
-    a_Det, the_Det : Det ;
-    this_Det, these_Det : Det ;
-    that_Det, those_Det : Det ;
-    i_NP, she_NP, we_NP : NP ;
-    very_AdA : AdA ;
-
-    Pos, Neg : Pol ;
-    Pres, Perf : Tense ;
-
-    and_Conj, or_Conj : Conj ;
-}

contrib/summerschool/mini/GrammarIta.gf

@@ -1,137 +0,0 @@
-concrete GrammarIta of Grammar = open ResIta, Prelude in {
-  lincat  
-    S  = {s : Str} ;
-    Cl = {s : ResIta.Tense => Bool => Str} ; 
-    NP = ResIta.NP ;  
-      -- {s : Case => {clit,obj : Str ; isClit : Bool} ; a : Agr} ; 
-    VP = ResIta.VP ;  
-      -- {v : Verb ; clit : Str ; clitAgr : ClitAgr ; obj : Agr => Str} ;
-    AP = {s : Gender => Number => Str ; isPre : Bool} ;
-    CN = Noun ;           -- {s : Number => Str ; g : Gender} ;
-    Det = {s : Gender => Case => Str ; n : Number} ;
-    N = Noun ;            -- {s : Number => Str ; g : Gender} ;
-    A = Adj ;             -- {s : Gender => Number => Str ; isPre : Bool} ;
-    V = Verb ;            -- {s : VForm => Str ; aux : Aux} ;
-    V2 = Verb ** {c : Case} ;
-    AdA = {s : Str} ;
-    Pol = {s : Str ; b : Bool} ;
-    Tense = {s : Str ; t : ResIta.Tense} ;
-    Conj = {s : Str ; n : Number} ;
-  lin
-    UseCl t p cl = {s = t.s ++ p.s ++ cl.s ! t.t ! p.b} ; 
-    PredVP np vp = 
-      let 
-        subj = (np.s ! Nom).obj ;
-        obj  = vp.obj ! np.a ;
-        clit = vp.clit ;
-        verb = table {
-          Pres => agrV vp.v np.a ;
-          Perf => agrV (auxVerb vp.v.aux) np.a ++ agrPart vp.v np.a vp.clitAgr
-          }
-      in {
-        s = \\t,b => subj ++ neg b ++ clit ++ verb ! t ++ obj
-      } ;
-
-    ComplV2 v2 np = 
-      let
-        nps = np.s ! v2.c
-      in {
-        v = {s = v2.s ; aux = v2.aux} ; 
-        clit = nps.clit ; 
-        clitAgr = case <nps.isClit,v2.c> of {
-          <True,Acc> => CAgr np.a ;
-          _ => CAgrNo
-          } ;
-        obj  = \\_ => nps.obj
-        } ;
-
-    UseV v = {
-      v = v ; 
-      clit = [] ; 
-      clitAgr = CAgrNo ;
-      obj = \\_ => []
-      } ;
-
-    DetCN det cn = {
-      s = \\c => {
-        obj = det.s ! cn.g ! c ++ cn.s ! det.n ; 
-        clit = [] ; 
-        isClit = False
-        } ;
-      a = Ag cn.g det.n Per3
-      } ;
-
-    ModCN ap cn = {
-      s = \\n => preOrPost ap.isPre (ap.s ! cn.g ! n) (cn.s ! n) ;
-      g = cn.g
-      } ;
-
-    CompAP ap = {
-      v = essere_V ; 
-      clit = [] ; 
-      clitAgr = CAgrNo ;
-      obj = \\ag => case ag of {
-        Ag g n _ => ap.s ! g ! n
-        }
-      } ;
-
-    AdAP ada ap = {
-      s = \\g,n => ada.s ++ ap.s ! g ! n ;
-      isPre = ap.isPre ;
-      } ;
-
-    ConjNP co nx ny = {
-      s = \\c => {
-        obj = (nx.s ! c).obj ++ co.s ++ (ny.s ! c).obj ; 
-        clit = [] ; 
-        isClit = False
-        } ;
-      a = ny.a ; ---- should be conjAgr co.n nx.a ny.a
-      } ;
-
-    UseN n = n ;
-
-    UseA adj = adj ;
-
-    a_Det = adjDet (mkAdj "un" "una" [] [] True) Sg ;
-
-    the_Det = {
-      s = table {
-        Masc => table {
-          Nom | Acc => elisForms "lo" "l'" "il" ;
-          Dat => elisForms "allo" "all'" "al"
-          } ;
-        Fem => table {
-          Nom | Acc => elisForms "la" "'l" "la" ;
-          Dat => elisForms "alla" "all'" "alla"
-          }
-        } ;
-      n = Sg
-      } ;
-        
-    this_Det = adjDet (regAdj "questo") Sg ;
-    these_Det = adjDet (regAdj "questo") Pl ;
-    that_Det = adjDet quello_A Sg ;
-    those_Det = adjDet quello_A Pl ;
-
-    i_NP =   pronNP "io"  "mi" "mi" Masc Sg Per1 ;
-    she_NP = pronNP "lei" "la" "le" Fem  Sg Per3 ;
-    we_NP =  pronNP "noi" "ci" "ci" Masc Pl Per1 ;
-
-    very_AdA = ss "molto" ;
-
-    Pos  = {s = [] ; b = True} ;
-    Neg  = {s = [] ; b = False} ;
-    Pres = {s = [] ; t = ResIta.Pres} ;
-    Perf = {s = [] ; t = ResIta.Perf} ;
-
-    and_Conj = {s = "e" ; n = Pl} ;
-    or_Conj  = {s = "o" ; n = Sg} ;
-
-  oper
-    quello_A : Adj = mkAdj 
-      (elisForms "quello" "quell'" "quel") "quella"
-      (elisForms "quegli" "quegli" "quei") "quelle"
-      True ;
-
-}

contrib/summerschool/mini/ParadigmsIta.gf

@@ -1,47 +0,0 @@
-resource ParadigmsIta = GrammarIta [N,A,V] ** 
-  open ResIta, GrammarIta, Prelude in {
-
-oper
-  masculine : Gender = Masc ;
-  feminine : Gender = Fem ;
-
-  accusative : Case = Acc ;
-  dative : Case = Dat ;
-
-  mkN = overload {
-    mkN : (vino : Str) -> N 
-      = \n -> lin N (regNoun n) ;
-    mkN : (uomo, uomini : Str) -> Gender -> N 
-      = \s,p,g -> lin N (mkNoun s p g) ;
-    } ;
-
-  mkA = overload {
-    mkA : (nero : Str) -> A 
-      = \a -> lin A (regAdj a) ;
-    mkA : (buono,buona,buoni,buone : Str) -> Bool -> A 
-      = \sm,sf,pm,pf,p -> lin A (mkAdj sm sf pm pf False) ;
-    } ;
-
-  preA : A -> A
-      = \a -> lin A {s = a.s ; isPre = True} ;
-
-  mkV = overload {
-    mkV : (finire : Str) -> V 
-      = \v -> lin V (regVerb v) ;
-    mkV : (andare,vado,vadi,va,andiamo,andate,vanno,andato : Str) -> V 
-      = \i,p1,p2,p3,p4,p5,p6,p -> lin V (mkVerb i p1 p2 p3 p4 p5 p6 p Avere) ;
-    } ;
-
-  essereV : V -> V
-    = \v -> lin V {s = v.s ; aux = Essere} ;
-
-  mkV2 = overload {
-    mkV2 : Str -> V2
-      = \s -> lin V2 (regVerb s ** {c = accusative}) ;
-    mkV2 : V -> V2
-      = \v -> lin V2 (v ** {c = accusative}) ;
-    mkV2 : V -> Case -> V2
-      = \v,c -> lin V2 (v ** {c = c}) ;
-    } ;
-
-}

contrib/summerschool/mini/ResIta.gf

@@ -1,178 +0,0 @@
-resource ResIta = open Prelude in {
-
--- parameters
-
-param
-  Number = Sg | Pl ;
-  Gender = Masc | Fem ;
-  Case   = Nom | Acc | Dat ;
-  Agr    = Ag Gender Number Person ;
-  Aux    = Avere | Essere ;
-  Tense  = Pres | Perf ;
-  Person = Per1 | Per2 | Per3 ;
-
-  VForm = VInf | VPres Number Person | VPart Gender Number ;
-
-  ClitAgr = CAgrNo | CAgr Agr ;
-
--- parts of speech
-
-oper
-  VP = {
-    v : Verb ; 
-    clit : Str ; 
-    clitAgr : ClitAgr ; 
-    obj : Agr => Str
-    } ;
-  NP = {
-    s : Case => {clit,obj : Str ; isClit : Bool} ; 
-    a : Agr
-    } ; 
-
--- the preposition word of an abstract case
-
-  prepCase : Case -> Str = \c -> case c of {
-    Dat => "a" ;
-    _ => []
-    } ;
-
--- for predication
-
-  agrV : Verb -> Agr -> Str = \v,a -> case a of {
-    Ag _ n p => v.s ! VPres n p
-    } ;
-
-  auxVerb : Aux -> Verb = \a -> case a of {
-    Avere => 
-      mkVerb "avere" "ho" "hai" "ha" "abbiamo" "avete" "hanno" "avuto" Avere ;
-    Essere => 
-      mkVerb "essere" "sono" "sei" "è" "siamo" "siete" "sono" "stato" Essere
-    } ;
-
-  agrPart : Verb -> Agr -> ClitAgr -> Str = \v,a,c -> case v.aux of {
-    Avere  => case c of {
-      CAgr (Ag g n _) => v.s ! VPart g n ;
-      _ => v.s ! VPart Masc Sg
-      } ;
-    Essere => case a of {
-      Ag g n _ => v.s ! VPart g n
-      }
-    } ;
-
-  neg : Bool -> Str = \b -> case b of {True => [] ; False => "non"} ;
-
-  essere_V = auxVerb Essere ;
-
--- for coordination
-
-  conjAgr : Number -> Agr -> Agr -> Agr = \n,xa,ya -> 
-    let 
-      x = agrFeatures xa ; y = agrFeatures ya
-    in Ag 
-      (conjGender x.g y.g) 
-      (conjNumber (conjNumber x.n y.n) n)
-      (conjPerson x.p y.p) ;
-
-  agrFeatures : Agr -> {g : Gender ; n : Number ; p : Person} = \a -> 
-    case a of {Ag g n p => {g = g ; n = n ; p = p}} ;
-
-  conjGender : Gender -> Gender -> Gender = \g,h ->
-    case g of {Masc => Masc ; _ => h} ;
-
-  conjNumber : Number -> Number -> Number = \m,n ->
-    case m of {Pl => Pl ; _ => n} ;
-
-  conjPerson : Person -> Person -> Person = \p,q ->
-    case <p,q> of {
-      <Per1,_> | <_,Per1> => Per1 ;
-      <Per2,_> | <_,Per2> => Per2 ;
-      _                   => Per3
-      } ;
-
-
-
--- for morphology
-
-  Noun : Type = {s : Number => Str ; g : Gender} ;
-  Adj  : Type = {s : Gender => Number => Str ; isPre : Bool} ;
-  Verb : Type = {s : VForm => Str ; aux : Aux} ;
-
-  mkNoun : Str -> Str -> Gender -> Noun = \vino,vini,g -> {
-    s = table {Sg => vino ; Pl => vini} ;
-    g = g
-    } ;
-
-  regNoun : Str -> Noun = \vino -> case vino of {
-    fuo + c@("c"|"g") + "o" => mkNoun vino (fuo + c + "hi") Masc ;
-    ol  + "io" => mkNoun vino (ol + "i") Masc ;
-    vin + "o" => mkNoun vino (vin + "i") Masc ;
-    cas + "a" => mkNoun vino (cas + "e") Fem ;
-    pan + "e" => mkNoun vino (pan + "i") Masc ;
-    _ => mkNoun vino vino Masc 
-    } ;
-
-  mkAdj : (_,_,_,_ : Str) -> Bool -> Adj = \buono,buona,buoni,buone,p -> {
-    s = table {
-          Masc => table {Sg => buono ; Pl => buoni} ;
-          Fem  => table {Sg => buona ; Pl => buone}
-        } ;
-    isPre = p
-    } ;
-
-  regAdj : Str -> Adj = \nero -> case nero of {
-    ner + "o"  => mkAdj nero (ner + "a") (ner + "i") (ner + "e") False ;
-    verd + "e" => mkAdj nero nero (verd + "i") (verd + "i") False ;
-    _ => mkAdj nero nero nero nero False
-    } ;
-
-  mkVerb : (_,_,_,_,_,_,_,_ : Str) -> Aux -> Verb = 
-    \amare,amo,ami,ama,amiamo,amate,amano,amato,aux -> {
-    s = table {
-          VInf          => amare ;
-          VPres Sg Per1 => amo ;
-          VPres Sg Per2 => ami ;
-          VPres Sg Per3 => ama ;
-          VPres Pl Per1 => amiamo ;
-          VPres Pl Per2 => amate ;
-          VPres Pl Per3 => amano ;
-          VPart g n     => (regAdj amato).s ! g ! n
-          } ;
-    aux = aux
-    } ;
-
-  regVerb : Str -> Verb = \amare -> case amare of {
-    am  + "are" => mkVerb amare (am+"o") (am+"i") (am+"a") 
-                     (am+"iamo") (am+"ate") (am+"ano") (am+"ato") Avere ;
-    tem + "ere" => mkVerb amare (tem+"o") (tem+"i") (tem+"e") 
-                     (tem+"iamo") (tem+"ete") (tem+"ono") (tem+"uto") Avere ;
-    fin + "ire" => mkVerb amare (fin+"isco") (fin+"isci") (fin+"isce") 
-                     (fin+"iamo") (fin+"ite") (fin+"iscono") (fin+"ito") Avere
-    } ; 
-
--- for structural words
-
-  adjDet : Adj -> Number -> {s : Gender => Case => Str ; n : Number} = 
-  \adj,n -> {
-    s = \\g,c => prepCase c ++ adj.s ! g ! n ;
-    n = n
-    } ;
-
-  pronNP : (s,a,d : Str) -> Gender -> Number -> Person -> NP = 
-  \s,a,d,g,n,p -> {
-    s = table {
-      Nom => {clit = [] ; obj = s  ; isClit = False} ;
-      Acc => {clit = a  ; obj = [] ; isClit = True} ;
-      Dat => {clit = d  ; obj = [] ; isClit = True}
-      } ;
-    a = Ag g n p
-    } ;
-
--- phonological auxiliaries
-
-  vowel    : pattern Str = #("a" | "e" | "i" | "o" | "u" | "h") ;
-  s_impuro : pattern Str = #("z" | "s" + ("b"|"c"|"d"|"f"|"m"|"p"|"q"|"t")) ;
-
-  elisForms : (_,_,_ : Str) -> Str = \lo,l',il ->
-    pre {#s_impuro => lo ; #vowel => l' ; _ => il} ;
-
-}

contrib/summerschool/mini/Syntax.gf

@@ -1,45 +0,0 @@
-interface Syntax = Grammar - 
-    [UseCl,PredVP,ComplV2,UseV,DetCN,ModCN,CompAP,AdAP,
-     UseN,UseA,Pres,Perf,Pos,Neg] **
-  open Grammar in {
-
-oper
-  mkS = overload {
-    mkS : Cl -> S = UseCl Pres Pos ;
-    mkS : Tense -> Cl -> S = \t -> UseCl t Pos ;
-    mkS : Pol -> Cl -> S = UseCl Pres ;
-    mkS : Tense -> Pol -> Cl -> S = UseCl ;
-    } ;
-
-  mkCl = overload {
-    mkCl : NP -> V  -> Cl = \np,v -> PredVP np (UseV v) ;
-    mkCl : NP -> V2 -> NP -> Cl = \np,v,o -> PredVP np (ComplV2 v o) ;
-    mkCl : NP -> A  -> Cl = \np,a -> PredVP np (CompAP (UseA a)) ;
-    mkCl : NP -> AP -> Cl = \np,ap -> PredVP np (CompAP ap) ;
-    mkCl : NP -> VP -> Cl = PredVP ;
-    } ;
-
-  mkAP = overload {
-    mkAP : A -> AP = UseA ;
-    mkAP : AdA -> AP -> AP = AdAP ;
-    } ;
-
-  mkNP = overload {
-    mkNP : Det -> N -> NP = \d,n -> DetCN d (UseN n) ;
-    mkNP : Det -> CN -> NP = \d,n -> DetCN d n ;
-    } ;
-
-  mkCN = overload {
-    mkCN : N  -> CN = UseN ;
-    mkCN : A  -> N  -> CN = \a,n -> ModCN (UseA a) (UseN n) ; 
-    mkCN : A  -> CN -> CN = \a,n -> ModCN (UseA a) n ; 
-    mkCN : AP -> N  -> CN = \a,n -> ModCN a (UseN n) ; 
-    mkCN : AP -> CN -> CN = \a,n -> ModCN a n ; 
-    } ;
-
-  presTense : Tense = Pres ;
-  perfTense : Tense = Perf ;
-  posPol : Pol = Pos ;
-  negPol : Pol = Neg ;
-
-}

contrib/summerschool/mini/SyntaxIta.gf

@@ -1,3 +0,0 @@
-instance SyntaxIta of Syntax = GrammarIta - 
-    [PredVP,ComplV2,UseV,DetCN,ModCN,CompAP,AdAP,UseN,UseA] **
-  open GrammarIta in {} ;

contrib/summerschool/mini/Test.gf

@@ -1,9 +0,0 @@
-abstract Test = Grammar ** {
-
-fun
-  man_N, woman_N, house_N, tree_N : N ;
-  big_A, small_A, green_A : A ;
-  walk_V, arrive_V : V ;
-  love_V2, please_V2 : V2 ;
-
-} ;

contrib/summerschool/mini/TestIta.gf

@@ -1,17 +0,0 @@
-concrete TestIta of Test = GrammarIta ** open ParadigmsIta in {
-
-lin
-  man_N = mkN "uomo" "uomini" masculine ;
-  woman_N = mkN "donna" ;
-  house_N = mkN "casa" ;
-  tree_N = mkN "albero" ;
-  big_A = preA (mkA "grande") ;
-  small_A = preA (mkA "piccolo") ;
-  green_A = mkA "verde" ;
-  walk_V = mkV "camminare" ;
-  arrive_V = essereV (mkV "arrivare") ;
-  love_V2 = mkV2 "amare" ;
-  please_V2 = mkV2 (essereV (mkV "piacere" "piaccio" "piaci" "piace" 
-                        "piacciamo" "piacete" "piacciono" "piaciuto")) dative ;
-
-} ;

css/newstyle.css

@@ -0,0 +1,65 @@
+@import url(style.css);
+
+body.new { margin: 0 8px; }
+
+div.header { text-align: center; }
+
+div.sky {
+    margin: 0 -8px;
+    background-image: -webkit-linear-gradient(top, #a8d8ff, #f6f6f6 70%);
+    background-image: -moz-linear-gradient(top, #a8d8ff, #f6f6f6 70%);
+}
+
+div.header h1 {
+     margin: 0;
+     font-family: verdana, arial, sans-serif;
+     font-weight: normal; font-size: 200%;
+     /*text-decoration: underline;*/
+   }
+
+.tagline { font-family: sans-serif; }
+
+h2.noclear { clear: none; }
+
+
+div.red h1 {
+     color: #e80000;
+     text-shadow: rgba(232,0,0,0.25) 2px 2px 5px;
+}
+div.red .tagline { color: #e00000; }
+
+div.blue h1, div.blue .tagline { color: #06c; }
+
+div.links {
+    display: inline-block;
+    vertical-align: top;
+    margin-right: 1em;
+}
+
+.links h4 { margin: 0; }
+
+.links ul {
+    margin-top: 1ex;
+    margin-left: 2ex;
+    padding-left: 1ex;
+    font-family: sans-serif;
+}
+
+.links li { margin-top: 0.5ex; margin-bottom: 0.5ex; }
+
+div.menu {
+    font-size: 80%;
+    display: table;
+    margin-top: 3ex;
+    margin-right: auto;
+    margin-left: auto;
+    /*float: right;*/
+    /*border-radius: 5px;
+    margin-top: 1ex;
+    background: inherit;
+    border: 2px solid black;
+    padding-left: 0.3em;
+    box-shadow: 0px 0px 15px rgba(0,0,0,0.5);*/
+}
+
+.gflogo { width: 240px; }

css/notes.css

@@ -0,0 +1,4 @@
+@import url(style.css);
+
+body { color: #333; }
+li>code, p>code, pre { color: #730; }

css/style.css

@@ -1,20 +1,20 @@
-
-body { background-color: #f2f2f2; }
-
-
-h1,h2,h3 { font-family: sans-serif; }
-h1 { text-align: center; }
-h2 { border-bottom: 2px solid black; clear: right; }
-
-div.center { text-align: center; }
-div.news { font-size: small; }
+@import url(style0.css);
 
 table { border-collapse: collapse; }
 
+table.news td {
+    background: inherit;
+    border: 0;
+    vertical-align: baseline;
+    padding: 0.25ex 0.5ex;
+}
+
+table.news td:nth-child(1) {
+    /* Don't want the hyphens in dates (2012-06-29) to cause line breaks */
+    white-space: nowrap;
+}
 
 th,td { border: 1px solid #333; }
 
 td { background: white; }
 th { background: #9df; }
-
-h1>img { float: right; }

css/style0.css

@@ -0,0 +1,45 @@
+
+body { background-color: #f6f6f6; }
+
+
+h1,h2,h3,h4 { font-family: sans-serif; color: #303030;
+	      text-shadow: rgba(0,0,0,0.25) 2px 2px 5px;
+	    }
+h1 { text-align: center; }
+h2 { border-bottom: 2px solid #303030; clear: right; }
+
+div.mainlinks { font-size: 140%; }
+div.center { text-align: center; }
+div.news { font-size: small; }
+
+h1 img { float: right; border: 0; }
+h1 img.nofloat { float: none; }
+img.right { float: right; }
+
+ol.languages {
+    column-width: 12em;
+}
+
+.grow {
+  max-width: 75%;
+  animation-name: grow;
+  animation-duration: 2s;
+  animation-timing-function: ease-in-out;
+
+  -webkit-animation-name: grow;
+  -webkit-animation-duration: 2s;
+  -webkit-animation-timing-function: ease-in-out;
+
+}
+
+@keyframes grow {
+  from,50% { opacity: 0; transform: scale(0.1,0.1); }
+  80% { opacity: 1; transform: scale(1.1,1.1); }
+  to { transform: scale(1.0,1.0); }
+}
+
+@-webkit-keyframes grow {
+  from,50% { opacity: 0; -webkit-transform: scale(0.1,0.1); }
+  80% { opacity: 1; -webkit-transform: scale(1.1,1.1); }
+  to { -webkit-transform: scale(1.0,1.0); }
+}

debian/changelog

@@ -1,5 +1,83 @@
+gf (3.10.3-1) xenial bionic cosmic; urgency=low
+
+  * GF 3.10.3
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Fri,  5 Mar 2019 19:30:00 +0100
+
+gf (3.10-2) xenial bionic cosmic; urgency=low
+
+  * GF 3.10
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Fri,  5 Mar 2019 16:00:00 +0100
+
+gf (3.10-1) xenial bionic cosmic; urgency=low
+
+  * GF 3.10
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Fri,  2 Dec 2018 15:00:00 +0100
+
+gf (3.9-1) vivid xenial zesty; urgency=low
+
+  * GF 3.9
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Fri, 11 Aug 2017 20:00:00 +0200
+
+gf (3.8-1) precise trusty vivid; urgency=low
+
+  * GF 3.8
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Wed, 22 Jun 2016 14:00:00 +0200
+
+gf (3.7.1-1) precise trusty vivid; urgency=low
+
+  * GF 3.7.1
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Fri,  2 Oct 2015 14:00:00 +0200
+
+gf (3.7-1) precise trusty vivid; urgency=low
+
+  * GF 3.7
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Tue,  25 Jun 2015 14:00:00 +0200
+
+gf (3.6-1) precise saucy trusty; urgency=low
+
+  * GF 3.6
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Tue,  21 Jun 2014 20:00:00 +0200
+
+gf (3.5-1) precise quantal; urgency=low
+
+  * GF 3.5
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Tue,  6 Aug 2013 17:30:00 +0200
+
+gf (3.4-1) precise quantal; urgency=low
+
+  * GF 3.4
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Wed,  31 Dec 2012 00:00:00 +0200
+
+gf (3.3.11-1) oneiric precise quantal; urgency=low
+
+  * GF 3.3.11
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Wed,  7 Dec 2012 16:50:00 +0200
+
+gf (3.3.3-1) oneiric precise; urgency=low
+
+  * GF 3.3.3
+
+ -- Thomas Hallgren <hallgren@chalmers.se>  Wed, 22 Aug 2012 16:50:00 +0200
+
+gf (3.3-1) natty; urgency=low
+
+  * GF 3.3.
+
+ -- Thomas Hallgren <th0907@altocumulus.org>  Wed, 26 Oct 2011 22:10:42 +0200
+
 gf (2.5-1) unstable; urgency=low
 
   * Initial packaging.
- 
+
  -- Bjorn Bringert <bringert@cs.chalmers.se>  Tue, 21 Mar 2006 11:12:25 +0100

debian/compat

@@ -0,0 +1 @@
+7

debian/control

@@ -1,9 +1,10 @@
 Source: gf
+Section: devel
 Priority: optional
-Section: science
-Maintainer: Bjorn Bringert <bringert@cs.chalmers.se>
-Build-Depends: debhelper, autoconf, ghc6 (>= 6.4.1-1)
-Standards-Version: 3.6.2
+Maintainer: Thomas Hallgren <hallgren@chalmers.se>
+Standards-Version: 3.9.2
+Build-Depends: debhelper (>= 5), haskell-platform (>= 2011.2.0.1), libghc-haskeline-dev, libghc-mtl-dev, libghc-json-dev, autoconf, automake, libtool-bin, python-dev, java-sdk, txt2tags, pandoc
+Homepage: http://www.grammaticalframework.org/
 
 Package: gf
 Architecture: any
@@ -13,4 +14,3 @@ Description: Tools for GF, a grammar formalism based on type theory
  It consists of a special-purpose programming language,
  a compiler of the language, and a generic grammar processor.
  .
- Homepage: http://www.cs.chalmers.se/~aarne/GF/

debian/copyright

@@ -1,18 +1 @@
-This package was Debianized by Bjorn Bringert <bringert@cs.chalmers.se>
-on 2006-03-21. 
-
-The upstream sources for this version come from the GF darcs repository
-at http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/
-
-Authors and copyright licenses:
-
-Copyright (C):
-  Bjorn Bringert, Hakan Burden, Hans-Joachim Daniels, Markus Forsberg,
-  Thomas Hallgren, Harald Hammarstrom, Kristofer Johannisson,
-  Janna Khegai, Peter Ljunglof, Petri Maenpaa, and Aarne Ranta,
-  1998-2006.
-
-You are free to distribute this software under the terms of
-the GNU General Public License.
-On Debian systems, the complete text of the GNU General Public
-License can be found in the file /usr/share/common-licenses/GPL.
+/usr/share/common-licenses/GPL-2

debian/rules

@@ -1,102 +1,52 @@
 #!/usr/bin/make -f
-# -*- makefile -*-
-# Sample debian/rules that uses debhelper.
-# This file was originally written by Joey Hess and Craig Small.
-# As a special exception, when this file is copied by dh-make into a
-# dh-make output file, you may use that output file without restriction.
-# This special exception was added by Craig Small in version 0.37 of dh-make.
 
-# Uncomment this to turn on verbose mode.
-#export DH_VERBOSE=1
+%: 
+	+dh $@
 
+#dh_shlibdeps has a problem finding which package some of the Haskell
+#libraries come from, even though dpkg-query -S has no problem finding them.
+#But the gf executable is statically linked against the Haskell libraries, so
+#it will work even if these shared libraries aren't installed. But there will
+#be a problem if other shared libraries are missing (.e.g. libtinfo, libgmp),
+#so we need a better solution than simply ignoring all dependency problems...
+#See also http://stackoverflow.com/questions/11238134/dpkg-shlibdeps-error-no-dependency-information-found-for
+override_dh_shlibdeps:
+	dh_shlibdeps --dpkg-shlibdeps-params=--ignore-missing-info
 
-export DEB_HOST_GNU_TYPE  ?= $(shell dpkg-architecture -qDEB_HOST_GNU_TYPE)
-export DEB_BUILD_GNU_TYPE ?= $(shell dpkg-architecture -qDEB_BUILD_GNU_TYPE)
+override_dh_auto_configure:
+	cd src/runtime/c && bash setup.sh configure --prefix=/usr
+	cd src/runtime/c && bash setup.sh build
+	cabal update
+	cabal install --only-dependencies
+	cabal configure --prefix=/usr -fserver -fc-runtime --extra-lib-dirs=$(CURDIR)/src/runtime/c/.libs --extra-include-dirs=$(CURDIR)/src/runtime/c
 
-# FOR AUTOCONF 2.52 AND NEWER ONLY
-ifeq ($(DEB_BUILD_GNU_TYPE), $(DEB_HOST_GNU_TYPE))
-  confflags += --build $(DEB_HOST_GNU_TYPE)
-else
-  confflags += --build $(DEB_BUILD_GNU_TYPE) --host $(DEB_HOST_GNU_TYPE)
+SET_LDL=LD_LIBRARY_PATH=$$LD_LIBRARY_PATH:$(CURDIR)/src/runtime/c/.libs
+
+override_dh_auto_build:
+	cd src/runtime/python && EXTRA_INCLUDE_DIRS=$(CURDIR)/src/runtime/c EXTRA_LIB_DIRS=$(CURDIR)/src/runtime/c/.libs python setup.py build
+	cd src/runtime/java && make CFLAGS="-I$(CURDIR)/src/runtime/c -L$(CURDIR)/src/runtime/c/.libs" INSTALL_PATH=/usr/lib
+	echo $(SET_LDL)
+	-$(SET_LDL) cabal build # builds gf, fails to build example grammars
+	export $(SET_LDL); PATH=$(CURDIR)/dist/build/gf:$$PATH && make -C ../gf-rgl build
+	GF_LIB_PATH=$(CURDIR)/../gf-rgl/dist $(SET_LDL) cabal build # have RGL now, ok to build example grammars
+	make html
+
+override_dh_auto_install:
+	$(SET_LDL) cabal copy --destdir=$(CURDIR)/debian/gf # creates www directory
+	export GF_LIB_PATH="$$(dirname $$(find "$(CURDIR)/debian/gf" -name www))/lib" && echo "GF_LIB_PATH=$$GF_LIB_PATH" && mkdir -p "$$GF_LIB_PATH" && make -C ../gf-rgl copy
+	cd src/runtime/c && bash setup.sh copy prefix=$(CURDIR)/debian/gf/usr
+	cd src/runtime/python && python setup.py install --prefix=$(CURDIR)/debian/gf/usr
+	cd src/runtime/java && make INSTALL_PATH=$(CURDIR)/debian/gf/usr/lib install
+	D="`find debian/gf -name site-packages`" && [ -n "$$D" ] && cd $$D && cd .. && mv site-packages dist-packages
+
+override_dh_auto_clean:
+	rm -fr dist/build
+	-cd src/runtime/python && rm -fr build
+	-cd src/runtime/java && make clean
+	-cd src/runtime/c && make clean
+
+override_dh_auto_test:
+ifneq (nocheck,$(filter nocheck,$(DEB_BUILD_OPTIONS)))
+	true
+#	cabal test
 endif
-
-
-configure: configure-stamp
-configure-stamp:
-	dh_testdir
-	# Add here commands to configure the package.
-	cd src && autoconf
-
-	touch configure-stamp
-
-
-build: build-stamp
-
-build-stamp: configure-stamp 
-	dh_testdir
-
-	# Add here commands to compile the package.
-	cd src && ./configure $(confflags)
-
-	$(MAKE) -C src unix gfdoc
-	#docbook-to-man debian/gf.sgml > gf.1
-
-	touch build-stamp
-
-clean:
-	dh_testdir
-	dh_testroot
-	rm -f build-stamp configure-stamp
-
-	# Add here commands to clean up after the build process.
-	-$(MAKE) -C src clean
-
-	dh_clean 
-
-install: build
-	dh_testdir
-	dh_testroot
-	dh_clean -k 
-	dh_installdirs
-
-	# Add here commands to install the package into debian/gf.
-	$(MAKE) -C src install-gf install-gfdoc prefix=$(CURDIR)/debian/gf
-
-
-# Build architecture-independent files here.
-binary-indep: build install
-# We have nothing to do by default.
-
-# Build architecture-dependent files here.
-binary-arch: build install
-	dh_testdir
-	dh_testroot
-	dh_installchangelogs 
-	dh_installdocs
-	dh_installexamples
-#	dh_install
-#	dh_installmenu
-#	dh_installdebconf	
-#	dh_installlogrotate
-#	dh_installemacsen
-#	dh_installpam
-#	dh_installmime
-#	dh_installinit
-#	dh_installcron
-#	dh_installinfo
-	dh_installman
-	dh_link
-	dh_strip
-	dh_compress
-	dh_fixperms
-#	dh_perl
-#	dh_python
-#	dh_makeshlibs
-	dh_installdeb
-	dh_shlibdeps
-	dh_gencontrol
-	dh_md5sums
-	dh_builddeb
-
-binary: binary-indep binary-arch
-.PHONY: build clean binary-indep binary-arch binary install configure

debian/source/format

@@ -0,0 +1 @@
+3.0 (native)

debian/watch

@@ -0,0 +1,2 @@
+version=3
+http://hackage.haskell.org/packages/archive/gf/([\d\.]+)/gf-([\d\.]+).tar.gz

demos/app.html

@@ -0,0 +1,138 @@
+<!DOCTPYE html>
+<html>
+<head>
+<link rel=stylesheet href="../css/style0.css">
+<meta name = "viewport" content = "width = device-width">
+<link rel=top href="../" title="GF">
+</head>
+<body>
+
+<h1>GF Offline Translator - a mobile speech and text translation app
+for Android and iOS</h1>
+
+<center>
+<img src="images/app-trans.png" width=200>
+</center>
+
+<p>
+Android: download for free from <a
+href="https://play.google.com/store/apps/details?id=org.grammaticalframework.ui.android">Play
+Store</a>!
+Or take the <a
+href="http://www.grammaticalframework.org/~aarne/App14.apk">current
+development version</a>.
+<br>
+iOS (iPhone, iPad): coming in June 2015.
+</p>
+
+<p>
+Or try first a
+<a href="http://cloud.grammaticalframework.org/wc.html">web version of the translator</a>
+</p>
+
+
+<p>
+GF Offline Translator is based on grammar and semantics. It is compact in size
+and gives control on quality. Its technology is inspired by compilers, which are
+programs that translate computer languages.
+Most other translators for human language are based on
+statistics and have less control of quality and are much bigger, so that
+they require either an internet connection or a huge storage on your phone.
+</p>
+The app indicates translation confidence with colours:
+<ul>
+		<li><b>Green</b>:
+                 semantic translation, should be correct.
+                 But not necessarily the only correct one.
+                 You can tap the output to see alternatives.
+                </li>
+		<li><b>Yellow</b>:
+                 syntactic translation, should be grammatically correct.
+                 But can be very strange in its interpretation and choice of words.
+                </li>
+		<li><b>Light red</b>:
+                 chunk translation, probably incorrect.
+                 Builds the translation from small pieces.
+                </li>
+		<li><b>Dark red</b>:
+                 word-by-word translation, almost certainly incorrect.
+                 Builds the translation word by word.
+                </li>
+</ul>
+The green translations come from a tourist phrasebook, which allows
+you to translate things like "hello" and "how far is the airport from
+the hotel". 
+</p>
+
+<p>
+You can translate both speech and text, as selected in the menu in the
+upper right corner. Both kinds of input can be edited with the
+keyboard by first tapping at the input field. This is often needed 
+because of <b>speech recognition errors</b>. Changing words
+from <b>upper to lower case</b> may also be needed.
+At the moment, <b>Japanese</b> and <b>Thai</b> input must be separated
+to words, whereas Chinese works without spaces.
+</p>
+<p>
+Translation works between any of the 14 supported languages, which means 182
+language pairs in the current development version (the official
+Android version has 12 languages).
+But different languages are on different levels of development.
+The following table gives a rough idea of what to expect:
+</p>
+
+<p>
+<center>
+<table rules=all border=yes>
+<tr> <th></th>          <th>coverage</th> <th>quality</th> <th>speed</th> <th>speech</th> </tr>
+<tr> <th>Bulgarian</th> <td bgcolor=yellow></td> <td bgcolor=yellow></td><td bgcolor=palegreen></td> <td bgcolor=yellow>in only</td></tr>
+<tr> <th>Catalan</th>   <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=yellow>in only</td></tr>
+<tr> <th>Chinese</th>   <td bgcolor=pink></td> <td bgcolor=pink></td> <td bgcolor=palegreen></td> <td bgcolor=yellow></td> </tr>
+<tr> <th>Dutch</th>     <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=palegreen></td> </tr>
+<tr> <th>English</th>   <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> </tr>
+<tr> <th>Finnish</th>   <td bgcolor=yellow></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=yellow>in only</td></tr>
+<tr> <th>French</th>    <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>German</th>    <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Hindi</th>     <td bgcolor=pink></td> <td bgcolor=red></td> <td bgcolor=yellow></td> <td bgcolor=yellow>in only</td> </tr>
+<tr> <th>Italian</th>   <td bgcolor=pink></td> <td bgcolor=pink></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Japanese</th>  <td bgcolor=pink></td> <td bgcolor=pink></td><td bgcolor=yellow></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Spanish</th>   <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Swedish</th>   <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=palegreen></td> <td bgcolor=yellow>in only</td></tr>
+<tr> <th>Thai</th>   <td bgcolor=pink></td> <td bgcolor=pink></td><td bgcolor=yellow></td> <td bgcolor=palegreen></td></tr>
+</table>
+</center>
+</p>
+<p>
+The speech input and output use Google's voice services. Their status
+can hence change without notice. You can make it more stable by
+installing third-party speech tools, such as SVOX, which provides
+output for most of the listed languages.
+</p>
+
+<p>
+When you tap on a translation you get a screen with <b>alternative translations</b>.
+Tapping on each of the alternatives
+gives you <b>grammatical information</b>:
+an inflection table, if it is a single word,
+and a syntax tree otherwise.
+</p>
+
+<p>
+Powered by <a href="http://www.grammaticalframework.org/">GF</a>,
+built by support from the GF community and from <a href="http://www.digitalgrammars.com/">Digital Grammars</a>.
+</p>
+
+<p>
+Publication: <a
+href="http://www.aclweb.org/anthology/E/E14/E14-2011.pdf">EACL 2014
+demo paper</a>
+</p>
+
+<center>
+<img src="images/app-table.png" width=160>
+<img src="images/app-disamb.png" width=160>
+</center>
+
+
+</body>
+</html>

demos/index-numbers.html

@@ -1,43 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<HTML>
-<HEAD>
-<META NAME="generator" CONTENT="http://txt2tags.sf.net">
-<TITLE>Portable Numeral Translator</TITLE>
-</HEAD><BODY BGCOLOR="white" TEXT="black">
-<P ALIGN="center"><CENTER><H1>Portable Numeral Translator</H1>
-<FONT SIZE="4">
-<I>15 August 2008</I><BR>
-</FONT></CENTER>
-
-<P>
-Here is the first GF application for the iPhone. It translates
-numerals from digits into number words in 15 languages. It works for
-numerals in the range 1-999,999. You can use the demo online in your iPhone's
-browser, or download and install it by using FileMagnet (from AppStore).
-</P>
-<P>
-The demo should work in any web browser supporting JavaScript, but it has been
-specially dimensioned for the iPhone screen. It is an application of a general
-technology, namely the compilation of GF grammars to JavaScript. Thus you can 
-easily build similar applications from your own grammars.
-</P>
-<P>
-The 
-<A HREF="http://www.cs.chalmers.se/~bringert/gf/translate/">full numeral translator</A>, which
-works in 88 language and permits arbitrary cross translations, cannot yet be ported
-to the iPhone because of memory problems.
-</P>
-<P>
-The current version has some encoding/font issues in Hebrew and Hindi.
-</P>
-<P>
-<A HREF="numbers/numbers.html">Use the translator online</A>
-</P>
-<P>
-<A HREF="numbers.tgz">Download the translator</A>. To install: unpack the file and move
-the directory <CODE>numbers</CODE> to your FileMagnet uploader.
-</P>
-
-<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
-<!-- cmdline: txt2tags -thtml index-numbers.txt -->
-</BODY></HTML>

demos/index.html

@@ -1,48 +1,60 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
+<!DOCTYPE html>
 <HTML>
 <HEAD>
 <TITLE>Grammatical Framework Demos</TITLE>
 <link rel=stylesheet href="../css/style.css">
+<meta name = "viewport" content = "width = device-width">
+<link rel=top href="../" title="GF">
 </HEAD>
 
 <BODY>
-<H1><IMG SRC="../doc/Logos/gf0.png" alt="">Grammatical Framework Demos</H1>
+<H1><a href="../"><IMG SRC="../doc/Logos/gf0.png" alt=""></a>Grammatical Framework Demos</H1>
 
-<p>
-<a href="http://www.grammaticalframework.org/demos/phrasebook/">Tourist
+<p><a href="translation.html">Wide coverage translation with GF</a>
+<p><a href="app.html">The GF Offline Translation App</a>:
+   a mobile speech and text translation app for Android and iOS.
+<p><a href="http://www.grammaticalframework.org/demos/phrasebook/">Tourist
 Phrasebook</a>
 
-<p>
-<strong>NEW</strong>
-<a href="TransQuiz/">Translation Quiz</a>
+<p><a href="http://www.phrasomatic.net/">Phrasomatic</a> (conceptual authoring based on Phrasebook)
 
-<P>
-<A HREF="http://www.grammaticalframework.org:41296/minibar/minibar.html">Minibar
-online</A>
- | <small><a href="http://www.grammaticalframework.org/~hallgren/hs2js/test/">Minibar offline</a></small>
-<P>
-<A HREF="http://www.grammaticalframework.org:41296/fridge">Fridge poetry</A>
+<p><a href="multilingual_headlines.html">Multilingual Headlines</a>
 
-<P>
-<A HREF="http://www.grammaticalframework.org:41296/translate">Word-completing translator</A>
+<p><a href="molto.html">MOLTO Application Grammars</a>
 
+<p><a href="mathbar/">Mathbar</a>
+
+<p><a href="http://cloud.grammaticalframework.org/gfse/">GF online editor for simple multilingual grammars</a>
+<!--<br>(there is also an <a href="gfse/">older prototype</a>)-->
+
+<p><a href="http://www.grammaticalframework.org:41297/syllogism/syllogism.html">Online syllogism solver</a>
+
+<p><a href="../src/www/TransQuiz/translation_quiz.html">Translation Quiz</a>
+
+<P><a href="http://cloud.grammaticalframework.org/minibar/minibar.html">Minibar</A>
+<!-- | <small><a href="../src/www/minibar/minibar_offline.html">Minibar offline</a></small> -->
+<!--(<small>Predecessors:
+<a href="http://www.grammaticalframework.org:41296/fridge">Fridge poetry</A>
+ | <a href="http://www.grammaticalframework.org:41296/translate">Word-completing translator</A></small>)-->
+
+<p><a href="http://www.grammaticalframework.org/~hallgren/Talks/GF/Tutorial2012/Ex4/answer.html">Question answering demo</a> for simple math questions.
 <P>
 <A HREF="http://www.youtube.com/watch?v=1bfaYHWS6zU">Tramdemo on YouTube</A>: 
 find your way in Gothenburg public transport system, in six languages (film).
 
 <P>
-<!-- <B>NEW</B> <A HREF="http://csmisc14.cs.chalmers.se/~meza/restWiki/wiki.cgi">Multilingual Wiki</A>. -->
+<A HREF="http://www.grammaticalframework.org/~meza/restWiki/wiki.cgi">Multilingual Wiki</A>.
 
 <P>
 <A HREF="index-numbers.html">Numeral translator for the iPhone</A>: number words in 15 languages.
 
 <P>
 <A HREF="http://www.cse.chalmers.se/alumni/bringert/gf/translate/">Numeral translator</A>:
-number words in 88 languages.
+number words in 88 languages. (Java applet)
 
 <P>
 <A HREF="http://www.cse.chalmers.se/alumni/markus/gramlets/letter-applet.html">Letter editor</A>: compose
-a letter in a language you don't know.
+a letter in a language you don't know. (Java applet)
 
 <P>
 <A HREF="http://www.cse.chalmers.se/alumni/bringert/xv/pizza/">Pizza</A>: order a pizza by speaking
@@ -51,13 +63,17 @@ to your web browser.
 <P>
 <A HREF="http://webalt.math.helsinki.fi/PublicFiles/CD/Screencast/TextMathEditor%20Demo.swf">WebALT Math Editor</A>:
 create mathematical exercises in six languages simultaneously (film).
-
+<!--
 <P>
+[Out of order, early May 2012]
+<small>
 <A HREF="http://www.jem-thematic.net/en/node/846#comment-209">WebALT Math translator</A>:
 translate mathematical exercises in a web service using incremental parsing.
-
+</small>
+-->
+<!--
 <P>
-<!-- <A HREF="http://csmisc14.cs.chalmers.se/~bjorn/langtrain.cgi">GF Language Trainer</A>:
+ <A HREF="http://csmisc14.cs.chalmers.se/~bjorn/langtrain.cgi">GF Language Trainer</A>:
 translation quizzes in Arabic, English, Russian, Swedish. -->
 
 <P>
@@ -69,3 +85,5 @@ the <A HREF="../lib/doc/synopsis.html">GF resource library</A>
 <A HREF="../old-lib/resource/doc/resdemo.html">Random library examples</A>
 
 -->
+<hr>
+<a href="http://www.grammaticalframework.org/">www.grammaticalframework.org</a>

demos/molto.html

@@ -0,0 +1,49 @@
+<!DOCTYPE html>
+<html>
+<head>
+<title>MOLTO Application Grammars</title>
+<link rel=stylesheet type="text/css" href="../src/www/minibar/minibar.css">
+<link rel=stylesheet type="text/css" href="../src/www/syntax-editor/editor.css">
+
+<link rel=author href="http://www.cse.chalmers.se/~hallgren/" title="Thomas Hallgren">
+
+<meta name = "viewport" content = "width = device-width">
+<meta charset="UTF-8">
+
+</head>
+
+<body class=minibar>
+<h2>MOLTO Application Grammars</h2>
+<div id=minibar></div>
+<div id=syntax_editor></div>
+
+<noscript>This page doesn't works unless JavaScript is enabled.</noscript>
+
+<hr>
+
+<small>
+[<a href="http://www.molto-project.eu/cloud/gf-application-grammars">GF
+ Application Grammars on the MOLTO web site</a>]
+</small>
+<small class=modtime>
+HTML <!-- hhmts start -->Last modified: Fri May 24, 2013 <!-- hhmts end -->
+</small>
+
+<div id="debug" class="hidden"></div>
+
+<script type="text/JavaScript" src="../src/www/js/grammar_manager.js"></script>
+<script type="text/JavaScript" src="../src/www/js/support.js"></script>
+<script type="text/JavaScript" src="../src/www/js/localstorage.js"></script>
+<script type="text/JavaScript" src="../src/www/minibar/minibar.js"></script>
+<script type="text/JavaScript" src="../src/www/minibar/minibar_input.js"></script>
+<script type="text/JavaScript" src="../src/www/minibar/minibar_translations.js"></script>
+<script type="text/JavaScript" src="../src/www/minibar/minibar_support.js"></script>
+<script type="text/JavaScript" src="../src/www/js/pgf_online.js"></script>
+<script type="text/javascript" src="../src/www/syntax-editor/ast.js"></script>
+<script type="text/javascript" src="../src/www/syntax-editor/editor_menu.js"></script>
+<script type="text/javascript" src="../src/www/syntax-editor/editor.js"></script>
+<script type="text/javascript" src="molto_grammars.js"></script>
+<script type="text/javascript" src="../src/www/gfse/gf_abs.js"></script>
+
+</body>
+</html>

demos/molto_grammars.js

@@ -0,0 +1,19 @@
+var online_options={
+  grammars_url: "/grammars/molto/"
+}
+
+var minibar_options= {
+    show_abstract: true,
+    show_trees: true,
+    tree_img_format: "svg", // or "png"
+    show_grouped_translations: false,
+    to_multiple: false,
+    show_brackets: true,
+    word_replacements: true,
+    default_source_language: "Eng",
+    feedback_url: "feedback.html",
+    try_google: true
+}
+
+var server=pgf_online(online_options);
+var minibar=new Minibar(server,minibar_options);

demos/resourcegrammars.t2t

@@ -0,0 +1,19 @@
+Computational Grammars for the World
+The GF Resource Grammar Library
+
+
+
+Did you ever struggle with the inflection of French verbs? Or with getting the words in a German sentence into the right order? 
+Don't worry: these problems are as easy for a computer as to calculate 2+2. This page will give you access to computer programs that
+- help you construct sentences and other expressions
+- help you inflect words
+- help you covert sentences to different tenses, and other similar operations
+- help you compare languages by translating them and linking corresponding parts
+- allow you to practice your language skills by automatically generated and graded exercises
+- explain grammar rules in a mathematically precise and shortest possible manner
+
+
+//Coming soon!// for 29 languages.
+
+Powered by [GF ..] and its [Resource Grammar Library ../lib/doc/synopsis.html]
+

demos/translation.t2t

@@ -0,0 +1,100 @@
+Translation with GF
+Powered by multilingual grammars
+
+%!style:../css/style0.css
+%!postproc(html): <H1> <H1><a href="../"><IMG src="../doc/Logos/gf0.svg" alt=""></a>
+%!postproc(html): #GFWCT <iframe style="border: 0; width: 100%; height: 50ex;" src="http://cloud.grammaticalframework.org/wc.html#embed"></iframe>
+
+==Try it online==
+
+%**Coming soon**:
+%//Here you will be able to select your source and target language and translate% whatever you want.//
+#GFWCT
+
+
+==Download the app==
+
+[App description and download page ./app.html]
+
+
+==Colours==
+
+- **Green: semantic translation**, should be correct.
+                 But not necessarily the only correct one. 
+- **Yellow: syntactic translation**, should be grammatically correct.
+                 But can be very strange in its interpretation and choice of words.
+- **Light red: chunk translation**, probably incorrect.
+                 Builds the translation from small pieces.
+- **Dark red: word-by-word translation**, almost certainly incorrect.
+                 Builds the translation word by word and returns unknown words verbatim.
+
+
+The green translations currently come from a tourist phrasebook, which allows
+you to translate things like "hello" and "how far is the airport from
+the hotel". But this part can be easily adapted to other uses, such as
+technical language.
+
+
+==What you can expect==
+
+The program is designed to translate anything, just like Google translate and Bing. It has some advantages over them:
+- It uses **grammars** (as opposed to statistics), which makes it more correct in many cases.
+- It is **open source**, which means you can inspect, copy, and modify it in what ever way you want.
+- It is **light weight**, so that you can run it on your own computer and even on a smartphone.
+- It gives you **linguistic information**, such as word inflections.
+- It gives you **confidence information**, warning about translations that it is not so sure about.
+
+
+However, this is not a mature product but a research prototype. It therefore has some shortcomings:
+- It has **limited coverage**, which means that it misses many words and syntactic constructions.
+- It can be **clumsy**, for instance when it doesn't detect an idiom but translates too literally.
+- It can be **slow**, in particular with long sentences and with some input languages.
+
+
+Here are some hints to use it in a satisfactory way:
+- Start with short sentences (less than ten words), preferably from English or Swedish, to get an idea of the best performance.
+- Take a look at the alternative translations, in particular for sentences with low confidence level.
+- Send us feedback, and consider contributing to the improvement of the system!
+
+
+
+The following table gives a rough idea of what to expect for each
+language (the speech column refers to the Android app):
+'''
+<center>
+<table rules=all border=yes>
+<tr> <th></th>          <th>coverage</th> <th>quality</th> <th>speed</th> <th>speech</th> </tr>
+<tr> <th>Bulgarian</th> <td bgcolor=yellow></td> <td bgcolor=yellow></td><td bgcolor=palegreen></td> <td bgcolor=yellow>in only</td></tr>
+<tr> <th>Chinese</th>   <td bgcolor=pink></td> <td bgcolor=pink></td> <td bgcolor=palegreen></td> <td bgcolor=yellow>diff in/out</td> </tr>
+<tr> <th>Dutch</th>     <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=palegreen></td> </tr>
+<tr> <th>English</th>   <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> </tr>
+<tr> <th>Finnish</th>   <td bgcolor=yellow></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>French</th>    <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>German</th>    <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Hindi</th>     <td bgcolor=pink></td> <td bgcolor=pink></td> <td bgcolor=yellow></td> <td bgcolor=yellow>out only</td> </tr>
+<tr> <th>Italian</th>    <td bgcolor=pink></td> <td bgcolor=pink></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Spanish</th>    <td bgcolor=pink></td> <td bgcolor=yellow></td><td bgcolor=pink></td> <td bgcolor=palegreen></td></tr>
+<tr> <th>Swedish</th>   <td bgcolor=yellow></td> <td bgcolor=yellow></td> <td bgcolor=palegreen></td> <td bgcolor=palegreen></td> </tr>
+</table>
+</center>
+'''
+
+
+==How it works==
+
+Powered by [Grammatical Framework ../]
+
+[Slides https://docs.google.com/presentation/d/1545yYmTlWgzyV1uwUwuvAsOCzdD1AIUdV_NZbZ1qMEo/edit?usp=sharing]
+explaining the translation method:
+
+
+==Get the sources==
+
+Download from [here ../download/]
+
+
+==Send us feedback==
+
+
+
+

doc/Logos/gf0.svg

@@ -1 +1 @@
-<?xml version="1.0" standalone="no"?>
+<?xml version="1.0" standalone="no"?>

doc/Logos/gf1.svg

@@ -0,0 +1,14 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+
+<svg width="240" height="240" version="1.1" xmlns="http://www.w3.org/2000/svg">
+   <filter id="A"><feGaussianBlur stdDeviation="2"/></filter> 
+   <path filter="url(#A)"
+	 d="M120,227.5 v-51 h59 m-59,0 v-53 h114 a110.5,105 0 1,1 -24,-66"
+         fill="none" stroke="black" stroke-width="4" opacity="0.25"
+         stroke-linejoin="round" stroke-linecap="round"/>
+   <path d="M120,225.5 v-51 h59 m-59,0 v-53 h114 a110.5,105 0 1,1 -24,-66"
+         fill="none" stroke="red" stroke-width="4"
+         stroke-linejoin="round" stroke-linecap="round"/>
+</svg>

doc/Makefile

@@ -1,17 +1,6 @@
-resource:
-	gfdoc -txt2 ../lib/resource-1.0/abstract/*.gf
-	gfdoc -txt2 ../lib/resource-1.0/*/Paradigms*.gf
-	txt2tags --toc resource.txt
-#	cat resource-preamble resource.tex >final-resource.tex
-	sed -i 's/\\docum/%\\docum/g' resource.tex
-	sed -i 's/ion\*{/ion{/g' resource.tex
-	sed -i 's/\\paragraph{}//g' resource.tex
-	sed -i 's/}\\\\/}/g' resource.tex
-	cat resource-preamble resource.tex >resource.tmp
-	mv resource.tmp resource.tex
-	latex resource.tex
-	latex resource.tex
-	dvipdf resource.dvi
+gf-help-full.txt::
+	{ echo ; echo ; echo ; } > $@
+	echo help -full -t2t | gf -run >> $@
 
 ### Converting SVG logos to PNG, using convert from ImageMagick
 logos:: Logos/gf00.png Logos/gf0.png

doc/error-messages.txt

@@ -0,0 +1,551 @@
+Compiler.hs
+mainGFC :: Options -> [FilePath] -> IO ()
+                 _ | null fs -> fail $ "No input files."
+                 _ | all (extensionIs ".pgf") fs -> unionPGFFiles opts fs
+                 _ -> fail $ "Don't know what to do with these input files: " ++ unwords fs)
+
+
+----------------------------------------
+Compile.hs
+
+compileModule
+                       case length file1s of
+                         0 -> raise (render ("Unable to find: " $$ nest 2 candidates))
+                         1 -> do return $ head file1s
+                         _ -> do putIfVerb opts1 ("matched multiple candidates: " +++ show file1s)
+                                 return $ head file1s
+               else raise (render ("File" <+> file <+> "does not exist"))
+
+---------------------------------------
+Grammar.Lexer.x
+token :: P Token
+        AlexError (AI pos _ _) -> PFailed pos "lexical error"
+
+
+---------------------------------------
+Grammar.Parser.y
+
+happyError = fail "syntax error"
+
+tryLoc (c,mty,Just e) = return (c,(mty,e))
+tryLoc (c,_  ,_     ) = fail ("local definition of" +++ showIdent c +++ "without value")
+
+mkR []       = return $ RecType [] --- empty record always interpreted as record type
+mkR fs@(f:_) =
+  case f of
+    (lab,Just ty,Nothing) -> mapM tryRT fs >>= return . RecType
+    _                     -> mapM tryR  fs >>= return . R
+  where
+    tryRT (lab,Just ty,Nothing) = return (ident2label lab,ty)
+    tryRT (lab,_      ,_      ) = fail $ "illegal record type field" +++ showIdent lab --- manifest fields ?!
+
+    tryR (lab,mty,Just t) = return (ident2label lab,(mty,t))
+    tryR (lab,_  ,_     ) = fail $ "illegal record field" +++ showIdent lab
+
+
+---------------------------------------
+ModDeps.hs
+
+mkSourceGrammar :: [SourceModule] -> Err SourceGrammar
+  deplist <- either 
+               return 
+               (\ms -> Bad $ "circular modules" +++ unwords (map show ms)) $ 
+
+
+checkUniqueImportNames :: [Ident] -> SourceModInfo -> Err ()
+   test ms = testErr (all (`notElem` ns) ms)
+                     ("import names clashing with module names among" +++ unwords (map prt ms))
+
+
+moduleDeps :: [SourceModule] -> Err Dependencies
+  deps (c,m) = errIn ("checking dependencies of module" +++ prt c) $ case mtype m of
+      MTConcrete a -> do
+        am <- lookupModuleType gr a
+        testErr (mtype am == MTAbstract) "the of-module is not an abstract syntax" 
+
+    testErr (all (compatMType ety . mtype) ests) "inappropriate extension module type" 
+
+
+---------------------------------------
+Update.hs
+
+buildAnyTree
+        Just i  -> case unifyAnyInfo m i j of
+		     Ok k  -> go (Map.insert c k map) is
+		     Bad _ -> fail $ render ("conflicting information in module"<+>m $$
+		                             nest 4 (ppJudgement Qualified (c,i)) $$
+		                             "and" $+$
+		                             nest 4 (ppJudgement Qualified (c,j)))
+extendModule
+    unless (sameMType (mtype m) (mtype mo)) 
+            (checkError ("illegal extension type to module" <+> name))
+
+rebuildModule
+      unless (null is || mstatus mi == MSIncomplete) 
+             (checkError ("module" <+> i <+> 
+                          "has open interfaces and must therefore be declared incomplete"))
+
+         unless (isModRes m1)
+                 (checkError ("interface expected instead of" <+> i0))
+          js' <- extendMod gr False ((i0,m1), isInherited mincl) i (jments mi)
+
+     unless (stat' == MSComplete || stat == MSIncomplete) 
+             (checkError ("module" <+> i <+> "remains incomplete"))
+
+
+extendMod
+		                                 checkError ("cannot unify the information" $$ 
+		                                             nest 4 (ppJudgement Qualified (c,i)) $$
+		                                             "in module" <+> name <+> "with" $$
+		                                             nest 4 (ppJudgement Qualified (c,j)) $$
+		                                             "in module" <+> base)
+
+unifyAnyInfo
+  (ResValue (L l1 t1), ResValue (L l2 t2)) 
+      | t1==t2    -> return (ResValue (L l1 t1))
+      | otherwise -> fail ""
+
+  (AnyInd b1 m1, AnyInd b2 m2) -> do
+    testErr (b1 == b2) $ "indirection status"
+    testErr (m1 == m2) $ "different sources of indirection"
+
+unifAbsDefs _         _         = fail ""
+
+----------------------------------
+
+Rename.hs
+
+renameIdentTerm'
+        _    -> case lookupTreeManyAll showIdent opens c of
+                  [f]  -> return (f c)
+                  []   -> alt c ("constant not found:" <+> c $$
+                                 "given" <+> fsep (punctuate ',' (map fst qualifs)))
+
+                           ts@(t:_) -> do checkWarn ("atomic term" <+> ppTerm Qualified 0 t0 $$
+                                                      "conflict" <+> hsep (punctuate ',' (map (ppTerm Qualified 0) ts)) $$
+                                                      "given" <+> fsep (punctuate ',' (map fst qualifs)))
+                                           return t
+
+renameInfo
+    renLoc ren (L loc x) =
+      checkInModule cwd mi loc ("Happened in the renaming of" <+> i) $ do
+
+renameTerm
+      | otherwise -> checks [ renid' (Q (MN r,label2ident l))      -- .. and qualified expression second.
+                            , renid' t >>= \t -> return (P t l) -- try as a constant at the end
+                            , checkError ("unknown qualified constant" <+> trm)
+                            ]
+
+renamePattern env patt =
+    do r@(p',vs) <- renp patt
+       let dupl = vs \\ nub vs
+       unless (null dupl) $ checkError (hang ("[C.4.13] Pattern is not linear:") 4
+                                             patt)
+       return r
+
+       case c' of
+          Q d -> renp $ PM d
+          _ -> checkError ("unresolved pattern" <+> patt)
+
+          Q  _ -> checkError ("data constructor expected but" <+> ppTerm Qualified 0 c' <+> "is found instead")
+          _    -> checkError ("unresolved data constructor" <+> ppTerm Qualified 0 c')
+
+      PM c -> do
+        x <- renid (Q c)
+        c' <- case x of
+                (Q c') -> return c'
+                _      -> checkError ("not a pattern macro" <+> ppPatt Qualified 0 patt)
+
+     PV x -> checks [ renid' (Vr x) >>= \t' -> case t' of
+                                                 QC c -> return (PP c [],[])
+                                                 _    -> checkError (pp "not a constructor")
+                     , return (patt, [x])
+ 
+
+
+-----------------------------------
+CheckGrammar.hs
+
+checkRestrictedInheritance :: FilePath -> SourceGrammar -> SourceModule -> Check ()
+     let illegals = [(f,is) | 
+           (f,cs) <- allDeps, incld f, let is = filter illegal cs, not (null is)]
+     case illegals of 
+       [] -> return ()
+       cs -> checkWarn ("In inherited module" <+> i <> ", dependence of excluded constants:" $$
+                         nest 2 (vcat [f <+> "on" <+> fsep is | (f,is) <- cs]))
+
+checkCompleteGrammar :: Options -> FilePath -> Grammar -> Module -> Module -> Check Module
+                       case info of
+                         CncCat (Just (L loc (RecType []))) _ _ _ _ -> return (foldr (\_ -> Abs Explicit identW) (R []) cxt)
+                         _                                          -> Bad "no def lin"
+
+         where noLinOf c = checkWarn ("no linearization of" <+> c)
+
+         Ok (CncCat Nothing md mr mp mpmcfg) -> do
+           checkWarn ("no linearization type for" <+> c <> ", inserting default {s : Str}")
+           return $ updateTree (c,CncCat (Just (L NoLoc defLinType)) md mr mp mpmcfg) js
+         _ -> do
+           checkWarn ("no linearization type for" <+> c <> ", inserting default {s : Str}")
+
+                             _       -> do checkWarn ("function" <+> c <+> "is not in abstract")
+
+           Ok (_,AbsFun {}) ->
+                   checkError ("lincat:"<+>c<+>"is a fun, not a cat")
+           -}
+           _ -> do checkWarn ("category" <+> c <+> "is not in abstract")
+
+checkInfo :: Options -> FilePath -> SourceGrammar -> SourceModule -> Ident -> Info -> Check Info
+         (Just (L loct ty), Nothing) -> do
+           chIn loct "operation" $
+             checkError (pp "No definition given to the operation")
+
+    ResOverload os tysts -> chIn NoLoc "overloading" $ do
+    
+       checkUniq xss = case xss of
+     x:y:xs 
+      | x == y    -> checkError $ "ambiguous for type" <+>
+                                  ppType (mkFunType (tail x) (head x))
+
+   compAbsTyp g t = case t of
+     Vr x -> maybe (checkError ("no value given to variable" <+> x)) return $ lookup x g
+
+checkReservedId x =
+  when (isReservedWord x) $
+       checkWarn ("reserved word used as identifier:" <+> x)
+
+
+--------------------------------
+TypeCheck/Abstract.hs
+
+grammar2theory :: SourceGrammar -> Theory
+  Bad s -> case lookupCatContext gr m f of
+    Ok cont -> return $ cont2val cont
+    _ -> Bad s
+
+
+--------------------------------
+TypeCheck/ConcreteNew.hs
+-- Concrete.hs has all its code commented out
+
+
+--------------------------------
+TypeCheck/RConcrete.hs
+-- seems to be used more than ConcreteNew
+
+computeLType :: SourceGrammar -> Context -> Type -> Check Type
+   AdHocOverload ts -> do
+     over <- getOverload gr g (Just typeType) t
+     case over of
+       Just (tr,_) -> return tr
+       _ -> checkError ("unresolved overloading of constants" <+> ppTerm Qualified 0 t) 
+
+inferLType :: SourceGrammar -> Context -> Term -> Check (Term, Type)
+   Q (m,ident) | isPredef m -> termWith trm $ case typPredefined ident of
+                                                Nothing -> checkError ("unknown in Predef:" <+> ident)
+
+   Q ident -> checks [
+     checkError ("cannot infer type of constant" <+> ppTerm Unqualified 0 trm)
+     ]
+
+   QC ident -> checks [
+       checkError ("cannot infer type of canonical constant" <+> ppTerm Unqualified 0 trm)
+       ]
+
+   Vr ident -> termWith trm $ checkLookup ident g
+
+   AdHocOverload ts -> do
+       _ -> checkError ("unresolved overloading of constants" <+> ppTerm Qualified 0 trm) 
+
+   App f a -> do
+         case fty' of
+           Prod bt z arg val -> do 
+           _ -> checkError ("A function type is expected for" <+> ppTerm Unqualified 0 f <+> "instead of type" <+> ppType fty)
+
+   S f x -> do
+       _ -> checkError ("table lintype expected for the table in" $$ nest 2 (ppTerm Unqualified 0 trm))
+
+   P t i -> do
+                       Nothing -> checkError ("unknown label" <+> i <+> "in" $$ nest 2 (ppTerm Unqualified 0 ty'))
+       _          -> checkError ("record type expected for:" <+> ppTerm Unqualified 0 t $$
+                                 " instead of the inferred:" <+> ppTerm Unqualified 0 ty')
+
+   R r -> do
+     checkCond ("cannot infer type of record" $$ nest 2 (ppTerm Unqualified 0 trm)) (length ts == length fsts)
+
+   T ti pts -> do  -- tries to guess: good in oper type inference
+       [] -> checkError ("cannot infer table type of" <+> ppTerm Unqualified 0 trm)
+
+   ---- hack from Rename.identRenameTerm, to live with files with naming conflicts 18/6/2007
+   Strs (Cn c : ts) | c == cConflict -> do
+     checkWarn ("unresolved constant, could be any of" <+> hcat (map (ppTerm Unqualified 0) ts))
+
+   ExtR r s -> do
+     case (rT', sT') of
+       (RecType rs, RecType ss) -> do
+       _ -> checkError ("records or record types expected in" <+> ppTerm Unqualified 0 trm)
+
+   _ -> checkError ("cannot infer lintype of" <+> ppTerm Unqualified 0 trm)
+
+
+getOverload :: SourceGrammar -> Context -> Maybe Type -> Term -> Check (Maybe (Term,Type))
+   matchOverload f typs ttys = do
+         checkWarn $  "ignoring lock fields in resolving" <+> ppTerm Unqualified 0 ot $$
+                      "for" $$
+                      nest 2 (showTypes tys) $$
+                      "using" $$
+                      nest 2 (showTypes pre)
+       ([],[]) -> do
+         checkError $ "no overload instance of" <+> ppTerm Unqualified 0 f $$
+                      "for" $$
+                      nest 2 stysError $$
+                      "among" $$
+                      nest 2 (vcat stypsError) $$
+                      maybe empty (\x -> "with value type" <+> ppType x) mt
+        ([],[(val,fun)]) -> do
+           checkWarn ("ignoring lock fields in resolving" <+> ppTerm Unqualified 0 ot) 
+         (nps1,nps2) -> do 
+              checkWarn $  "ambiguous overloading of" <+> ppTerm Unqualified 0 f <+>
+                  ----     "with argument types" <+> hsep (map (ppTerm Qualified 0) tys) $$ 
+                           "resolved by selecting the first of the alternatives" $$
+                           nest 2 (vcat [ppTerm Qualified 0 fun | (_,ty,fun) <- vfs1 ++ if null vfs1 then vfs2 else []])
+              case [(mkApp fun tts,val) | (val,fun) <- nps1 ++ nps2] of
+                 [] -> checkError $ "no alternatives left when resolving" <+> ppTerm Unqualified 0 f
+ 
+checkLType :: SourceGrammar -> Context -> Term -> Type -> Check (Term, Type)
+    Abs bt x c -> do
+      case typ of
+        Prod bt' z a b -> do 
+        _ -> checkError $ "function type expected instead of" <+> ppType typ
+    AdHocOverload ts -> do
+        _ -> checkError ("unresolved overloading of constants" <+> ppTerm Qualified 0 trm) 
+    T _ [] ->
+      checkError ("found empty table in type" <+> ppTerm Unqualified 0 typ)
+    T _ cs -> case typ of 
+              else checkWarn ("patterns never reached:" $$
+                              nest 2 (vcat (map (ppPatt Unqualified 0) ps)))
+      _ -> checkError $ "table type expected for table instead of" $$ nest 2 (ppType typ)
+    V arg0 vs ->
+              if length vs1 == length vs
+                 then return ()
+                 else checkError $ "wrong number of values in table" <+> ppTerm Unqualified 0 trm
+
+    R r -> case typ of --- why needed? because inference may be too difficult
+       RecType rr -> do
+       _ -> checkError ("record type expected in type checking instead of" $$ nest 2 (ppTerm Unqualified 0 typ))
+
+    ExtR r s -> case typ of
+         case trm' of
+           RecType _ -> termWith trm' $ return typeType
+           ExtR (Vr _) (RecType _) -> termWith trm' $ return typeType 
+                                      -- ext t = t ** ...
+           _ -> checkError ("invalid record type extension" <+> nest 2 (ppTerm Unqualified 0 trm))
+
+             case typ2 of
+               RecType ss -> return $ map fst ss
+               _ ->  checkError ("cannot get labels from" $$ nest 2 (ppTerm Unqualified 0 typ2))
+       _ -> checkError ("record extension not meaningful for" <+> ppTerm Unqualified 0 typ)
+
+    S tab arg -> checks [ do
+        _ -> checkError ("table type expected for applied table instead of" <+> ppType ty')
+
+    _ -> do
+      (trm',ty') <- inferLType gr g trm
+      termWith trm' $ checkEqLType gr g typ ty' trm'
+
+   checkM rms (l,ty) = case lookup l rms of
+     _ -> checkError $ 
+            if isLockLabel l 
+              then let cat = drop 5 (showIdent (label2ident l))
+                   in ppTerm Unqualified 0 (R rms) <+> "is not in the lincat of" <+> cat <> 
+                      "; try wrapping it with lin" <+> cat
+              else "cannot find value for label" <+> l <+> "in" <+> ppTerm Unqualified 0 (R rms)
+
+checkEqLType :: SourceGrammar -> Context -> Type -> Type -> Term -> Check Type
+    False -> checkError $ s <+> "type of" <+> ppTerm Unqualified 0 trm $$
+                          "expected:" <+> ppTerm Qualified 0 t $$ -- ppqType t u $$
+                          "inferred:" <+> ppTerm Qualified 0 u -- ppqType u t
+
+checkIfEqLType :: SourceGrammar -> Context -> Type -> Type -> Term -> Check (Bool,Type,Type,String)
+      Ok lo -> do
+        checkWarn $ "missing lock field" <+> fsep lo
+
+   missingLock g t u = case (t,u) of  
+         _:_ -> Bad $ render ("missing record fields:" <+> fsep (punctuate ',' (others)))
+
+
+
+pattContext :: SourceGrammar -> Context -> Type -> Patt -> Check Context
+    checkCond ("wrong number of arguments for constructor in" <+> ppPatt Unqualified 0 p) 
+              (length cont == length ps)
+  PR r -> do
+      _ -> checkError ("record type expected for pattern instead of" <+> ppTerm Unqualified 0 typ')
+
+  PAlt p' q -> do
+    g1 <- pattContext env g typ p'
+    g2 <- pattContext env g typ q
+    let pts = nub ([x | pt@(_,x,_) <- g1, notElem pt g2] ++ [x | pt@(_,x,_) <- g2, notElem pt g1])
+    checkCond 
+      ("incompatible bindings of" <+>
+       fsep pts <+> 
+       "in pattern alterantives" <+> ppPatt Unqualified 0 p) (null pts) 
+    return g1 -- must be g1 == g2
+    
+   noBind typ p' = do
+    co <- pattContext env g typ p'
+    if not (null co)
+      then checkWarn ("no variable bound inside pattern" <+> ppPatt Unqualified 0 p) 
+           >> return []
+      else return []
+
+checkLookup :: Ident -> Context -> Check Type -- used for looking up Vr x type in context
+    []     -> checkError ("unknown variable" <+> x)
+ 
+
+
+-------------------------------
+Grammar/Lookup.hs
+
+lookupIdent :: ErrorMonad m => Ident -> BinTree Ident b -> m b
+    Bad _ -> raise ("unknown identifier" +++ showIdent c)
+
+lookupResDefLoc
+        _   -> raise $ render (c <+> "is not defined in resource" <+> m)
+
+lookupResType :: ErrorMonad m => Grammar -> QIdent -> m Type
+    _   -> raise $ render (c <+> "has no type defined in resource" <+> m)
+
+lookupOverloadTypes :: ErrorMonad m => Grammar -> QIdent -> m [(Term,Type)]
+    _            -> raise $ render (c <+> "has no types defined in resource" <+> m)
+
+lookupOverload :: ErrorMonad m => Grammar -> QIdent -> m [([Type],(Type,Term))]
+      _   -> raise $ render (c <+> "is not an overloaded operation")
+
+
+lookupParamValues :: ErrorMonad m => Grammar -> QIdent -> m [Term]
+  case info of
+    ResParam _ (Just pvs) -> return pvs
+    _                     -> raise $ render (ppQIdent Qualified c <+> "has no parameter values defined")
+
+
+allParamValues :: ErrorMonad m => Grammar -> Type -> m [Term]
+    _ -> raise (render ("cannot find parameter values for" <+> ptyp))
+
+
+lookupFunType :: ErrorMonad m => Grammar -> ModuleName -> Ident -> m Type
+    _                           -> raise (render ("cannot find type of" <+> c))
+
+lookupCatContext :: ErrorMonad m => Grammar -> ModuleName -> Ident -> m Context
+    _                      -> raise (render ("unknown category" <+> c))
+
+
+-------------------------
+PatternMatch.hs
+
+matchPattern :: ErrorMonad m => [(Patt,rhs)] -> Term -> m (rhs, Substitution)
+  if not (isInConstantForm term)
+    then raise (render ("variables occur in" <+> pp term))
+
+findMatch :: ErrorMonad m => [([Patt],rhs)] -> [Term] -> m (rhs, Substitution)
+   [] -> raise (render ("no applicable case for" <+> hsep (punctuate ',' terms)))
+   (patts,_):_ | length patts /= length terms -> 
+       raise (render ("wrong number of args for patterns :" <+> hsep patts <+> 
+                    "cannot take" <+> hsep terms))
+
+tryMatch :: (Patt, Term) -> Err [(Ident, Term)]
+      (PNeg p',_) -> case tryMatch (p',t) of
+        Bad _ -> return []
+        _ -> raise (render ("no match with negative pattern" <+> p))
+
+
+---------------------------------------------
+Compile.Optimize.hs
+
+mkLinDefault :: SourceGrammar -> Type -> Err Term
+                            _   -> Bad (render ("no parameter values given to type" <+> ppQIdent Qualified p))
+     _ -> Bad (render ("linearization type field cannot be" <+> typ))
+
+mkLinReference :: SourceGrammar -> Type -> Err Term
+                            []     -> Bad "no string"
+
+
+---------------------------------------------
+Compile.Compute.Concrete.hs
+
+nfx env@(GE _ _ _ loc) t = do
+    Left i  -> fail ("variable #"++show i++" is out of scope")
+
+var :: CompleteEnv -> Ident -> Err OpenValue
+var env x = maybe unbound pick' (elemIndex x (local env))
+  where
+    unbound = fail ("Unknown variable: "++showIdent x)
+    pick' i = return $ \ vs -> maybe (err i vs) ok (pick i vs)
+    err i vs = bug $ "Stack problem: "++showIdent x++": "
+                    ++unwords (map showIdent (local env))
+                    ++" => "++show (i,length vs)
+
+resource env (m,c) =
+  where e = fail $ "Not found: "++render m++"."++showIdent c
+
+extR t vv =
+      (VRecType rs1, VRecType rs2) ->
+          case intersect (map fst rs1) (map fst rs2) of
+            [] -> VRecType (rs1 ++ rs2)
+            ls -> error $ "clash"<+>show ls
+      (v1,v2) -> error $ "not records" $$ show v1 $$ show v2
+  where
+    error explain = ppbug $ "The term" <+> t
+                            <+> "is not reducible" $$ explain
+ 
+glue env (v1,v2) = glu v1 v2
+                                         ppL loc (hang "unsupported token gluing:" 4
+                                                        (Glue (vt v1) (vt v2)))
+
+strsFromValue :: Value -> Err [Str]
+  _ -> fail ("cannot get Str from value " ++ show t)
+
+match loc cs v = 
+  case value2term loc [] v of
+    Left i  -> bad ("variable #"++show i++" is out of scope")
+    Right t -> err bad return (matchPattern cs t)
+  where
+    bad = fail . ("In pattern matching: "++)
+
+    inlinePattMacro p =
+                        VPatt p' -> inlinePattMacro p'
+                        _ -> ppbug $ hang "Expected pattern macro:" 4
+
+linPattVars p =
+    if null dups
+    then return pvs
+    else fail.render $ hang "Pattern is not linear:" 4 (ppPatt Unqualified 0 p)
+
+---------------------------------------------
+Compile.Compute.Abstract.hs
+
+
+---------------------------------------------
+PGF.Linearize.hs
+
+bracketedLinearize :: PGF -> Language -> Tree -> [BracketedString]
+    cnc = lookMap (error "no lang") lang (concretes pgf)
+
+
+---------------------------------------------
+PGF.TypeCheck.hs
+
+ppTcError :: TcError -> Doc
+ppTcError (UnknownCat cat)             = text "Category" <+> ppCId cat <+> text "is not in scope"
+ppTcError (UnknownFun fun)             = text "Function" <+> ppCId fun <+> text "is not in scope"
+ppTcError (WrongCatArgs xs ty cat m n) = text "Category" <+> ppCId cat <+> text "should have" <+> int m <+> text "argument(s), but has been given" <+> int n $$
+                                         text "In the type:" <+> ppType 0 xs ty
+ppTcError (TypeMismatch xs e ty1 ty2)  = text "Couldn't match expected type" <+> ppType 0 xs ty1 $$
+                                         text "       against inferred type" <+> ppType 0 xs ty2 $$
+                                         text "In the expression:" <+> ppExpr 0 xs e
+ppTcError (NotFunType xs e ty)         = text "A function type is expected for the expression" <+> ppExpr 0 xs e <+> text "instead of type" <+> ppType 0 xs ty
+ppTcError (CannotInferType xs e)       = text "Cannot infer the type of expression" <+> ppExpr 0 xs e
+ppTcError (UnresolvedMetaVars xs e ms) = text "Meta variable(s)" <+> fsep (List.map ppMeta ms) <+> text "should be resolved" $$
+                                         text "in the expression:" <+> ppExpr 0 xs e
+ppTcError (UnexpectedImplArg xs e)     = braces (ppExpr 0 xs e) <+> text "is implicit argument but not implicit argument is expected here"
+ppTcError (UnsolvableGoal xs metaid ty)= text "The goal:" <+> ppMeta metaid <+> colon <+> ppType 0 xs ty $$
+                                         text "cannot be solved"
+

doc/gf-bib.bib

@@ -2707,3 +2707,43 @@ Book{GoldbergRubin95,
 }
 
 
+
+@InProceedings{bringert-angelov-ranta:2009:EACL-DEMOS,
+  author    = {Bringert, Bj\"{o}rn  and  Angelov, Krasimir  and  Ranta, Aarne},
+  title     = {Grammatical Framework Web Service},
+  booktitle = {Proceedings of the Demonstrations Session at EACL 2009},
+  month     = {April},
+  year      = 2009,
+  address   = {Athens, Greece},
+  publisher = {Association for Computational Linguistics},
+  pages     = {9--12},
+  url       = {http://www.aclweb.org/anthology-new/E09-2003},
+  annote = "An overview of how to build web services on top of PGF using the Google Web Toolkit."
+}
+
+@InProceedings{ranta-angelov-bringert:2009:EACL-DEMOS,
+  author    = {Ranta, Aarne  and  Angelov, Krasimir  and  Bringert, Bj\"{o}rn},
+  title     = {Grammar Development in {GF}},
+  booktitle = {Proceedings of the Demonstrations Session at EACL 2009},
+  month     = {April},
+  year      = 2009,
+  address   = {Athens, Greece},
+  publisher = {Association for Computational Linguistics},
+  pages     = {57--60},
+  url       = {http://www.aclweb.org/anthology/E09-2015},
+  annote    = "An overview of GF from the grammarian's point of view."
+}
+
+@InProceedings{ranta-angelov-hallgren:2010:Demos,
+  author    = {Ranta, Aarne  and  Angelov, Krasimir  and  Hallgren, Thomas},
+  title     = {Tools for Multilingual Grammar-Based Translation on the Web},
+  booktitle = {Proceedings of the ACL 2010 System Demonstrations},
+  month     = {July},
+  year      = 2010,
+  address   = {Uppsala, Sweden},
+  publisher = {Association for Computational Linguistics},
+  pages     = {66--71},
+  url       = {http://www.aclweb.org/anthology/P10-4012},
+  annote    = "An overview of GF for developers and users of translation systems."
+}
+