forked from GitHub/gf-core
241bef8a51
Introduced the function parallelCheck :: [Check a] -> Check [a] that runs independent checks in parallel, potentially allowing faster grammar compilation on multi-core computers, if you run gf with +RTS -N. However, on my dual core laptop, this seems to slow down compilation somewhat even though CPU utilization goes up as high as 170% at times. (This is with GF compiled with GHC 7.0.4.)
214 lines
4.7 KiB
Plaintext
214 lines
4.7 KiB
Plaintext
name: gf
|
|
version: 3.3.3-darcs
|
|
|
|
cabal-version: >= 1.8
|
|
build-type: Custom
|
|
license: OtherLicense
|
|
license-file: LICENSE
|
|
category: Natural Language Processing, Compiler
|
|
synopsis: Grammatical Framework
|
|
description: GF, Grammatical Framework, is a programming language for multilingual grammar applications
|
|
homepage: http://www.grammaticalframework.org/
|
|
bug-reports: http://code.google.com/p/grammatical-framework/issues/list
|
|
tested-with: GHC==6.12.3, GHC==7.0.4
|
|
|
|
data-dir: src
|
|
data-files: www/*.html
|
|
www/P/*.png
|
|
www/gfse/*.html
|
|
www/gfse/*.css
|
|
www/gfse/*.js
|
|
www/gfse/P/*.png
|
|
www/gfse/P/*.jpg
|
|
www/minibar/*.html
|
|
www/minibar/*.css
|
|
www/minibar/*.js
|
|
www/minibar/*.png
|
|
www/TransQuiz/*.html
|
|
www/TransQuiz/*.css
|
|
www/TransQuiz/*.js
|
|
www/TransQuiz/*.png
|
|
www/translator/*.html
|
|
www/translator/*.css
|
|
www/translator/*.js
|
|
|
|
source-repository head
|
|
type: darcs
|
|
location: http://www.grammaticalframework.org/
|
|
|
|
|
|
flag interrupt
|
|
Description: Enable Ctrl+Break in the shell
|
|
Default: True
|
|
|
|
flag server
|
|
Description: Include --server mode
|
|
Default: True
|
|
|
|
library
|
|
build-depends: base >= 4.2 && <5,
|
|
array,
|
|
fst,
|
|
containers,
|
|
bytestring,
|
|
random,
|
|
pretty,
|
|
mtl
|
|
--ghc-options: -O2
|
|
hs-source-dirs: src/compiler src/runtime/haskell
|
|
extensions:
|
|
exposed-modules:
|
|
PGF
|
|
other-modules:
|
|
PGF.CId
|
|
PGF.Data
|
|
PGF.Macros
|
|
PGF.Generate
|
|
PGF.Linearize
|
|
PGF.Parse
|
|
PGF.SortTop
|
|
PGF.Expr
|
|
PGF.Type
|
|
PGF.Tree
|
|
PGF.Tokenizer
|
|
PGF.Paraphrase
|
|
PGF.TypeCheck
|
|
PGF.Binary
|
|
PGF.Morphology
|
|
PGF.VisualizeTree
|
|
PGF.Printer
|
|
PGF.Probabilistic
|
|
PGF.Forest
|
|
PGF.Optimize
|
|
PGF.Signature
|
|
GF.Data.TrieMap
|
|
GF.Data.Utilities
|
|
GF.Data.SortedList
|
|
GF.Data.ErrM
|
|
GF.Data.Relation
|
|
GF.Data.Operations
|
|
-- not really part of GF but I have changed the original binary library
|
|
-- and we have to keep the copy for now.
|
|
Data.Binary
|
|
Data.Binary.Put
|
|
Data.Binary.Get
|
|
Data.Binary.Builder
|
|
Data.Binary.IEEE754
|
|
|
|
executable gf
|
|
build-depends: base >= 4.2,
|
|
array,
|
|
containers,
|
|
bytestring,
|
|
filepath,
|
|
fst,
|
|
directory,
|
|
random,
|
|
old-time,
|
|
process,
|
|
pretty,
|
|
mtl,
|
|
haskeline,
|
|
parallel
|
|
ghc-options: -threaded
|
|
if flag(server)
|
|
build-depends: httpd-shed, network, silently, utf8-string, json, cgi
|
|
cpp-options: -DSERVER_MODE
|
|
other-modules: GFServer
|
|
hs-source-dirs: src/server src/server/transfer src/example-based
|
|
|
|
build-tools: happy
|
|
--, alex>=2 && <3 -- tricky to install in Ubuntu 12.04
|
|
if os(windows)
|
|
build-depends: Win32
|
|
else
|
|
build-depends: unix
|
|
|
|
ghc-prof-options: -auto-all
|
|
|
|
--ghc-options: -O2
|
|
if impl(ghc>=7.0)
|
|
ghc-options: -rtsopts
|
|
hs-source-dirs: src/compiler src/runtime/haskell
|
|
extensions:
|
|
main-is: GF.hs
|
|
other-modules:
|
|
GF.Data.BacktrackM
|
|
GF.Data.TrieMap
|
|
GF.Data.Utilities
|
|
GF.Data.SortedList
|
|
GF.Data.ErrM
|
|
GF.Data.Operations
|
|
GF.Data.Str
|
|
GF.JavaScript.AbsJS
|
|
GF.JavaScript.PrintJS
|
|
GF.Infra.Ident
|
|
GF.Infra.GetOpt
|
|
GF.Infra.Option
|
|
GF.Infra.UseIO
|
|
GF.Infra.CheckM
|
|
GF.Command.Commands
|
|
GF.Command.Interpreter
|
|
GF.Command.Abstract
|
|
GF.Command.Parse
|
|
GF.Command.Importing
|
|
GF.Grammar
|
|
GF.Grammar.Lexer
|
|
GF.Grammar.Parser
|
|
GF.Grammar.Grammar
|
|
GF.Grammar.Values
|
|
GF.Grammar.Macros
|
|
GF.Grammar.Lockfield
|
|
GF.Grammar.MMacros
|
|
GF.Grammar.Lookup
|
|
GF.Grammar.Unify
|
|
GF.Grammar.PatternMatch
|
|
GF.Grammar.Printer
|
|
GF.Grammar.ShowTerm
|
|
GF.Grammar.Binary
|
|
GF.Compile.Update
|
|
GF.Compile.CheckGrammar
|
|
GF.Compile.Refresh
|
|
GF.Compile.Rename
|
|
GF.Compile.ReadFiles
|
|
GF.Compile.GrammarToPGF
|
|
GF.Compile.ToAPI
|
|
GF.Compile.TypeCheck.Abstract
|
|
GF.Compile.TypeCheck.Concrete
|
|
GF.Compile.TypeCheck.TC
|
|
GF.Compile.Compute.Abstract
|
|
GF.Compile.Compute.Concrete
|
|
GF.Compile.Compute.AppPredefined
|
|
GF.Compile.Optimize
|
|
GF.Compile.SubExOpt
|
|
GF.Compile.GetGrammar
|
|
GF.Compile.PGFtoHaskell
|
|
GF.Compile.PGFtoProlog
|
|
GF.Compile.PGFtoJS
|
|
GF.Compile
|
|
GF.Index
|
|
GF.Quiz
|
|
PGF
|
|
PGF.CId
|
|
PGF.Data
|
|
PGF.Expr
|
|
PGF.Type
|
|
PGF.Tree
|
|
PGF.Macros
|
|
PGF.Generate
|
|
PGF.Linearize
|
|
PGF.Binary
|
|
PGF.Paraphrase
|
|
PGF.TypeCheck
|
|
PGF.Binary
|
|
PGF.Printer
|
|
PGF.Optimize
|
|
GFC
|
|
GFI
|
|
|
|
if flag(interrupt)
|
|
cpp-options: -DUSE_INTERRUPT
|
|
other-modules: GF.System.UseSignal
|
|
else
|
|
other-modules: GF.System.NoSignal
|