reorganize the directories under src, and rescue the JavaScript interpreter from deprecated

1 files changed, 95 insertions, 0 deletions

diff --git a/src/runtime/haskell/PGF/Data.hs b/src/runtime/haskell/PGF/Data.hs
new file mode 100644
index 000000000..38027e96e
--- /dev/null
+++ b/src/runtime/haskell/PGF/Data.hs
@@ -0,0 +1,95 @@
+module PGF.Data (module PGF.Data, module PGF.Expr, module PGF.Type, module PGF.PMCFG) where
+
+import PGF.CId
+import PGF.Expr hiding (Value, Env, Tree)
+import PGF.Type
+import PGF.PMCFG
+
+import qualified Data.Map as Map
+import qualified Data.Set as Set
+import qualified Data.IntMap as IntMap
+import Data.List
+
+-- internal datatypes for PGF
+
+-- | An abstract data type representing multilingual grammar
+-- in Portable Grammar Format.
+data PGF = PGF {
+  absname   :: CId ,
+  cncnames  :: [CId] ,
+  gflags    :: Map.Map CId String,   -- value of a global flag
+  abstract  :: Abstr ,
+  concretes :: Map.Map CId Concr
+  }
+
+data Abstr = Abstr {
+  aflags  :: Map.Map CId String,      -- value of a flag
+  funs    :: Map.Map CId (Type,Int,[Equation]), -- type, arrity and definition of function
+  cats    :: Map.Map CId [Hypo],      -- context of a cat
+  catfuns :: Map.Map CId [CId]        -- funs to a cat (redundant, for fast lookup)
+  }
+
+data Concr = Concr {
+  cflags  :: Map.Map CId String,    -- value of a flag
+  lins    :: Map.Map CId Term,      -- lin of a fun
+  opers   :: Map.Map CId Term,      -- oper generated by subex elim
+  lincats :: Map.Map CId Term,      -- lin type of a cat
+  lindefs :: Map.Map CId Term,      -- lin default of a cat
+  printnames :: Map.Map CId Term,   -- printname of a cat or a fun
+  paramlincats :: Map.Map CId Term, -- lin type of cat, with printable param names
+  parser  :: Maybe ParserInfo       -- parser
+  }
+
+data Term =
+   R [Term]
+ | P Term Term
+ | S [Term]
+ | K Tokn
+ | V Int
+ | C Int
+ | F CId
+ | FV [Term]
+ | W String Term
+ | TM String
+  deriving (Eq,Ord,Show)
+
+data Tokn =
+   KS String
+ | KP [String] [Alternative]
+  deriving (Eq,Ord,Show)
+
+
+-- merge two GFCCs; fails is differens absnames; priority to second arg
+
+unionPGF :: PGF -> PGF -> PGF
+unionPGF one two = case absname one of
+  n | n == wildCId     -> two    -- extending empty grammar
+    | n == absname two -> one {  -- extending grammar with same abstract
+      concretes = Map.union (concretes two) (concretes one),
+      cncnames  = union (cncnames one) (cncnames two)
+    }
+  _ -> one   -- abstracts don't match ---- print error msg
+
+emptyPGF :: PGF
+emptyPGF = PGF {
+  absname   = wildCId,
+  cncnames  = [] ,
+  gflags    = Map.empty,
+  abstract  = error "empty grammar, no abstract",
+  concretes = Map.empty
+  }
+
+-- | This is just a 'CId' with the language name.
+-- A language name is the identifier that you write in the 
+-- top concrete or abstract module in GF after the 
+-- concrete/abstract keyword. Example:
+-- 
+-- > abstract Lang = ...
+-- > concrete LangEng of Lang = ...
+type Language     = CId
+
+readLanguage :: String -> Maybe Language
+readLanguage = readCId
+
+showLanguage :: Language -> String
+showLanguage = showCId