diff options
Diffstat (limited to 'src/GF')
| -rw-r--r-- | src/GF/Devel/GFC.hs | 10 | ||||
| -rw-r--r-- | src/GF/Devel/GrammarToGFCC.hs | 50 | ||||
| -rw-r--r-- | src/GF/Devel/OptimizeGFCC.hs | 105 | ||||
| -rw-r--r-- | src/GF/Devel/Shell.hs | 67 | ||||
| -rw-r--r-- | src/GF/GFCC/API.hs | 129 | ||||
| -rw-r--r-- | src/GF/GFCC/AbsGFCC.hs | 83 | ||||
| -rw-r--r-- | src/GF/GFCC/CheckGFCC.hs | 162 | ||||
| -rw-r--r-- | src/GF/GFCC/ComposOp.hs | 30 | ||||
| -rw-r--r-- | src/GF/GFCC/DataGFCC.hs | 195 | ||||
| -rw-r--r-- | src/GF/GFCC/ErrM.hs | 26 | ||||
| -rw-r--r-- | src/GF/GFCC/GFCC.cf (renamed from src/GF/Devel/GFCC/GFCC.cf) | 46 | ||||
| -rw-r--r-- | src/GF/GFCC/Generate.hs | 79 | ||||
| -rw-r--r-- | src/GF/GFCC/LexGFCC.hs | 340 | ||||
| -rw-r--r-- | src/GF/GFCC/ParGFCC.hs | 1300 | ||||
| -rw-r--r-- | src/GF/GFCC/PrintGFCC.hs | 217 | ||||
| -rw-r--r-- | src/GF/GFCC/SkelGFCC.hs | 110 | ||||
| -rw-r--r-- | src/GF/GFCC/TestGFCC.hs | 58 |
17 files changed, 2906 insertions, 101 deletions
diff --git a/src/GF/Devel/GFC.hs b/src/GF/Devel/GFC.hs index 8b694c3dc..eb3046b18 100644 --- a/src/GF/Devel/GFC.hs +++ b/src/GF/Devel/GFC.hs @@ -3,16 +3,13 @@ module Main where import GF.Devel.Compile import GF.Devel.GrammarToGFCC import GF.Devel.OptimizeGFCC -import GF.Canon.GFCC.CheckGFCC -import GF.Canon.GFCC.PrintGFCC -import GF.Canon.GFCC.DataGFCC +import GF.GFCC.CheckGFCC +import GF.GFCC.DataGFCC import GF.Devel.UseIO import GF.Infra.Option ----import GF.Devel.PrGrammar --- import System - main = do xx <- getArgs let (opts,fs) = getOptions "-" xx @@ -31,8 +28,7 @@ main = do mapM_ (batchCompile opts) (map return fs) putStrLn "Done." -check gc0 = do - let gfcc = mkGFCC gc0 +check gfcc = do (gc,b) <- checkGFCC gfcc putStrLn $ if b then "OK" else "Corrupted GFCC" return gc diff --git a/src/GF/Devel/GrammarToGFCC.hs b/src/GF/Devel/GrammarToGFCC.hs index 0b226acf2..b10cab877 100644 --- a/src/GF/Devel/GrammarToGFCC.hs +++ b/src/GF/Devel/GrammarToGFCC.hs @@ -3,8 +3,8 @@ module GF.Devel.GrammarToGFCC (prGrammar2gfcc,mkCanon2gfcc) where import GF.Grammar.Grammar import qualified GF.Grammar.Lookup as Look -import qualified GF.Canon.GFCC.AbsGFCC as C -import qualified GF.Canon.GFCC.PrintGFCC as Pr +import qualified GF.GFCC.AbsGFCC as C +import qualified GF.GFCC.DataGFCC as D import qualified GF.Grammar.Abstract as A import qualified GF.Grammar.Macros as GM import qualified GF.Grammar.Compute as Compute @@ -26,10 +26,10 @@ import Debug.Trace ---- -- the main function: generate GFCC from GF. prGrammar2gfcc :: Options -> String -> SourceGrammar -> (String,String) -prGrammar2gfcc opts cnc gr = (abs, Pr.printTree gc) where +prGrammar2gfcc opts cnc gr = (abs, D.printGFCC gc) where (abs,gc) = mkCanon2gfcc opts cnc gr -mkCanon2gfcc :: Options -> String -> SourceGrammar -> (String,C.Grammar) +mkCanon2gfcc :: Options -> String -> SourceGrammar -> (String,D.GFCC) mkCanon2gfcc opts cnc gr = (prIdent abs, (canon2gfcc opts . reorder abs . utf8Conv . canon2canon abs) gr) where @@ -38,27 +38,39 @@ mkCanon2gfcc opts cnc gr = -- Generate GFCC from GFCM. -- this assumes a grammar translated by canon2canon -canon2gfcc :: Options -> SourceGrammar -> C.Grammar +canon2gfcc :: Options -> SourceGrammar -> D.GFCC canon2gfcc opts cgr@(M.MGrammar ((a,M.ModMod abm):cms)) = (if (oElem (iOpt "show_canon") opts) then trace (prGrammar cgr) else id) $ - C.Grm (C.Hdr (i2i a) cs) (C.Abs adefs) cncs + D.GFCC an cns abs cncs where - cs = map (i2i . fst) cms - adefs = [C.Fun f' (mkType ty) (C.Tr (C.AC f') []) | - (f,AbsFun (Yes ty) _) <- tree2list (M.jments abm), let f' = i2i f] - cncs = [C.Cnc (i2i lang) (concr m) | (lang,M.ModMod m) <- cms] - concr mo = cats mo ++ lindefs mo ++ - [C.Lin (i2i f) (mkTerm tr) | - (f,CncFun _ (Yes tr) _) <- tree2list (M.jments mo)] - cats mo = [C.Lin (i2ic c) (mkCType ty) | - (c,CncCat (Yes ty) _ _) <- tree2list (M.jments mo)] - lindefs mo = [C.Lin (i2id c) (mkTerm tr) | - (c,CncCat _ (Yes tr) _) <- tree2list (M.jments mo)] + an = (i2i a) + cns = map (i2i . fst) cms + abs = D.Abstr aflags funs cats catfuns + aflags = Map.fromAscList [] ---- flags + lfuns = [(f', (mkType ty,C.Tr (C.AC f') [])) | ---- defs + (f,AbsFun (Yes ty) _) <- tree2list (M.jments abm), let f' = i2i f] + funs = Map.fromAscList lfuns + lcats = [(i2i c,[]) | ---- context + (c,AbsCat _ _) <- tree2list (M.jments abm)] + cats = Map.fromAscList lcats + catfuns = Map.fromAscList + [(cat,[f | (f, (C.Typ _ c,_)) <- lfuns, c==cat]) | (cat,_) <- lcats] + + cncs = Map.fromList [mkConcr (i2i lang) mo | (lang,M.ModMod mo) <- cms] + mkConcr lang mo = (lang,D.Concr flags lins opers lincats lindefs printnames) + where + flags = Map.fromAscList [] ---- flags + opers = Map.fromAscList [] -- opers will be created as optimization + lins = Map.fromAscList + [(i2i f, mkTerm tr) | (f,CncFun _ (Yes tr) _) <- tree2list (M.jments mo)] + lincats = Map.fromAscList + [(i2i c, mkCType ty) | (c,CncCat (Yes ty) _ _) <- tree2list (M.jments mo)] + lindefs = Map.fromAscList + [(i2i c, mkTerm tr) | (c,CncCat _ (Yes tr) _) <- tree2list (M.jments mo)] + printnames = Map.fromAscList [] ---- printnames i2i :: Ident -> C.CId i2i (IC c) = C.CId c -i2ic (IC c) = C.CId ("__" ++ c) -- for lincat of category symbols -i2id (IC c) = C.CId ("_d" ++ c) -- for lindef of category symbols mkType :: A.Type -> C.Type mkType t = case GM.catSkeleton t of diff --git a/src/GF/Devel/OptimizeGFCC.hs b/src/GF/Devel/OptimizeGFCC.hs index 27f510828..78d03911f 100644 --- a/src/GF/Devel/OptimizeGFCC.hs +++ b/src/GF/Devel/OptimizeGFCC.hs @@ -1,41 +1,36 @@ module GF.Devel.OptimizeGFCC where -import qualified GF.Canon.GFCC.AbsGFCC as C -import qualified GF.Canon.GFCC.DataGFCC as D -import qualified GF.Canon.GFCC.PrintGFCC as Pr +import GF.GFCC.AbsGFCC +import GF.GFCC.DataGFCC -import qualified GF.Infra.Option as O - -import GF.Infra.Option import GF.Data.Operations import Data.List -import Data.Char (isDigit) import qualified Data.Map as Map -import Debug.Trace ---- -- back-end optimization: -- suffix analysis followed by common subexpression elimination -optGFCC :: D.GFCC -> D.GFCC +optGFCC :: GFCC -> GFCC optGFCC gfcc = gfcc { - D.concretes = - Map.fromAscList - [(lang, (opt cnc)) | (lang,cnc) <- Map.assocs (D.concretes gfcc)] + concretes = Map.map opt (concretes gfcc) } where - opt cnc = Map.fromAscList $ subex [(f,optTerm t) | (f,t) <- Map.assocs cnc] + opt cnc = subex $ cnc { + lins = Map.map optTerm (lins cnc), + lindefs = Map.map optTerm (lindefs cnc), + printnames = Map.map optTerm (printnames cnc) + } -- analyse word form lists into prefix + suffixes -- suffix sets can later be shared by subex elim -optTerm :: C.Term -> C.Term +optTerm :: Term -> Term optTerm tr = case tr of - C.R ts@(_:_:_) | all isK ts -> mkSuff $ optToks [s | C.K (C.KS s) <- ts] - C.R ts -> C.R $ map optTerm ts - C.P t v -> C.P (optTerm t) v - C.L x t -> C.L x (optTerm t) + R ts@(_:_:_) | all isK ts -> mkSuff $ optToks [s | K (KS s) <- ts] + R ts -> R $ map optTerm ts + P t v -> P (optTerm t) v _ -> tr where optToks ss = prf : suffs where @@ -45,67 +40,67 @@ optTerm tr = case tr of s1:ss2 -> if isPrefixOf cand s1 then pref cand ss2 else pref (init cand) ss _ -> cand isK t = case t of - C.K (C.KS _) -> True + K (KS _) -> True _ -> False - mkSuff ("":ws) = C.R (map (C.K . C.KS) ws) - mkSuff (p:ws) = C.W p (C.R (map (C.K . C.KS) ws)) + mkSuff ("":ws) = R (map (K . KS) ws) + mkSuff (p:ws) = W p (R (map (K . KS) ws)) --- common subexpression elimination; see ./Subexpression.hs for the idea +-- common subexpression elimination -subex :: [(C.CId,C.Term)] -> [(C.CId,C.Term)] -subex js = errVal js $ do - (tree,_) <- appSTM (getSubtermsMod js) (Map.empty,0) - return $ addSubexpConsts tree js +---subex :: [(CId,Term)] -> [(CId,Term)] +subex :: Concr -> Concr +subex cnc = errVal cnc $ do + (tree,_) <- appSTM (getSubtermsMod cnc) (Map.empty,0) + return $ addSubexpConsts tree cnc -type TermList = Map.Map C.Term (Int,Int) -- number of occs, id +type TermList = Map.Map Term (Int,Int) -- number of occs, id type TermM a = STM (TermList,Int) a -addSubexpConsts :: TermList -> [(C.CId,C.Term)] -> [(C.CId,C.Term)] -addSubexpConsts tree lins = - let opers = sortBy (\ (f,_) (g,_) -> compare f g) - [(fid id, trm) | (trm,(_,id)) <- list] - in map mkOne $ opers ++ lins +addSubexpConsts :: TermList -> Concr -> Concr +addSubexpConsts tree cnc = cnc { + opers = Map.fromList [(f,recomp f trm) | (f,trm) <- ops], + lins = rec lins, + lindefs = rec lindefs, + printnames = rec printnames + } where + ops = [(fid id, trm) | (trm,(_,id)) <- Map.assocs tree] mkOne (f,trm) = (f, recomp f trm) recomp f t = case Map.lookup t tree of - Just (_,id) | fid id /= f -> C.F $ fid id -- not to replace oper itself + Just (_,id) | fid id /= f -> F $ fid id -- not to replace oper itself _ -> case t of - C.R ts -> C.R $ map (recomp f) ts - C.S ts -> C.S $ map (recomp f) ts - C.W s t -> C.W s (recomp f t) - C.P t p -> C.P (recomp f t) (recomp f p) - C.RP t p -> C.RP (recomp f t) (recomp f p) - C.L x t -> C.L x (recomp f t) + R ts -> R $ map (recomp f) ts + S ts -> S $ map (recomp f) ts + W s t -> W s (recomp f t) + P t p -> P (recomp f t) (recomp f p) _ -> t - fid n = C.CId $ "_" ++ show n - list = Map.toList tree + fid n = CId $ "_" ++ show n + rec field = Map.fromAscList [(f,recomp f trm) | (f,trm) <- Map.assocs (field cnc)] -getSubtermsMod :: [(C.CId,C.Term)] -> TermM TermList -getSubtermsMod js = do - mapM (getInfo collectSubterms) js + +getSubtermsMod :: Concr -> TermM TermList +getSubtermsMod cnc = do + mapM getSubterms (Map.assocs (lins cnc)) + mapM getSubterms (Map.assocs (lindefs cnc)) + mapM getSubterms (Map.assocs (printnames cnc)) (tree0,_) <- readSTM return $ Map.filter (\ (nu,_) -> nu > 1) tree0 where - getInfo get (f,trm) = do - get trm - return () + getSubterms (f,trm) = collectSubterms trm >> return () -collectSubterms :: C.Term -> TermM () +collectSubterms :: Term -> TermM () collectSubterms t = case t of - C.R ts -> do + R ts -> do mapM collectSubterms ts add t - C.RP u v -> do - collectSubterms v - add t - C.S ts -> do + S ts -> do mapM collectSubterms ts add t - C.W s u -> do + W s u -> do collectSubterms u add t - C.P p u -> do + P p u -> do collectSubterms p collectSubterms u add t diff --git a/src/GF/Devel/Shell.hs b/src/GF/Devel/Shell.hs new file mode 100644 index 000000000..81569b8d1 --- /dev/null +++ b/src/GF/Devel/Shell.hs @@ -0,0 +1,67 @@ +module Main where + +import GF.GFCC.API +import System.Random (newStdGen) +import System (getArgs) +import Data.Char (isDigit) + +-- Simple translation application built on GFCC. AR 7/9/2006 -- 19/9/2007 + +main :: IO () +main = do + file:_ <- getArgs + grammar <- file2grammar file + printHelp grammar + loop grammar + +loop :: MultiGrammar -> IO () +loop grammar = do + s <- getLine + if s == "q" then return () else do + treat grammar s + loop grammar + +printHelp grammar = do + putStrLn $ "languages: " ++ unwords (languages grammar) + putStrLn $ "categories: " ++ unwords (categories grammar) + putStrLn commands + + +commands = unlines [ + "Commands:", + " (gt | gtt | gr | grt) Cat Num - generate all or random", + " p Lang Cat String - parse (unquoted) string", + " l Tree - linearize in all languages", + " h - help", + " q - quit" + ] + +treat :: MultiGrammar -> String -> IO () +treat mgr s = case words s of + "gt" :cat:n:_ -> mapM_ prlinonly $ take (read1 n) $ generateAll mgr cat + "gtt":cat:n:_ -> mapM_ prlin $ take (read1 n) $ generateAll mgr cat + "gr" :cat:n:_ -> generateRandom mgr cat >>= mapM_ prlinonly . take (read1 n) + "grt":cat:n:_ -> generateRandom mgr cat >>= mapM_ prlin . take (read1 n) + "p":lang:cat:ws -> do + let ts = parse mgr lang cat $ unwords ws + mapM_ (putStrLn . showTree) ts + "h":_ -> printHelp mgr + _ -> lins $ readTree mgr s + where + grammar = gfcc mgr + langs = languages mgr + lins t = mapM_ (lint t) $ langs + lint t lang = do +---- putStrLn $ showTree $ linExp grammar lang t + lin t lang + lin t lang = do + putStrLn $ linearize mgr lang t + prlins t = do + putStrLn $ showTree t + lins t + prlin t = do + putStrLn $ showTree t + prlinonly t + prlinonly t = mapM_ (lin t) $ langs + read1 s = if all isDigit s then read s else 1 + diff --git a/src/GF/GFCC/API.hs b/src/GF/GFCC/API.hs new file mode 100644 index 000000000..043c429f2 --- /dev/null +++ b/src/GF/GFCC/API.hs @@ -0,0 +1,129 @@ +---------------------------------------------------------------------- +-- | +-- Module : GFCCAPI +-- Maintainer : Aarne Ranta +-- Stability : (stable) +-- Portability : (portable) +-- +-- > CVS $Date: +-- > CVS $Author: +-- > CVS $Revision: +-- +-- Reduced Application Programmer's Interface to GF, meant for +-- embedded GF systems. AR 19/9/2007 +----------------------------------------------------------------------------- + +module GF.GFCC.API where + +import GF.GFCC.DataGFCC +import GF.GFCC.AbsGFCC +import GF.GFCC.ParGFCC +import GF.GFCC.PrintGFCC +import GF.GFCC.ErrM +import GF.GFCC.Generate +----import GF.Parsing.FCFG +----import GF.Conversion.SimpleToFCFG (convertGrammar,FCat(..)) + +--import GF.Data.Operations +--import GF.Infra.UseIO +import qualified Data.Map as Map +import System.Random (newStdGen) +import System.Directory (doesFileExist) + + +-- This API is meant to be used when embedding GF grammars in Haskell +-- programs. The embedded system is supposed to use the +-- .gfcm grammar format, which is first produced by the gf program. + +--------------------------------------------------- +-- Interface +--------------------------------------------------- + +----data MultiGrammar = MultiGrammar {gfcc :: GFCC, parsers :: [(Language,FCFPInfo)]} +data MultiGrammar = MultiGrammar {gfcc :: GFCC, parsers :: [(Language,())]} +type Language = String +type Category = String +type Tree = Exp + +file2grammar :: FilePath -> IO MultiGrammar + +linearize :: MultiGrammar -> Language -> Tree -> String +parse :: MultiGrammar -> Language -> Category -> String -> [Tree] + +linearizeAll :: MultiGrammar -> Tree -> [String] +linearizeAllLang :: MultiGrammar -> Tree -> [(Language,String)] + +parseAll :: MultiGrammar -> Category -> String -> [[Tree]] +parseAllLang :: MultiGrammar -> Category -> String -> [(Language,[Tree])] + +generateAll :: MultiGrammar -> Category -> [Tree] +generateRandom :: MultiGrammar -> Category -> IO [Tree] + +readTree :: MultiGrammar -> String -> Tree +showTree :: Tree -> String + +languages :: MultiGrammar -> [Language] +categories :: MultiGrammar -> [Category] + +startCat :: MultiGrammar -> Category + +--------------------------------------------------- +-- Implementation +--------------------------------------------------- + +file2grammar f = do + gfcc <- file2gfcc f +---- let fcfgs = convertGrammar gfcc +---- return (MultiGrammar gfcc [(lang, buildFCFPInfo fcfg) | (CId lang,fcfg) <- fcfgs]) + return (MultiGrammar gfcc []) + +file2gfcc f = + readFileIf f >>= err (error) (return . mkGFCC) . pGrammar . myLexer + +linearize mgr lang = GF.GFCC.DataGFCC.linearize (gfcc mgr) (CId lang) + +parse mgr lang cat s = error "no parser" +----parse mgr lang cat s = +---- case lookup lang (parsers mgr) of +---- Nothing -> error "no parser" +---- Just pinfo -> case parseFCF "bottomup" pinfo (CId cat) (words s) of +---- Ok x -> x +---- Bad s -> error s + +linearizeAll mgr = map snd . linearizeAllLang mgr +linearizeAllLang mgr t = + [(lang,linearThis mgr lang t) | lang <- languages mgr] + +parseAll mgr cat = map snd . parseAllLang mgr cat + +parseAllLang mgr cat s = + [(lang,ts) | lang <- languages mgr, let ts = parse mgr lang cat s, not (null ts)] + +generateRandom mgr cat = do + gen <- newStdGen + return $ genRandom gen (gfcc mgr) (CId cat) + +generateAll mgr cat = generate (gfcc mgr) (CId cat) + +readTree _ = err (const exp0) id . (pExp . myLexer) + +showTree t = printTree t + +languages mgr = [l | CId l <- cncnames (gfcc mgr)] + +categories mgr = [c | CId c <- Map.keys (cats (abstract (gfcc mgr)))] + +startCat mgr = "S" ---- + +------------ for internal use only + +linearThis = GF.GFCC.API.linearize + +err f g ex = case ex of + Ok x -> g x + Bad s -> f s + +readFileIf f = do + b <- doesFileExist f + if b then readFile f + else putStrLn ("file " ++ f ++ " not found") >> return "" diff --git a/src/GF/GFCC/AbsGFCC.hs b/src/GF/GFCC/AbsGFCC.hs new file mode 100644 index 000000000..b41f66d6f --- /dev/null +++ b/src/GF/GFCC/AbsGFCC.hs @@ -0,0 +1,83 @@ +module GF.GFCC.AbsGFCC where + +-- Haskell module generated by the BNF converter + +newtype CId = CId String deriving (Eq,Ord,Show) +data Grammar = + Grm CId [CId] Abstract [Concrete] + deriving (Eq,Ord,Show) + +data Abstract = + Abs [Flag] [FunDef] [CatDef] + deriving (Eq,Ord,Show) + +data Concrete = + Cnc CId [Flag] [LinDef] [LinDef] [LinDef] [LinDef] [LinDef] + deriving (Eq,Ord,Show) + +data Flag = + Flg CId String + deriving (Eq,Ord,Show) + +data CatDef = + Cat CId [Hypo] + deriving (Eq,Ord,Show) + +data FunDef = + Fun CId Type Exp + deriving (Eq,Ord,Show) + +data LinDef = + Lin CId Term + deriving (Eq,Ord,Show) + +data Type = + Typ [CId] CId + | DTyp [Hypo] CId [Exp] + deriving (Eq,Ord,Show) + +data Exp = + Tr Atom [Exp] + | DTr [CId] Atom [Exp] + | EEq [Equation] + deriving (Eq,Ord,Show) + +data Atom = + AC CId + | AS String + | AI Integer + | AF Double + | AM Integer + | AV CId + deriving (Eq,Ord,Show) + +data Term = + R [Term] + | P Term Term + | S [Term] + | K Tokn + | V Int --H + | C Int --H + | F CId + | FV [Term] + | W String Term + | TM + deriving (Eq,Ord,Show) + +data Tokn = + KS String + | KP [String] [Variant] + deriving (Eq,Ord,Show) + +data Variant = + Var [String] [String] + deriving (Eq,Ord,Show) + +data Hypo = + Hyp CId Type + deriving (Eq,Ord,Show) + +data Equation = + Equ [Exp] Exp + deriving (Eq,Ord,Show) + diff --git a/src/GF/GFCC/CheckGFCC.hs b/src/GF/GFCC/CheckGFCC.hs new file mode 100644 index 000000000..860a90212 --- /dev/null +++ b/src/GF/GFCC/CheckGFCC.hs @@ -0,0 +1,162 @@ +module GF.GFCC.CheckGFCC where + +import GF.GFCC.DataGFCC +import GF.GFCC.AbsGFCC +import GF.GFCC.PrintGFCC +import GF.GFCC.ErrM + +import qualified Data.Map as Map +import Control.Monad + +andMapM :: Monad m => (a -> m Bool) -> [a] -> m Bool +andMapM f xs = mapM f xs >>= return . and + +labelBoolIO :: String -> IO (x,Bool) -> IO (x,Bool) +labelBoolIO msg iob = do + (x,b) <- iob + if b then return (x,b) else (putStrLn msg >> return (x,b)) + +checkGFCC :: GFCC -> IO (GFCC,Bool) +checkGFCC gfcc = do + (cs,bs) <- mapM (checkConcrete gfcc) + (Map.assocs (concretes gfcc)) >>= return . unzip + return (gfcc {concretes = Map.fromAscList cs}, and bs) + +checkConcrete :: GFCC -> (CId,Concr) -> IO ((CId,Concr),Bool) +checkConcrete gfcc (lang,cnc) = + labelBoolIO ("happened in language " ++ printTree lang) $ do + (rs,bs) <- mapM checkl (Map.assocs (lins cnc)) >>= return . unzip + return ((lang,cnc{lins = Map.fromAscList rs}),and bs) + where + checkl = checkLin gfcc lang + +checkLin :: GFCC -> CId -> (CId,Term) -> IO ((CId,Term),Bool) +checkLin gfcc lang (f,t) = + labelBoolIO ("happened in function " ++ printTree f) $ do + (t',b) <- checkTerm (lintype gfcc lang f) t --- $ inline gfcc lang t + return ((f,t'),b) + +inferTerm :: [Tpe] -> Term -> Err (Term,Tpe) +inferTerm args trm = case trm of + K _ -> returnt str + C i -> returnt $ ints i + V i -> do + testErr (i < length args) ("too large index " ++ show i) + returnt $ args !! i + S ts -> do + (ts',tys) <- mapM infer ts >>= return . unzip + let tys' = filter (/=str) tys + testErr (null tys') + ("expected Str in " ++ prt trm ++ " not " ++ unwords (map prt tys')) + return (S ts',str) + R ts -> do + (ts',tys) <- mapM infer ts >>= return . unzip + return $ (R ts',tuple tys) + P t u -> do + (t',tt) <- infer t + (u',tu) <- infer u + case tt of + R tys -> case tu of + R vs -> infer $ foldl P t' [P u' (C i) | i <- [0 .. length vs - 1]] + --- R [v] -> infer $ P t v + --- R (v:vs) -> infer $ P (head tys) (R vs) + + C i -> do + testErr (i < length tys) + ("required more than " ++ show i ++ " fields in " ++ prt (R tys)) + return (P t' u', tys !! i) -- record: index must be known + _ -> do + let typ = head tys + testErr (all (==typ) tys) ("different types in table " ++ prt trm) + return (P t' u', typ) -- table: types must be same + _ -> Bad $ "projection from " ++ prt t ++ " : " ++ prt tt + FV [] -> returnt str ---- + FV (t:ts) -> do + (t',ty) <- infer t + (ts',tys) <- mapM infer ts >>= return . unzip + testErr (all (==ty) tys) ("different types in variants " ++ prt trm) + return (FV (t':ts'),ty) + W s r -> infer r + _ -> Bad ("no type inference for " ++ prt trm) + where + returnt ty = return (trm,ty) + infer = inferTerm args + prt = printTree + +checkTerm :: LinType -> Term -> IO (Term,Bool) +checkTerm (args,val) trm = case inferTerm args trm of + Ok (t,ty) -> if eqType ty val + then return (t,True) + else do + putStrLn $ "term: " ++ printTree trm ++ + "\nexpected type: " ++ printTree val ++ + "\ninferred type: " ++ printTree ty + return (t,False) + Bad s -> do + putStrLn s + return (trm,False) + +eqType :: Tpe -> Tpe -> Bool +eqType inf exp = case (inf,exp) of + (C k, C n) -> k <= n -- only run-time corr. + (R rs,R ts) -> length rs == length ts && and [eqType r t | (r,t) <- zip rs ts] + _ -> inf == exp + +-- should be in a generic module, but not in the run-time DataGFCC + +type Tpe = Term +type LinType = ([Tpe],Tpe) + +tuple :: [Tpe] -> Tpe +tuple = R + +ints :: Int -> Tpe +ints = C + +str :: Tpe +str = S [] + +lintype :: GFCC -> CId -> CId -> LinType +lintype gfcc lang fun = case lookType gfcc fun of + Typ cs c -> (map linc cs, linc c) + where + linc = lookLincat gfcc lang + +inline :: GFCC -> CId -> Term -> Term +inline gfcc lang t = case t of + F c -> inl $ look c + _ -> composSafeOp inl t + where + inl = inline gfcc lang + look = lookLin gfcc lang + +composOp :: Monad m => (Term -> m Term) -> Term -> m Term +composOp f trm = case trm of + R ts -> liftM R $ mapM f ts + S ts -> liftM S $ mapM f ts + FV ts -> liftM FV $ mapM f ts + P t u -> liftM2 P (f t) (f u) + W s t -> liftM (W s) $ f t + _ -> return trm + +composSafeOp :: (Term -> Term) -> Term -> Term +composSafeOp f = maybe undefined id . composOp (return . f) + +-- from GF.Data.Oper + +maybeErr :: String -> Maybe a -> Err a +maybeErr s = maybe (Bad s) Ok + +testErr :: Bool -> String -> Err () +testErr cond msg = if cond then return () else Bad msg + +errVal :: a -> Err a -> a +errVal a = err (const a) id + +errIn :: String -> Err a -> Err a +errIn msg = err (\s -> Bad (s ++ "\nOCCURRED IN\n" ++ msg)) return + +err :: (String -> b) -> (a -> b) -> Err a -> b +err d f e = case e of + Ok a -> f a + Bad s -> d s diff --git a/src/GF/GFCC/ComposOp.hs b/src/GF/GFCC/ComposOp.hs new file mode 100644 index 000000000..de2522bc7 --- /dev/null +++ b/src/GF/GFCC/ComposOp.hs @@ -0,0 +1,30 @@ +{-# OPTIONS_GHC -fglasgow-exts #-} +module GF.GFCC.ComposOp (Compos(..),composOp,composOpM,composOpM_,composOpMonoid, + composOpMPlus,composOpFold) where + +import Control.Monad.Identity +import Data.Monoid + +class Compos t where + compos :: (forall a. a -> m a) -> (forall a b. m (a -> b) -> m a -> m b) + -> (forall a. t a -> m (t a)) -> t c -> m (t c) + +composOp :: Compos t => (forall a. t a -> t a) -> t c -> t c +composOp f = runIdentity . composOpM (Identity . f) + +composOpM :: (Compos t, Monad m) => (forall a. t a -> m (t a)) -> t c -> m (t c) +composOpM = compos return ap + +composOpM_ :: (Compos t, Monad m) => (forall a. t a -> m ()) -> t c -> m () +composOpM_ = composOpFold (return ()) (>>) + +composOpMonoid :: (Compos t, Monoid m) => (forall a. t a -> m) -> t c -> m +composOpMonoid = composOpFold mempty mappend + +composOpMPlus :: (Compos t, MonadPlus m) => (forall a. t a -> m b) -> t c -> m b +composOpMPlus = composOpFold mzero mplus + +composOpFold :: Compos t => b -> (b -> b -> b) -> (forall a. t a -> b) -> t c -> b +composOpFold z c f = unC . compos (\_ -> C z) (\(C x) (C y) -> C (c x y)) (C . f) + +newtype C b a = C { unC :: b } diff --git a/src/GF/GFCC/DataGFCC.hs b/src/GF/GFCC/DataGFCC.hs new file mode 100644 index 000000000..f0714c97a --- /dev/null +++ b/src/GF/GFCC/DataGFCC.hs @@ -0,0 +1,195 @@ +module GF.GFCC.DataGFCC where + +import GF.GFCC.AbsGFCC +import GF.GFCC.PrintGFCC +import Data.Map +import Data.List + +-- internal datatypes for GFCC + +data GFCC = GFCC { + absname :: CId , + cncnames :: [CId] , + abstract :: Abstr , + concretes :: Map CId Concr + } + +data Abstr = Abstr { + aflags :: Map CId String, -- value of a flag + funs :: Map CId (Type,Exp), -- type and def of a fun + cats :: Map CId [Hypo], -- context of a cat + catfuns :: Map CId [CId] -- funs yielding a cat (redundant, for fast lookup) + } + +data Concr = Concr { + flags :: Map CId String, -- value of a flag + lins :: Map CId Term, -- lin of a fun + opers :: Map CId Term, -- oper generated by subex elim + lincats :: Map CId Term, -- lin type of a cat + lindefs :: Map CId Term, -- lin default of a cat + printnames :: Map CId Term -- printname of a cat or a fun + } + +statGFCC :: GFCC -> String +statGFCC gfcc = unlines [ + "Abstract\t" ++ pr (absname gfcc), + "Concretes\t" ++ unwords (lmap pr (cncnames gfcc)), + "Categories\t" ++ unwords (lmap pr (keys (cats (abstract gfcc)))) + ] + where pr (CId s) = s + +lookLin :: GFCC -> CId -> CId -> Term +lookLin gfcc lang fun = + lookMap TM fun $ lins $ lookMap (error "no lang") lang $ concretes gfcc + +lookOper :: GFCC -> CId -> CId -> Term +lookOper gfcc lang fun = + lookMap TM fun $ opers $ lookMap (error "no lang") lang $ concretes gfcc + +lookLincat :: GFCC -> CId -> CId -> Term +lookLincat gfcc lang fun = + lookMap TM fun $ lincats $ lookMap (error "no lang") lang $ concretes gfcc + +-- | Look up the type of a function. +lookType :: GFCC -> CId -> Type +lookType gfcc f = + fst $ lookMap (error $ "lookType " ++ show f) f (funs (abstract gfcc)) + +linearize :: GFCC -> CId -> Exp -> String +linearize mcfg lang = realize . linExp mcfg lang + +realize :: Term -> String +realize trm = case trm of + R ts -> realize (ts !! 0) + S ss -> unwords $ lmap realize ss + K t -> case t of + KS s -> s + KP s _ -> unwords s ---- prefix choice TODO + W s t -> s ++ realize t + FV ts -> realize (ts !! 0) ---- other variants TODO + TM -> "?" + _ -> "ERROR " ++ show trm ---- debug + +linExp :: GFCC -> CId -> Exp -> Term +linExp mcfg lang tree@(Tr at trees) = + case at of + AC fun -> comp (lmap lin trees) $ look fun + AS s -> R [kks (show s)] -- quoted + AI i -> R [kks (show i)] + AF d -> R [kks (show d)] + AM _ -> TM + where + lin = linExp mcfg lang + comp = compute mcfg lang + look = lookLin mcfg lang + +exp0 :: Exp +exp0 = Tr (AM 0) [] + +term0 :: CId -> Term +term0 _ = TM + +kks :: String -> Term +kks = K . KS + +compute :: GFCC -> CId -> [Term] -> Term -> Term +compute mcfg lang args = comp where + comp trm = case trm of + P r p -> proj (comp r) (comp p) + W s t -> W s (comp t) + R ts -> R $ lmap comp ts + V i -> idx args i -- already computed + F c -> comp $ look c -- not computed (if contains argvar) + FV ts -> FV $ lmap comp ts + S ts -> S $ lfilter (/= S []) $ lmap comp ts + _ -> trm + + look = lookOper mcfg lang + + idx xs i = if i > length xs - 1 + then error + ("too large " ++ show i ++ " for\n" ++ unlines (lmap prt xs) ++ "\n") TM + else xs !! i + + proj r p = case (r,p) of + (_, FV ts) -> FV $ lmap (proj r) ts + (FV ts, _ ) -> FV $ lmap (\t -> proj t r) ts + (W s t, _) -> kks (s ++ getString (proj t p)) + _ -> comp $ getField r (getIndex p) + + getString t = case t of + K (KS s) -> s + _ -> error ("ERROR in grammar compiler: string from "++ show t) "ERR" + + getIndex t = case t of + C i -> i + TM -> 0 -- default value for parameter + _ -> error ("ERROR in grammar compiler: index from " ++ show t) 0 + + getField t i = case t of + R rs -> idx rs i + TM -> TM + _ -> error ("ERROR in grammar compiler: field from " ++ show t) t + + prt = printTree + + +-- convert parsed grammar to internal GFCC + +mkGFCC :: Grammar -> GFCC +mkGFCC (Grm a cs ab@(Abs afls fs cts) ccs) = GFCC { + absname = a, + cncnames = cs, + abstract = + let + aflags = fromAscList [(f,v) | Flg f v <- afls] + lfuns = [(fun,(typ,def)) | Fun fun typ def <- fs] + funs = fromAscList lfuns + lcats = [(c,hyps) | Cat c hyps <- cts] + cats = fromAscList lcats + catfuns = fromAscList + [(cat,[f | (f, (Typ _ c,_)) <- lfuns, c==cat]) | (cat,_) <- lcats] + in Abstr aflags funs cats catfuns, + concretes = fromAscList (lmap mkCnc ccs) + } + where + mkCnc (Cnc lang fls ls ops lincs linds prns) = + (lang, Concr flags lins opers lincats lindefs printnames) where + flags = fromAscList [(f,v) | Flg f v <- fls] + lins = fromAscList [(f,v) | Lin f v <- ls] + opers = fromAscList [(f,v) | Lin f v <- ops] + lincats = fromAscList [(f,v) | Lin f v <- lincs] + lindefs = fromAscList [(f,v) | Lin f v <- linds] + printnames = fromAscList [(f,v) | Lin f v <- prns] + + +-- convert internal GFCC and pretty-print it + +printGFCC :: GFCC -> String +printGFCC gfcc = printTree $ Grm + (absname gfcc) + (cncnames gfcc) + (Abs + [Flg f v | (f,v) <- assocs (aflags (abstract gfcc))] + [Fun f ty df | (f,(ty,df)) <- assocs (funs (abstract gfcc))] + [Cat f v | (f,v) <- assocs (cats (abstract gfcc))] + ) + [fromCnc lang cnc | (lang,cnc) <- assocs (concretes gfcc)] + where + fromCnc lang cnc = Cnc lang + [Flg f v | (f,v) <- assocs (flags cnc)] + [Lin f v | (f,v) <- assocs (lins cnc)] + [Lin f v | (f,v) <- assocs (opers cnc)] + [Lin f v | (f,v) <- assocs (lincats cnc)] + [Lin f v | (f,v) <- assocs (lindefs cnc)] + [Lin f v | (f,v) <- assocs (printnames cnc)] + +-- lookup with default value +lookMap :: (Show i, Ord i) => a -> i -> Map i a -> a +lookMap d c m = maybe d id $ Data.Map.lookup c m + +-- default map and filter are for Map here +lmap = Prelude.map +lfilter = Prelude.filter + + diff --git a/src/GF/GFCC/ErrM.hs b/src/GF/GFCC/ErrM.hs new file mode 100644 index 000000000..15b014ae7 --- /dev/null +++ b/src/GF/GFCC/ErrM.hs @@ -0,0 +1,26 @@ +-- BNF Converter: Error Monad +-- Copyright (C) 2004 Author: Aarne Ranta + +-- This file comes with NO WARRANTY and may be used FOR ANY PURPOSE. +module GF.GFCC.ErrM where + +-- the Error monad: like Maybe type with error msgs + +import Control.Monad (MonadPlus(..), liftM) + +data Err a = Ok a | Bad String + deriving (Read, Show, Eq, Ord) + +instance Monad Err where + return = Ok + fail = Bad + Ok a >>= f = f a + Bad s >>= f = Bad s + +instance Functor Err where + fmap = liftM + +instance MonadPlus Err where + mzero = Bad "Err.mzero" + mplus (Bad _) y = y + mplus x _ = x diff --git a/src/GF/Devel/GFCC/GFCC.cf b/src/GF/GFCC/GFCC.cf index 317002635..4ecf7e942 100644 --- a/src/GF/Devel/GFCC/GFCC.cf +++ b/src/GF/GFCC/GFCC.cf @@ -1,50 +1,43 @@ -Grm. Grammar ::= Header ";" Abstract ";" [Concrete] ; -Hdr. Header ::= "grammar" CId "(" [CId] ")" ; +Grm. Grammar ::= + "grammar" CId "(" [CId] ")" ";" + Abstract ";" + [Concrete] ; Abs. Abstract ::= "abstract" "{" "flags" [Flag] - "cat" [CatDef] "fun" [FunDef] + "cat" [CatDef] "}" ; Cnc. Concrete ::= "concrete" CId "{" "flags" [Flag] + "lin" [LinDef] "oper" [LinDef] "lincat" [LinDef] "lindef" [LinDef] - "lin" [LinDef] + "printname" [LinDef] "}" ; Flg. Flag ::= CId "=" String ; - -Cat. CatDef ::= CId [Hypo] ; +Cat. CatDef ::= CId "[" [Hypo] "]" ; Fun. FunDef ::= CId ":" Type "=" Exp ; - Lin. LinDef ::= CId "=" Term ; -Hyp. Hypo ::= "(" CId ":" Type ")" ; - -FTyp. Type ::= [CId] "->" CId ; -- simple type -DTyp. Type ::= "[" [Hypo] "->" Type "]" ; -- dep. product type -BTyp. Type ::= "(" CId [Exp] ")" ; -- dep. basic type - -Tr. Exp ::= "(" Atom [Exp] ")" ; -- ordinary term -DTr. Exp ::= "[" "(" [CId] ")" Atom [Exp] "]" ; -- term with bindings +Typ. Type ::= [CId] "->" CId ; -- context-free type +Tr. Exp ::= "(" Atom [Exp] ")" ; -- context-free term AC. Atom ::= CId ; AS. Atom ::= String ; AI. Atom ::= Integer ; AF. Atom ::= Double ; -AM. Atom ::= "?" ; -trA. Exp ::= Atom ; -define trA a = Tr a [] ; +AM. Atom ::= "?" Integer ; R. Term ::= "[" [Term] "]" ; -- record/table P. Term ::= "(" Term "!" Term ")" ; -- projection/selection -S. Term ::= "(" [Term] ")" ; -- sequence with ++ +S. Term ::= "(" [Term] ")" ; -- concatenated sequence K. Term ::= Tokn ; -- token V. Term ::= "$" Integer ; -- argument C. Term ::= Integer ; -- parameter value/label @@ -63,7 +56,6 @@ terminator Flag ";" ; terminator CatDef ";" ; terminator FunDef ";" ; terminator LinDef ";" ; -terminator Hypo "" ; separator CId "," ; separator Term "," ; terminator Exp "" ; @@ -71,3 +63,17 @@ terminator String "" ; separator Variant "," ; token CId (('_' | letter) (letter | digit | '\'' | '_')*) ; + +-- the following are needed if dependent types or HOAS or defs are present + +Hyp. Hypo ::= CId ":" Type ; +DTyp. Type ::= "[" [Hypo] "]" CId [Exp] ; -- dependent type +DTr. Exp ::= "[" "(" [CId] ")" Atom [Exp] "]" ; -- term with bindings +AV. Atom ::= "$" CId ; + +EEq. Exp ::= "{" [Equation] "}" ; -- list of pattern eqs; primitive notion: [] +Equ. Equation ::= [Exp] "->" Exp ; -- patterns are encoded as exps + +terminator Hypo ";" ; +terminator Equation ";" ; + diff --git a/src/GF/GFCC/Generate.hs b/src/GF/GFCC/Generate.hs new file mode 100644 index 000000000..758e96d8c --- /dev/null +++ b/src/GF/GFCC/Generate.hs @@ -0,0 +1,79 @@ +module GF.GFCC.Generate where + +import GF.GFCC.DataGFCC +import GF.GFCC.AbsGFCC + +import qualified Data.Map as M +import System.Random + +-- generate an infinite list of trees exhaustively +generate :: GFCC -> CId -> [Exp] +generate gfcc cat = concatMap (\i -> gener i cat) [0..] + where + gener 0 c = [Tr (AC f) [] | (f, Typ [] _) <- fns c] + gener i c = [ + tr | + (f, Typ cs _) <- fns c, + let alts = map (gener (i-1)) cs, + ts <- combinations alts, + let tr = Tr (AC f) ts, + depth tr >= i + ] + fns cat = + let fs = lookMap [] cat $ catfuns $ abstract gfcc + in [(f,ty) | f <- fs, Just (ty,_) <- [M.lookup f $ funs $ abstract gfcc]] + depth tr = case tr of + Tr _ [] -> 1 + Tr _ ts -> maximum (map depth ts) + 1 + +--- from Operations +combinations :: [[a]] -> [[a]] +combinations t = case t of + [] -> [[]] + aa:uu -> [a:u | a <- aa, u <- combinations uu] + +-- generate an infinite list of trees randomly +genRandom :: StdGen -> GFCC -> CId -> [Exp] +genRandom gen gfcc cat = genTrees (randomRs (0.0, 1.0) gen) cat where + + timeout = 47 -- give up + + genTrees ds0 cat = + let (ds,ds2) = splitAt (timeout+1) ds0 -- for time out, else ds + (t,k) = genTree ds cat + in (if k>timeout then id else (t:)) + (genTrees ds2 cat) -- else (drop k ds) + + genTree rs = gett rs where + gett ds (CId "String") = (Tr (AS "foo") [], 1) + gett ds (CId "Int") = (Tr (AI 12345) [], 1) + gett [] _ = (Tr (AS "TIMEOUT") [], 1) ---- + gett ds cat = case fns cat of + [] -> (Tr (AM 0) [],1) + fs -> let + d:ds2 = ds + (f,args) = getf d fs + (ts,k) = getts ds2 args + in (Tr (AC f) ts, k+1) + getf d fs = let lg = (length fs) in + fs !! (floor (d * fromIntegral lg)) + getts ds cats = case cats of + c:cs -> let + (t, k) = gett ds c + (ts,ks) = getts (drop k ds) cs + in (t:ts, k + ks) + _ -> ([],0) + + fns cat = + let fs = maybe [] id $ M.lookup cat $ catfuns $ abstract gfcc + in [(f,cs) | f <- fs, + Just (Typ cs _,_) <- [M.lookup f $ funs $ abstract gfcc]] + +-- brute-force parsing method; only returns the first result +-- note: you cannot throw away rules with unknown words from the grammar +-- because it is not known which field in each rule may match the input + +searchParse :: Int -> GFCC -> CId -> [String] -> [Exp] +searchParse i gfcc cat ws = [t | t <- gen, s <- lins t, words s == ws] where + gen = take i $ generate gfcc cat + lins t = [linearize gfcc lang t | lang <- cncnames gfcc] diff --git a/src/GF/GFCC/LexGFCC.hs b/src/GF/GFCC/LexGFCC.hs new file mode 100644 index 000000000..041f213cb --- /dev/null +++ b/src/GF/GFCC/LexGFCC.hs @@ -0,0 +1,340 @@ +{-# OPTIONS -fglasgow-exts -cpp #-} +{-# LINE 3 "GF/GFCC/LexGFCC.x" #-} +{-# OPTIONS -fno-warn-incomplete-patterns #-} +module GF.GFCC.LexGFCC where + + + +#if __GLASGOW_HASKELL__ >= 603 +#include "ghcconfig.h" +#else +#include "config.h" +#endif +#if __GLASGOW_HASKELL__ >= 503 +import Data.Array +import Data.Char (ord) +import Data.Array.Base (unsafeAt) +#else +import Array +import Char (ord) +#endif +#if __GLASGOW_HASKELL__ >= 503 +import GHC.Exts +#else +import GlaExts +#endif +alex_base :: AlexAddr +alex_base = AlexA# "\x01\x00\x00\x00\x39\x00\x00\x00\x42\x00\x00\x00\x00\x00\x00\x00\xcb\xff\xff\xff\x0a\x00\x00\x00\xec\xff\xff\xff\x9a\x00\x00\x00\x6a\x01\x00\x00\x3a\x02\x00\x00\x0a\x03\x00\x00\x00\x00\x00\x00\x15\x01\x00\x00\xe5\x01\x00\x00\xd3\x00\x00\x00\x35\x00\x00\x00\xe5\x00\x00\x00\x3f\x00\x00\x00\xf0\x00\x00\x00\x1b\x01\x00\x00\xb5\x01\x00\x00"# + +alex_table :: AlexAddr +alex_table = AlexA# "\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x02\x00\x03\x00\x0c\x00\xff\xff\x03\x00\xff\xff\xff\xff\xff\xff\x03\x00\x03\x00\xff\xff\x03\x00\x03\x00\x05\x00\xff\xff\x03\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x03\x00\x03\x00\xff\xff\x03\x00\xff\xff\x03\x00\xff\xff\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x03\x00\x03\x00\x03\x00\x00\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x04\x00\xff\xff\x03\x00\xff\xff\x07\x00\xff\xff\x02\x00\x12\x00\x00\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x0f\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x00\x00\x00\x00\x00\x00\x03\x00\x06\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0d\x00\x00\x00\x00\x00\xff\xff\x09\x00\x0d\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\xff\xff\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x14\x00\x00\x00\x13\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0e\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0a\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\x11\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0e\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x09\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x00\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0a\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x09\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00"# + +alex_check :: AlexAddr +alex_check = AlexA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x7c\x00\x3e\x00\x5d\x00\xff\xff\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x20\x00\xff\xff\xff\xff\x5b\x00\x5c\x00\x5d\x00\x5e\x00\x5f\x00\x60\x00\x20\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\x7b\x00\x7c\x00\x7d\x00\x7e\x00\x7f\x00\x80\x00\x81\x00\x82\x00\x83\x00\x84\x00\x85\x00\x86\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x9a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\xa0\x00\xa1\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xba\x00\xbb\x00\xbc\x00\xbd\x00\xbe\x00\xbf\x00\x27\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xd7\x00\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x22\x00\xff\xff\xff\xff\xf7\x00\x5f\x00\x27\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x0a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x5c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x6e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x74\x00\x2d\x00\xff\xff\x65\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\xff\xff\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\xff\xff\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\xff\xff\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00"# + +alex_deflt :: AlexAddr +alex_deflt = AlexA# "\x08\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0d\x00\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# + +alex_accept = listArray (0::Int,20) [[],[],[(AlexAccSkip)],[(AlexAcc (alex_action_1))],[(AlexAcc (alex_action_1))],[],[],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_4))],[],[],[],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_6))],[(AlexAcc (alex_action_6))],[],[],[]] +{-# LINE 33 "GF/GFCC/LexGFCC.x" #-} + +tok f p s = f p s + +share :: String -> String +share = id + +data Tok = + TS !String -- reserved words and symbols + | TL !String -- string literals + | TI !String -- integer literals + | TV !String -- identifiers + | TD !String -- double precision float literals + | TC !String -- character literals + | T_CId !String + + deriving (Eq,Show,Ord) + +data Token = + PT Posn Tok + | Err Posn + deriving (Eq,Show,Ord) + +tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l +tokenPos (Err (Pn _ l _) :_) = "line " ++ show l +tokenPos _ = "end of file" + +posLineCol (Pn _ l c) = (l,c) +mkPosToken t@(PT p _) = (posLineCol p, prToken t) + +prToken t = case t of + PT _ (TS s) -> s + PT _ (TI s) -> s + PT _ (TV s) -> s + PT _ (TD s) -> s + PT _ (TC s) -> s + PT _ (T_CId s) -> s + + _ -> show t + +data BTree = N | B String Tok BTree BTree deriving (Show) + +eitherResIdent :: (String -> Tok) -> String -> Tok +eitherResIdent tv s = treeFind resWords + where + treeFind N = tv s + treeFind (B a t left right) | s < a = treeFind left + | s > a = treeFind right + | s == a = t + +resWords = b "lin" (b "flags" (b "cat" (b "abstract" N N) (b "concrete" N N)) (b "grammar" (b "fun" N N) N)) (b "oper" (b "lindef" (b "lincat" N N) N) (b "printname" (b "pre" N N) N)) + where b s = B s (TS s) + +unescapeInitTail :: String -> String +unescapeInitTail = unesc . tail where + unesc s = case s of + '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs + '\\':'n':cs -> '\n' : unesc cs + '\\':'t':cs -> '\t' : unesc cs + '"':[] -> [] + c:cs -> c : unesc cs + _ -> [] + +------------------------------------------------------------------- +-- Alex wrapper code. +-- A modified "posn" wrapper. +------------------------------------------------------------------- + +data Posn = Pn !Int !Int !Int + deriving (Eq, Show,Ord) + +alexStartPos :: Posn +alexStartPos = Pn 0 1 1 + +alexMove :: Posn -> Char -> Posn +alexMove (Pn a l c) '\t' = Pn (a+1) l (((c+7) `div` 8)*8+1) +alexMove (Pn a l c) '\n' = Pn (a+1) (l+1) 1 +alexMove (Pn a l c) _ = Pn (a+1) l (c+1) + +type AlexInput = (Posn, -- current position, + Char, -- previous char + String) -- current input string + +tokens :: String -> [Token] +tokens str = go (alexStartPos, '\n', str) + where + go :: (Posn, Char, String) -> [Token] + go inp@(pos, _, str) = + case alexScan inp 0 of + AlexEOF -> [] + AlexError (pos, _, _) -> [Err pos] + AlexSkip inp' len -> go inp' + AlexToken inp' len act -> act pos (take len str) : (go inp') + +alexGetChar :: AlexInput -> Maybe (Char,AlexInput) +alexGetChar (p, c, []) = Nothing +alexGetChar (p, _, (c:s)) = + let p' = alexMove p c + in p' `seq` Just (c, (p', c, s)) + +alexInputPrevChar :: AlexInput -> Char +alexInputPrevChar (p, c, s) = c + +alex_action_1 = tok (\p s -> PT p (TS $ share s)) +alex_action_2 = tok (\p s -> PT p (eitherResIdent (T_CId . share) s)) +alex_action_3 = tok (\p s -> PT p (eitherResIdent (TV . share) s)) +alex_action_4 = tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) +alex_action_5 = tok (\p s -> PT p (TI $ share s)) +alex_action_6 = tok (\p s -> PT p (TD $ share s)) +{-# LINE 1 "GenericTemplate.hs" #-} +{-# LINE 1 "<built-in>" #-} +{-# LINE 1 "<command line>" #-} +{-# LINE 1 "GenericTemplate.hs" #-} +-- ----------------------------------------------------------------------------- +-- ALEX TEMPLATE +-- +-- This code is in the PUBLIC DOMAIN; you may copy it freely and use +-- it for any purpose whatsoever. + +-- ----------------------------------------------------------------------------- +-- INTERNALS and main scanner engine + +{-# LINE 35 "GenericTemplate.hs" #-} + +{-# LINE 45 "GenericTemplate.hs" #-} + + +data AlexAddr = AlexA# Addr# + +#if __GLASGOW_HASKELL__ < 503 +uncheckedShiftL# = shiftL# +#endif + +{-# INLINE alexIndexInt16OffAddr #-} +alexIndexInt16OffAddr (AlexA# arr) off = +#ifdef WORDS_BIGENDIAN + narrow16Int# i + where + i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low) + high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) + low = int2Word# (ord# (indexCharOffAddr# arr off')) + off' = off *# 2# +#else + indexInt16OffAddr# arr off +#endif + + + + + +{-# INLINE alexIndexInt32OffAddr #-} +alexIndexInt32OffAddr (AlexA# arr) off = +#ifdef WORDS_BIGENDIAN + narrow32Int# i + where + i = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#` + (b2 `uncheckedShiftL#` 16#) `or#` + (b1 `uncheckedShiftL#` 8#) `or#` b0) + b3 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#))) + b2 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#))) + b1 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) + b0 = int2Word# (ord# (indexCharOffAddr# arr off')) + off' = off *# 4# +#else + indexInt32OffAddr# arr off +#endif + + + + + +#if __GLASGOW_HASKELL__ < 503 +quickIndex arr i = arr ! i +#else +-- GHC >= 503, unsafeAt is available from Data.Array.Base. +quickIndex = unsafeAt +#endif + + + + +-- ----------------------------------------------------------------------------- +-- Main lexing routines + +data AlexReturn a + = AlexEOF + | AlexError !AlexInput + | AlexSkip !AlexInput !Int + | AlexToken !AlexInput !Int a + +-- alexScan :: AlexInput -> StartCode -> AlexReturn a +alexScan input (I# (sc)) + = alexScanUser undefined input (I# (sc)) + +alexScanUser user input (I# (sc)) + = case alex_scan_tkn user input 0# input sc AlexNone of + (AlexNone, input') -> + case alexGetChar input of + Nothing -> + + + + AlexEOF + Just _ -> + + + + AlexError input' + + (AlexLastSkip input len, _) -> + + + + AlexSkip input len + + (AlexLastAcc k input len, _) -> + + + + AlexToken input len k + + +-- Push the input through the DFA, remembering the most recent accepting +-- state it encountered. + +alex_scan_tkn user orig_input len input s last_acc = + input `seq` -- strict in the input + let + new_acc = check_accs (alex_accept `quickIndex` (I# (s))) + in + new_acc `seq` + case alexGetChar input of + Nothing -> (new_acc, input) + Just (c, new_input) -> + + + + let + base = alexIndexInt32OffAddr alex_base s + (I# (ord_c)) = ord c + offset = (base +# ord_c) + check = alexIndexInt16OffAddr alex_check offset + + new_s = if (offset >=# 0#) && (check ==# ord_c) + then alexIndexInt16OffAddr alex_table offset + else alexIndexInt16OffAddr alex_deflt s + in + case new_s of + -1# -> (new_acc, input) + -- on an error, we want to keep the input *before* the + -- character that failed, not after. + _ -> alex_scan_tkn user orig_input (len +# 1#) + new_input new_s new_acc + + where + check_accs [] = last_acc + check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len)) + check_accs (AlexAccSkip : _) = AlexLastSkip input (I# (len)) + check_accs (AlexAccPred a pred : rest) + | pred user orig_input (I# (len)) input + = AlexLastAcc a input (I# (len)) + check_accs (AlexAccSkipPred pred : rest) + | pred user orig_input (I# (len)) input + = AlexLastSkip input (I# (len)) + check_accs (_ : rest) = check_accs rest + +data AlexLastAcc a + = AlexNone + | AlexLastAcc a !AlexInput !Int + | AlexLastSkip !AlexInput !Int + +data AlexAcc a user + = AlexAcc a + | AlexAccSkip + | AlexAccPred a (AlexAccPred user) + | AlexAccSkipPred (AlexAccPred user) + +type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool + +-- ----------------------------------------------------------------------------- +-- Predicates on a rule + +alexAndPred p1 p2 user in1 len in2 + = p1 user in1 len in2 && p2 user in1 len in2 + +--alexPrevCharIsPred :: Char -> AlexAccPred _ +alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input + +--alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _ +alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input + +--alexRightContext :: Int -> AlexAccPred _ +alexRightContext (I# (sc)) user _ _ input = + case alex_scan_tkn user input 0# input sc AlexNone of + (AlexNone, _) -> False + _ -> True + -- TODO: there's no need to find the longest + -- match when checking the right context, just + -- the first match will do. + +-- used by wrappers +iUnbox (I# (i)) = i diff --git a/src/GF/GFCC/ParGFCC.hs b/src/GF/GFCC/ParGFCC.hs new file mode 100644 index 000000000..f5d244ed2 --- /dev/null +++ b/src/GF/GFCC/ParGFCC.hs @@ -0,0 +1,1300 @@ +{-# OPTIONS -fglasgow-exts -cpp #-} +{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-} +module GF.GFCC.ParGFCC where +import GF.GFCC.AbsGFCC +import GF.GFCC.LexGFCC +import GF.GFCC.ErrM +#if __GLASGOW_HASKELL__ >= 503 +import Data.Array +#else +import Array +#endif +#if __GLASGOW_HASKELL__ >= 503 +import GHC.Exts +#else +import GlaExts +#endif + +-- parser produced by Happy Version 1.16 + +newtype HappyAbsSyn = HappyAbsSyn (() -> ()) +happyIn30 :: (String) -> (HappyAbsSyn ) +happyIn30 x = unsafeCoerce# x +{-# INLINE happyIn30 #-} +happyOut30 :: (HappyAbsSyn ) -> (String) +happyOut30 x = unsafeCoerce# x +{-# INLINE happyOut30 #-} +happyIn31 :: (Integer) -> (HappyAbsSyn ) +happyIn31 x = unsafeCoerce# x +{-# INLINE happyIn31 #-} +happyOut31 :: (HappyAbsSyn ) -> (Integer) +happyOut31 x = unsafeCoerce# x +{-# INLINE happyOut31 #-} +happyIn32 :: (Double) -> (HappyAbsSyn ) +happyIn32 x = unsafeCoerce# x +{-# INLINE happyIn32 #-} +happyOut32 :: (HappyAbsSyn ) -> (Double) +happyOut32 x = unsafeCoerce# x +{-# INLINE happyOut32 #-} +happyIn33 :: (CId) -> (HappyAbsSyn ) +happyIn33 x = unsafeCoerce# x +{-# INLINE happyIn33 #-} +happyOut33 :: (HappyAbsSyn ) -> (CId) +happyOut33 x = unsafeCoerce# x +{-# INLINE happyOut33 #-} +happyIn34 :: (Grammar) -> (HappyAbsSyn ) +happyIn34 x = unsafeCoerce# x +{-# INLINE happyIn34 #-} +happyOut34 :: (HappyAbsSyn ) -> (Grammar) +happyOut34 x = unsafeCoerce# x +{-# INLINE happyOut34 #-} +happyIn35 :: (Abstract) -> (HappyAbsSyn ) +happyIn35 x = unsafeCoerce# x +{-# INLINE happyIn35 #-} +happyOut35 :: (HappyAbsSyn ) -> (Abstract) +happyOut35 x = unsafeCoerce# x +{-# INLINE happyOut35 #-} +happyIn36 :: (Concrete) -> (HappyAbsSyn ) +happyIn36 x = unsafeCoerce# x +{-# INLINE happyIn36 #-} +happyOut36 :: (HappyAbsSyn ) -> (Concrete) +happyOut36 x = unsafeCoerce# x +{-# INLINE happyOut36 #-} +happyIn37 :: (Flag) -> (HappyAbsSyn ) +happyIn37 x = unsafeCoerce# x +{-# INLINE happyIn37 #-} +happyOut37 :: (HappyAbsSyn ) -> (Flag) +happyOut37 x = unsafeCoerce# x +{-# INLINE happyOut37 #-} +happyIn38 :: (CatDef) -> (HappyAbsSyn ) +happyIn38 x = unsafeCoerce# x +{-# INLINE happyIn38 #-} +happyOut38 :: (HappyAbsSyn ) -> (CatDef) +happyOut38 x = unsafeCoerce# x +{-# INLINE happyOut38 #-} +happyIn39 :: (FunDef) -> (HappyAbsSyn ) +happyIn39 x = unsafeCoerce# x +{-# INLINE happyIn39 #-} +happyOut39 :: (HappyAbsSyn ) -> (FunDef) +happyOut39 x = unsafeCoerce# x +{-# INLINE happyOut39 #-} +happyIn40 :: (LinDef) -> (HappyAbsSyn ) +happyIn40 x = unsafeCoerce# x +{-# INLINE happyIn40 #-} +happyOut40 :: (HappyAbsSyn ) -> (LinDef) +happyOut40 x = unsafeCoerce# x +{-# INLINE happyOut40 #-} +happyIn41 :: (Type) -> (HappyAbsSyn ) +happyIn41 x = unsafeCoerce# x +{-# INLINE happyIn41 #-} +happyOut41 :: (HappyAbsSyn ) -> (Type) +happyOut41 x = unsafeCoerce# x +{-# INLINE happyOut41 #-} +happyIn42 :: (Exp) -> (HappyAbsSyn ) +happyIn42 x = unsafeCoerce# x +{-# INLINE happyIn42 #-} +happyOut42 :: (HappyAbsSyn ) -> (Exp) +happyOut42 x = unsafeCoerce# x +{-# INLINE happyOut42 #-} +happyIn43 :: (Atom) -> (HappyAbsSyn ) +happyIn43 x = unsafeCoerce# x +{-# INLINE happyIn43 #-} +happyOut43 :: (HappyAbsSyn ) -> (Atom) +happyOut43 x = unsafeCoerce# x +{-# INLINE happyOut43 #-} +happyIn44 :: (Term) -> (HappyAbsSyn ) +happyIn44 x = unsafeCoerce# x +{-# INLINE happyIn44 #-} +happyOut44 :: (HappyAbsSyn ) -> (Term) +happyOut44 x = unsafeCoerce# x +{-# INLINE happyOut44 #-} +happyIn45 :: (Tokn) -> (HappyAbsSyn ) +happyIn45 x = unsafeCoerce# x +{-# INLINE happyIn45 #-} +happyOut45 :: (HappyAbsSyn ) -> (Tokn) +happyOut45 x = unsafeCoerce# x +{-# INLINE happyOut45 #-} +happyIn46 :: (Variant) -> (HappyAbsSyn ) +happyIn46 x = unsafeCoerce# x +{-# INLINE happyIn46 #-} +happyOut46 :: (HappyAbsSyn ) -> (Variant) +happyOut46 x = unsafeCoerce# x +{-# INLINE happyOut46 #-} +happyIn47 :: ([Concrete]) -> (HappyAbsSyn ) +happyIn47 x = unsafeCoerce# x +{-# INLINE happyIn47 #-} +happyOut47 :: (HappyAbsSyn ) -> ([Concrete]) +happyOut47 x = unsafeCoerce# x +{-# INLINE happyOut47 #-} +happyIn48 :: ([Flag]) -> (HappyAbsSyn ) +happyIn48 x = unsafeCoerce# x +{-# INLINE happyIn48 #-} +happyOut48 :: (HappyAbsSyn ) -> ([Flag]) +happyOut48 x = unsafeCoerce# x +{-# INLINE happyOut48 #-} +happyIn49 :: ([CatDef]) -> (HappyAbsSyn ) +happyIn49 x = unsafeCoerce# x +{-# INLINE happyIn49 #-} +happyOut49 :: (HappyAbsSyn ) -> ([CatDef]) +happyOut49 x = unsafeCoerce# x +{-# INLINE happyOut49 #-} +happyIn50 :: ([FunDef]) -> (HappyAbsSyn ) +happyIn50 x = unsafeCoerce# x +{-# INLINE happyIn50 #-} +happyOut50 :: (HappyAbsSyn ) -> ([FunDef]) +happyOut50 x = unsafeCoerce# x +{-# INLINE happyOut50 #-} +happyIn51 :: ([LinDef]) -> (HappyAbsSyn ) +happyIn51 x = unsafeCoerce# x +{-# INLINE happyIn51 #-} +happyOut51 :: (HappyAbsSyn ) -> ([LinDef]) +happyOut51 x = unsafeCoerce# x +{-# INLINE happyOut51 #-} +happyIn52 :: ([CId]) -> (HappyAbsSyn ) +happyIn52 x = unsafeCoerce# x +{-# INLINE happyIn52 #-} +happyOut52 :: (HappyAbsSyn ) -> ([CId]) +happyOut52 x = unsafeCoerce# x +{-# INLINE happyOut52 #-} +happyIn53 :: ([Term]) -> (HappyAbsSyn ) +happyIn53 x = unsafeCoerce# x +{-# INLINE happyIn53 #-} +happyOut53 :: (HappyAbsSyn ) -> ([Term]) +happyOut53 x = unsafeCoerce# x +{-# INLINE happyOut53 #-} +happyIn54 :: ([Exp]) -> (HappyAbsSyn ) +happyIn54 x = unsafeCoerce# x +{-# INLINE happyIn54 #-} +happyOut54 :: (HappyAbsSyn ) -> ([Exp]) +happyOut54 x = unsafeCoerce# x +{-# INLINE happyOut54 #-} +happyIn55 :: ([String]) -> (HappyAbsSyn ) +happyIn55 x = unsafeCoerce# x +{-# INLINE happyIn55 #-} +happyOut55 :: (HappyAbsSyn ) -> ([String]) +happyOut55 x = unsafeCoerce# x +{-# INLINE happyOut55 #-} +happyIn56 :: ([Variant]) -> (HappyAbsSyn ) +happyIn56 x = unsafeCoerce# x +{-# INLINE happyIn56 #-} +happyOut56 :: (HappyAbsSyn ) -> ([Variant]) +happyOut56 x = unsafeCoerce# x +{-# INLINE happyOut56 #-} +happyIn57 :: (Hypo) -> (HappyAbsSyn ) +happyIn57 x = unsafeCoerce# x +{-# INLINE happyIn57 #-} +happyOut57 :: (HappyAbsSyn ) -> (Hypo) +happyOut57 x = unsafeCoerce# x +{-# INLINE happyOut57 #-} +happyIn58 :: (Equation) -> (HappyAbsSyn ) +happyIn58 x = unsafeCoerce# x +{-# INLINE happyIn58 #-} +happyOut58 :: (HappyAbsSyn ) -> (Equation) +happyOut58 x = unsafeCoerce# x +{-# INLINE happyOut58 #-} +happyIn59 :: ([Hypo]) -> (HappyAbsSyn ) +happyIn59 x = unsafeCoerce# x +{-# INLINE happyIn59 #-} +happyOut59 :: (HappyAbsSyn ) -> ([Hypo]) +happyOut59 x = unsafeCoerce# x +{-# INLINE happyOut59 #-} +happyIn60 :: ([Equation]) -> (HappyAbsSyn ) +happyIn60 x = unsafeCoerce# x +{-# INLINE happyIn60 #-} +happyOut60 :: (HappyAbsSyn ) -> ([Equation]) +happyOut60 x = unsafeCoerce# x +{-# INLINE happyOut60 #-} +happyInTok :: Token -> (HappyAbsSyn ) +happyInTok x = unsafeCoerce# x +{-# INLINE happyInTok #-} +happyOutTok :: (HappyAbsSyn ) -> Token +happyOutTok x = unsafeCoerce# x +{-# INLINE happyOutTok #-} + +happyActOffsets :: HappyAddr +happyActOffsets = HappyA# "\x3e\x01\x3f\x01\x3b\x01\x39\x01\x39\x01\x39\x01\x39\x01\x0b\x00\xbb\x00\x4a\x00\x0a\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x01\x0a\x00\x00\x00\x00\x00\x36\x01\x37\x01\x00\x00\x00\x00\x00\x00\x35\x01\x00\x00\x34\x01\x41\x00\xb3\x00\x34\x01\x2b\x01\x33\x01\x00\x00\x32\x01\x67\x00\x31\x01\xa6\x00\x01\x00\x00\x00\x00\x00\x00\x00\x30\x01\x00\x00\x2d\x01\x0a\x00\x02\x00\x00\x00\x2f\x01\x0a\x00\x00\x00\x2c\x01\x2a\x01\x41\x00\x41\x00\x41\x00\x41\x00\xff\xff\x2a\x01\x2a\x01\x2e\x01\x29\x01\x00\x00\x00\x00\x00\x00\x00\x00\x29\x01\x27\x01\x28\x01\x00\x00\x25\x01\x4a\x00\x00\x00\x26\x01\x24\x01\x23\x01\x00\x00\x22\x01\x21\x01\x20\x01\x1f\x01\x1e\x01\x1b\x01\x1d\x01\x19\x01\x19\x01\x18\x01\x17\x01\x1a\x01\x02\x01\x11\x01\x1c\x01\x0e\x01\x15\x01\x0d\x01\x00\x00\x0b\x00\x0a\x00\x04\x00\xff\x00\xff\x00\x16\x01\x00\x00\x00\x00\x00\x00\x00\x00\x14\x01\x13\x01\x12\x01\x10\x01\x0f\x01\xfe\x00\x05\x01\x00\x00\x08\x01\x01\x01\xb5\x00\x0a\x01\x0a\x00\x00\x00\x00\x00\x00\x00\x5d\x00\x0b\x00\xbb\x00\x0c\x01\x0b\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfd\xff\xb7\x00\x00\x00\x09\x01\x00\x00\xf8\x00\x00\x00\x04\x01\xfe\xff\x00\x00\xf7\x00\x00\x00\xf6\x00\x07\x01\x1e\x00\x00\x00\x00\x00\xbb\x00\x00\x00\x4a\x00\x00\x00\x5d\x00\x06\x01\x03\x01\x00\x00\x00\x00\xfc\x00\x00\x00\xbb\x00\x00\x00\x6a\x00\x00\x00\x00\x01\xf4\x00\x60\x00\x00\x00\x96\x00\xfa\x00\x00\x00\x00\x00\xa4\x00\x00\x00\xfb\x00\x00\x00\x05\x00\x00\x00\x1d\x00\x00\x00\xf1\x00\x00\x00\x93\x00\x00\x00\xb8\x00\x00\x00\xfc\xff\x00\x00\x00\x00"# + +happyGotoOffsets :: HappyAddr +happyGotoOffsets = HappyA# "\xf9\x00\xf3\x00\xf5\x00\xd0\x00\xc1\x00\x5e\x00\xa5\x00\x59\x00\xf0\x00\xa0\x00\x8a\x00\x0e\x00\x6e\x00\xee\x00\xef\x00\xed\x00\xe6\x00\xe4\x00\x5b\x00\x51\x00\xdf\x00\xdd\x00\x99\x00\x13\x00\xbc\x00\xd7\x00\xd5\x00\x00\x00\x00\x00\xb6\x00\x10\x00\xe9\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\x00\x00\x00\xf2\x00\xe2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4b\x00\x39\x00\x00\x00\xec\x00\x33\x00\x00\x00\x00\x00\x00\x00\xa1\x00\x46\x00\xc0\x00\xca\x00\xea\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xeb\x00\xe8\x00\x00\x00\x00\x00\x92\x00\xd3\x00\x00\x00\x00\x00\x00\x00\xd2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe7\x00\x00\x00\x00\x00\x00\x00\xe3\x00\x00\x00\x00\x00\x00\x00\xe5\x00\xc7\x00\x50\x00\x7a\x00\x10\x00\xe0\x00\x5a\x00\xb4\x00\xd1\x00\x00\x00\x00\x00\xcf\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x00\x00\x00\x00\xce\x00\x97\x00\x42\x00\xd6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x00\x00\x00\x00\x00\x76\x00\x72\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\x00\xd4\x00\x00\x00\x00\x00\x00\x00\xdc\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\xcc\x00\x25\x00\x00\x00\xc8\x00\xcb\x00\x00\x00\xcd\x00\xc4\x00\x8e\x00\x00\x00\x8c\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc3\x00\xc9\x00\x00\x00\xc8\x00\xa2\x00\x00\x00\xa7\x00\x46\x00\x95\x00\x73\x00\x00\x00\x00\x00\x00\x00\xa1\x00\x31\x00\x00\x00\x85\x00\xc0\x00\x58\x00\xa1\x00\x00\x00\x14\x00\x23\x00\xa1\x00\x06\x00\xa1\x00\xf2\xff\xa1\x00\x00\x00\x00\x00"# + +happyDefActions :: HappyAddr +happyDefActions = HappyA# "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb7\xff\x00\x00\x00\x00\x00\x00\x00\x00\xaf\xff\xc1\xff\xbf\xff\xbd\xff\xbb\xff\xb9\xff\xb7\xff\xb4\xff\xb1\xff\xaf\xff\xaf\xff\x00\x00\xb1\xff\xa8\xff\xa6\xff\x00\x00\xe4\xff\xb1\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe1\xff\xac\xff\x00\x00\x00\x00\x00\x00\x00\x00\xc4\xff\xc9\xff\xc8\xff\xb3\xff\xcb\xff\x00\x00\xb4\xff\xb4\xff\xc5\xff\x00\x00\xb4\xff\xe3\xff\xb6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd3\xff\xd2\xff\xd1\xff\xd4\xff\x00\x00\x00\x00\x00\x00\xe2\xff\x00\x00\x00\x00\xa6\xff\x00\x00\x00\x00\x00\x00\xa8\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa8\xff\xb7\xff\x00\x00\x00\x00\x00\x00\xb7\xff\xb1\xff\xb1\xff\xcf\xff\xd0\xff\xaf\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb7\xff\x00\x00\xca\xff\x00\x00\xc4\xff\xb3\xff\x00\x00\xb4\xff\xb0\xff\xae\xff\xaf\xff\xad\xff\xb7\xff\x00\x00\x00\x00\x00\x00\xa5\xff\xa7\xff\xa9\xff\xaa\xff\xab\xff\xc2\xff\xb2\xff\xcc\xff\x00\x00\x00\x00\xce\xff\xc7\xff\xb5\xff\xb8\xff\xba\xff\xbc\xff\xbe\xff\xc0\xff\x00\x00\x00\x00\xd5\xff\x00\x00\xd9\xff\x00\x00\xda\xff\x00\x00\x00\x00\xdd\xff\x00\x00\xbf\xff\xb7\xff\x00\x00\x00\x00\xbf\xff\xdc\xff\x00\x00\xb1\xff\x00\x00\xd7\xff\xad\xff\x00\x00\x00\x00\xcd\xff\xc6\xff\x00\x00\xb1\xff\xd8\xff\xdb\xff\x00\x00\xbb\xff\x00\x00\x00\x00\x00\x00\xb9\xff\x00\x00\x00\x00\xc3\xff\xd6\xff\x00\x00\xbd\xff\x00\x00\xc1\xff\x00\x00\xb9\xff\x00\x00\xdf\xff\xe0\xff\xb9\xff\x00\x00\xb9\xff\x00\x00\xb9\xff\x00\x00\xde\xff"# + +happyCheck :: HappyAddr +happyCheck = HappyA# "\xff\xff\x05\x00\x01\x00\x01\x00\x07\x00\x04\x00\x08\x00\x15\x00\x07\x00\x07\x00\x05\x00\x01\x00\x08\x00\x0b\x00\x00\x00\x0d\x00\x0e\x00\x07\x00\x07\x00\x03\x00\x15\x00\x0b\x00\x03\x00\x0d\x00\x0e\x00\x07\x00\x06\x00\x15\x00\x1f\x00\x0f\x00\x22\x00\x1d\x00\x22\x00\x1f\x00\x20\x00\x24\x00\x22\x00\x24\x00\x22\x00\x22\x00\x03\x00\x1f\x00\x20\x00\x1b\x00\x22\x00\x22\x00\x1b\x00\x00\x00\x01\x00\x1f\x00\x03\x00\x00\x00\x01\x00\x17\x00\x03\x00\x1a\x00\x15\x00\x00\x00\x01\x00\x16\x00\x03\x00\x0e\x00\x0f\x00\x22\x00\x22\x00\x0e\x00\x0f\x00\x03\x00\x13\x00\x03\x00\x17\x00\x0e\x00\x0f\x00\x03\x00\x17\x00\x00\x00\x01\x00\x0b\x00\x03\x00\x09\x00\x17\x00\x00\x00\x01\x00\x03\x00\x03\x00\x0b\x00\x16\x00\x0d\x00\x16\x00\x0e\x00\x0f\x00\x0b\x00\x03\x00\x03\x00\x03\x00\x0e\x00\x0f\x00\x03\x00\x17\x00\x22\x00\x0b\x00\x24\x00\x16\x00\x09\x00\x17\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x15\x00\x11\x00\x16\x00\x16\x00\x16\x00\x00\x00\x01\x00\x14\x00\x03\x00\x00\x00\x01\x00\x11\x00\x03\x00\x00\x00\x01\x00\x1f\x00\x03\x00\x10\x00\x0c\x00\x0e\x00\x0f\x00\x22\x00\x19\x00\x0e\x00\x0f\x00\x1f\x00\x19\x00\x0e\x00\x0f\x00\x00\x00\x01\x00\x22\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x11\x00\x01\x00\x0e\x00\x0f\x00\x04\x00\x0d\x00\x10\x00\x07\x00\x08\x00\x0d\x00\x00\x00\x01\x00\x02\x00\x03\x00\x03\x00\x19\x00\x1a\x00\x10\x00\x03\x00\x10\x00\x15\x00\x0a\x00\x05\x00\x0d\x00\x1b\x00\x0a\x00\x19\x00\x1a\x00\x19\x00\x1a\x00\x01\x00\x22\x00\x14\x00\x04\x00\x01\x00\x02\x00\x07\x00\x04\x00\x01\x00\x0a\x00\x07\x00\x04\x00\x1c\x00\x0c\x00\x07\x00\x03\x00\x03\x00\x1f\x00\x22\x00\x12\x00\x08\x00\x08\x00\x24\x00\x03\x00\x18\x00\x03\x00\x18\x00\x07\x00\x1c\x00\x07\x00\x1c\x00\x03\x00\x18\x00\x0c\x00\x1e\x00\x07\x00\x1c\x00\x0c\x00\x22\x00\x18\x00\x18\x00\x12\x00\x12\x00\x03\x00\x0c\x00\x00\x00\x0c\x00\x03\x00\x1d\x00\x00\x00\x03\x00\x19\x00\x19\x00\x18\x00\x03\x00\x03\x00\x01\x00\x01\x00\x0c\x00\x1d\x00\x06\x00\x1e\x00\x00\x00\x1e\x00\x1d\x00\x0c\x00\x19\x00\x18\x00\x05\x00\x15\x00\x14\x00\x06\x00\x0c\x00\x04\x00\x03\x00\x11\x00\x13\x00\x12\x00\x08\x00\x03\x00\x08\x00\x02\x00\x15\x00\x13\x00\x02\x00\x02\x00\x06\x00\x02\x00\x02\x00\x16\x00\x03\x00\x03\x00\x08\x00\x10\x00\x03\x00\x03\x00\x0f\x00\x03\x00\x03\x00\x03\x00\x22\x00\x04\x00\x22\x00\x05\x00\x1f\x00\x01\x00\x04\x00\xff\xff\x22\x00\x22\x00\xff\xff\x06\x00\x16\x00\x07\x00\x24\x00\x01\x00\x06\x00\x09\x00\xff\xff\xff\xff\x1f\x00\x0a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\x09\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\x24\x00\xff\xff\x24\x00\x12\x00\x24\x00\xff\xff\xff\xff\x12\x00\x24\x00\x12\x00\x24\x00\xff\xff\x20\x00\x24\x00\x24\x00\x22\x00\x1d\x00\xff\xff\x24\x00\x24\x00\x20\x00\x15\x00\x24\x00\x13\x00\xff\xff\x1f\x00\x24\x00\x18\x00\x24\x00\x24\x00\x22\x00\x24\x00\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# + +happyTable :: HappyAddr +happyTable = HappyA# "\x00\x00\xcb\x00\x4a\x00\x30\x00\xa9\x00\x4b\x00\xa4\x00\xc9\x00\x4c\x00\x31\x00\xc3\x00\x30\x00\x99\x00\x32\x00\x29\x00\x33\x00\x34\x00\x31\x00\x4f\x00\x21\x00\x59\x00\x32\x00\x21\x00\x33\x00\x34\x00\x3f\x00\x6c\x00\xc7\x00\x1d\x00\x3d\x00\x24\x00\x6c\x00\x24\x00\x1d\x00\x35\x00\xff\xff\x24\x00\xff\xff\x24\x00\x24\x00\x35\x00\x1d\x00\x35\x00\x7f\x00\x24\x00\x24\x00\x22\x00\x29\x00\x2a\x00\x1d\x00\x2b\x00\x29\x00\x2a\x00\xb3\x00\x2b\x00\xc5\x00\xc5\x00\x29\x00\x2a\x00\xa0\x00\x2b\x00\x2c\x00\x2d\x00\x24\x00\x24\x00\x2c\x00\x2d\x00\x35\x00\xbf\x00\x35\x00\x87\x00\x2c\x00\x2d\x00\x51\x00\x72\x00\x75\x00\x2a\x00\x84\x00\x2b\x00\x6f\x00\x74\x00\x29\x00\x2a\x00\x35\x00\x2b\x00\x46\x00\x8d\x00\x47\x00\x4d\x00\x76\x00\x2d\x00\x9a\x00\x35\x00\x35\x00\x35\x00\x2c\x00\x2d\x00\x51\x00\x77\x00\x24\x00\x4c\x00\xff\xff\x4d\x00\x52\x00\x2e\x00\x1d\x00\x35\x00\x48\x00\x24\x00\xc1\x00\xaf\xff\x4d\x00\x96\x00\x36\x00\x29\x00\x2a\x00\xbd\x00\x2b\x00\x29\x00\x2a\x00\x7c\x00\x2b\x00\x29\x00\x2a\x00\xaf\xff\x2b\x00\x3c\x00\x79\x00\xa9\x00\x2d\x00\x24\x00\xb7\x00\xaa\x00\x2d\x00\x1d\x00\x25\x00\x99\x00\x2d\x00\x29\x00\x2a\x00\x24\x00\x2b\x00\x40\x00\x41\x00\x42\x00\x43\x00\x40\x00\x41\x00\x42\x00\x43\x00\xc3\x00\x4a\x00\x3f\x00\x2d\x00\x4b\x00\xae\x00\x24\x00\x4c\x00\xbb\x00\x68\x00\x40\x00\x41\x00\x42\x00\x43\x00\x4f\x00\x25\x00\xad\x00\x24\x00\x4f\x00\x24\x00\xbb\x00\x70\x00\xbd\x00\x44\x00\xc7\x00\x50\x00\x25\x00\x85\x00\x25\x00\x26\x00\x4a\x00\x24\x00\xb5\x00\x4b\x00\x4a\x00\xa8\x00\x4c\x00\x4b\x00\x4a\x00\x7f\x00\x4c\x00\x4b\x00\xc1\x00\x8a\x00\x4c\x00\x53\x00\x53\x00\x1d\x00\x24\x00\x79\x00\x6e\x00\x54\x00\xff\xff\x55\x00\x1f\x00\x55\x00\x1f\x00\x6d\x00\x80\x00\x6d\x00\x80\x00\x55\x00\x1f\x00\x79\x00\xc9\x00\x56\x00\x20\x00\xb0\x00\x24\x00\xb7\x00\xaf\x00\xb1\x00\xa1\x00\xa5\x00\x79\x00\x7a\x00\x83\x00\x97\x00\x9b\x00\x9c\x00\x5d\x00\x86\x00\x93\x00\x94\x00\x5f\x00\x69\x00\x6a\x00\x73\x00\x79\x00\x64\x00\x6c\x00\x67\x00\x7a\x00\x1d\x00\x1e\x00\x79\x00\x27\x00\x28\x00\x59\x00\x37\x00\x38\x00\x57\x00\x48\x00\x5b\x00\xbf\x00\x3b\x00\x39\x00\x3a\x00\xba\x00\xb5\x00\xb9\x00\xac\x00\x59\x00\x5b\x00\xad\x00\xb4\x00\xa5\x00\xa7\x00\x89\x00\xa3\x00\x82\x00\x83\x00\x8c\x00\x8b\x00\x8f\x00\x90\x00\x8d\x00\x91\x00\x92\x00\x93\x00\x24\x00\x9e\x00\x24\x00\x96\x00\x1d\x00\xa0\x00\x5f\x00\x00\x00\x24\x00\x24\x00\x00\x00\x61\x00\x9f\x00\x62\x00\xff\xff\x67\x00\x64\x00\x63\x00\x00\x00\x00\x00\x1d\x00\x66\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\x7e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\xff\xff\x00\x00\xff\xff\x72\x00\xff\xff\x00\x00\x00\x00\x79\x00\xff\xff\x7d\x00\xff\xff\x00\x00\x35\x00\xff\xff\xff\xff\x24\x00\x6c\x00\x00\x00\xff\xff\xff\xff\x35\x00\x59\x00\xff\xff\x5b\x00\x00\x00\x1d\x00\xff\xff\x5d\x00\xff\xff\xff\xff\x24\x00\xad\xff\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# + +happyReduceArr = array (27, 90) [ + (27 , happyReduce_27), + (28 , happyReduce_28), + (29 , happyReduce_29), + (30 , happyReduce_30), + (31 , happyReduce_31), + (32 , happyReduce_32), + (33 , happyReduce_33), + (34 , happyReduce_34), + (35 , happyReduce_35), + (36 , happyReduce_36), + (37 , happyReduce_37), + (38 , happyReduce_38), + (39 , happyReduce_39), + (40 , happyReduce_40), + (41 , happyReduce_41), + (42 , happyReduce_42), + (43 , happyReduce_43), + (44 , happyReduce_44), + (45 , happyReduce_45), + (46 , happyReduce_46), + (47 , happyReduce_47), + (48 , happyReduce_48), + (49 , happyReduce_49), + (50 , happyReduce_50), + (51 , happyReduce_51), + (52 , happyReduce_52), + (53 , happyReduce_53), + (54 , happyReduce_54), + (55 , happyReduce_55), + (56 , happyReduce_56), + (57 , happyReduce_57), + (58 , happyReduce_58), + (59 , happyReduce_59), + (60 , happyReduce_60), + (61 , happyReduce_61), + (62 , happyReduce_62), + (63 , happyReduce_63), + (64 , happyReduce_64), + (65 , happyReduce_65), + (66 , happyReduce_66), + (67 , happyReduce_67), + (68 , happyReduce_68), + (69 , happyReduce_69), + (70 , happyReduce_70), + (71 , happyReduce_71), + (72 , happyReduce_72), + (73 , happyReduce_73), + (74 , happyReduce_74), + (75 , happyReduce_75), + (76 , happyReduce_76), + (77 , happyReduce_77), + (78 , happyReduce_78), + (79 , happyReduce_79), + (80 , happyReduce_80), + (81 , happyReduce_81), + (82 , happyReduce_82), + (83 , happyReduce_83), + (84 , happyReduce_84), + (85 , happyReduce_85), + (86 , happyReduce_86), + (87 , happyReduce_87), + (88 , happyReduce_88), + (89 , happyReduce_89), + (90 , happyReduce_90) + ] + +happy_n_terms = 37 :: Int +happy_n_nonterms = 31 :: Int + +happyReduce_27 = happySpecReduce_1 0# happyReduction_27 +happyReduction_27 happy_x_1 + = case happyOutTok happy_x_1 of { (PT _ (TL happy_var_1)) -> + happyIn30 + (happy_var_1 + )} + +happyReduce_28 = happySpecReduce_1 1# happyReduction_28 +happyReduction_28 happy_x_1 + = case happyOutTok happy_x_1 of { (PT _ (TI happy_var_1)) -> + happyIn31 + ((read happy_var_1) :: Integer + )} + +happyReduce_29 = happySpecReduce_1 2# happyReduction_29 +happyReduction_29 happy_x_1 + = case happyOutTok happy_x_1 of { (PT _ (TD happy_var_1)) -> + happyIn32 + ((read happy_var_1) :: Double + )} + +happyReduce_30 = happySpecReduce_1 3# happyReduction_30 +happyReduction_30 happy_x_1 + = case happyOutTok happy_x_1 of { (PT _ (T_CId happy_var_1)) -> + happyIn33 + (CId (happy_var_1) + )} + +happyReduce_31 = happyReduce 9# 4# happyReduction_31 +happyReduction_31 (happy_x_9 `HappyStk` + happy_x_8 `HappyStk` + happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut33 happy_x_2 of { happy_var_2 -> + case happyOut52 happy_x_4 of { happy_var_4 -> + case happyOut35 happy_x_7 of { happy_var_7 -> + case happyOut47 happy_x_9 of { happy_var_9 -> + happyIn34 + (Grm happy_var_2 happy_var_4 happy_var_7 (reverse happy_var_9) + ) `HappyStk` happyRest}}}} + +happyReduce_32 = happyReduce 9# 5# happyReduction_32 +happyReduction_32 (happy_x_9 `HappyStk` + happy_x_8 `HappyStk` + happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut48 happy_x_4 of { happy_var_4 -> + case happyOut50 happy_x_6 of { happy_var_6 -> + case happyOut49 happy_x_8 of { happy_var_8 -> + happyIn35 + (Abs (reverse happy_var_4) (reverse happy_var_6) (reverse happy_var_8) + ) `HappyStk` happyRest}}} + +happyReduce_33 = happyReduce 16# 6# happyReduction_33 +happyReduction_33 (happy_x_16 `HappyStk` + happy_x_15 `HappyStk` + happy_x_14 `HappyStk` + happy_x_13 `HappyStk` + happy_x_12 `HappyStk` + happy_x_11 `HappyStk` + happy_x_10 `HappyStk` + happy_x_9 `HappyStk` + happy_x_8 `HappyStk` + happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut33 happy_x_2 of { happy_var_2 -> + case happyOut48 happy_x_5 of { happy_var_5 -> + case happyOut51 happy_x_7 of { happy_var_7 -> + case happyOut51 happy_x_9 of { happy_var_9 -> + case happyOut51 happy_x_11 of { happy_var_11 -> + case happyOut51 happy_x_13 of { happy_var_13 -> + case happyOut51 happy_x_15 of { happy_var_15 -> + happyIn36 + (Cnc happy_var_2 (reverse happy_var_5) (reverse happy_var_7) (reverse happy_var_9) (reverse happy_var_11) (reverse happy_var_13) (reverse happy_var_15) + ) `HappyStk` happyRest}}}}}}} + +happyReduce_34 = happySpecReduce_3 7# happyReduction_34 +happyReduction_34 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut30 happy_x_3 of { happy_var_3 -> + happyIn37 + (Flg happy_var_1 happy_var_3 + )}} + +happyReduce_35 = happyReduce 4# 8# happyReduction_35 +happyReduction_35 (happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut59 happy_x_3 of { happy_var_3 -> + happyIn38 + (Cat happy_var_1 (reverse happy_var_3) + ) `HappyStk` happyRest}} + +happyReduce_36 = happyReduce 5# 9# happyReduction_36 +happyReduction_36 (happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut41 happy_x_3 of { happy_var_3 -> + case happyOut42 happy_x_5 of { happy_var_5 -> + happyIn39 + (Fun happy_var_1 happy_var_3 happy_var_5 + ) `HappyStk` happyRest}}} + +happyReduce_37 = happySpecReduce_3 10# happyReduction_37 +happyReduction_37 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut44 happy_x_3 of { happy_var_3 -> + happyIn40 + (Lin happy_var_1 happy_var_3 + )}} + +happyReduce_38 = happySpecReduce_3 11# happyReduction_38 +happyReduction_38 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut52 happy_x_1 of { happy_var_1 -> + case happyOut33 happy_x_3 of { happy_var_3 -> + happyIn41 + (Typ happy_var_1 happy_var_3 + )}} + +happyReduce_39 = happyReduce 5# 11# happyReduction_39 +happyReduction_39 (happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut59 happy_x_2 of { happy_var_2 -> + case happyOut33 happy_x_4 of { happy_var_4 -> + case happyOut54 happy_x_5 of { happy_var_5 -> + happyIn41 + (DTyp (reverse happy_var_2) happy_var_4 (reverse happy_var_5) + ) `HappyStk` happyRest}}} + +happyReduce_40 = happyReduce 4# 12# happyReduction_40 +happyReduction_40 (happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut43 happy_x_2 of { happy_var_2 -> + case happyOut54 happy_x_3 of { happy_var_3 -> + happyIn42 + (Tr happy_var_2 (reverse happy_var_3) + ) `HappyStk` happyRest}} + +happyReduce_41 = happyReduce 7# 12# happyReduction_41 +happyReduction_41 (happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut52 happy_x_3 of { happy_var_3 -> + case happyOut43 happy_x_5 of { happy_var_5 -> + case happyOut54 happy_x_6 of { happy_var_6 -> + happyIn42 + (DTr happy_var_3 happy_var_5 (reverse happy_var_6) + ) `HappyStk` happyRest}}} + +happyReduce_42 = happySpecReduce_3 12# happyReduction_42 +happyReduction_42 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut60 happy_x_2 of { happy_var_2 -> + happyIn42 + (EEq (reverse happy_var_2) + )} + +happyReduce_43 = happySpecReduce_1 13# happyReduction_43 +happyReduction_43 happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + happyIn43 + (AC happy_var_1 + )} + +happyReduce_44 = happySpecReduce_1 13# happyReduction_44 +happyReduction_44 happy_x_1 + = case happyOut30 happy_x_1 of { happy_var_1 -> + happyIn43 + (AS happy_var_1 + )} + +happyReduce_45 = happySpecReduce_1 13# happyReduction_45 +happyReduction_45 happy_x_1 + = case happyOut31 happy_x_1 of { happy_var_1 -> + happyIn43 + (AI happy_var_1 + )} + +happyReduce_46 = happySpecReduce_1 13# happyReduction_46 +happyReduction_46 happy_x_1 + = case happyOut32 happy_x_1 of { happy_var_1 -> + happyIn43 + (AF happy_var_1 + )} + +happyReduce_47 = happySpecReduce_2 13# happyReduction_47 +happyReduction_47 happy_x_2 + happy_x_1 + = case happyOut31 happy_x_2 of { happy_var_2 -> + happyIn43 + (AM happy_var_2 + )} + +happyReduce_48 = happySpecReduce_2 13# happyReduction_48 +happyReduction_48 happy_x_2 + happy_x_1 + = case happyOut33 happy_x_2 of { happy_var_2 -> + happyIn43 + (AV happy_var_2 + )} + +happyReduce_49 = happySpecReduce_3 14# happyReduction_49 +happyReduction_49 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut53 happy_x_2 of { happy_var_2 -> + happyIn44 + (R happy_var_2 + )} + +happyReduce_50 = happyReduce 5# 14# happyReduction_50 +happyReduction_50 (happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut44 happy_x_2 of { happy_var_2 -> + case happyOut44 happy_x_4 of { happy_var_4 -> + happyIn44 + (P happy_var_2 happy_var_4 + ) `HappyStk` happyRest}} + +happyReduce_51 = happySpecReduce_3 14# happyReduction_51 +happyReduction_51 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut53 happy_x_2 of { happy_var_2 -> + happyIn44 + (S happy_var_2 + )} + +happyReduce_52 = happySpecReduce_1 14# happyReduction_52 +happyReduction_52 happy_x_1 + = case happyOut45 happy_x_1 of { happy_var_1 -> + happyIn44 + (K happy_var_1 + )} + +happyReduce_53 = happySpecReduce_2 14# happyReduction_53 +happyReduction_53 happy_x_2 + happy_x_1 + = case happyOut31 happy_x_2 of { happy_var_2 -> + happyIn44 + (V (fromInteger happy_var_2) --H + )} + +happyReduce_54 = happySpecReduce_1 14# happyReduction_54 +happyReduction_54 happy_x_1 + = case happyOut31 happy_x_1 of { happy_var_1 -> + happyIn44 + (C (fromInteger happy_var_1) --H + )} + +happyReduce_55 = happySpecReduce_1 14# happyReduction_55 +happyReduction_55 happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + happyIn44 + (F happy_var_1 + )} + +happyReduce_56 = happySpecReduce_3 14# happyReduction_56 +happyReduction_56 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut53 happy_x_2 of { happy_var_2 -> + happyIn44 + (FV happy_var_2 + )} + +happyReduce_57 = happyReduce 5# 14# happyReduction_57 +happyReduction_57 (happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut30 happy_x_2 of { happy_var_2 -> + case happyOut44 happy_x_4 of { happy_var_4 -> + happyIn44 + (W happy_var_2 happy_var_4 + ) `HappyStk` happyRest}} + +happyReduce_58 = happySpecReduce_1 14# happyReduction_58 +happyReduction_58 happy_x_1 + = happyIn44 + (TM + ) + +happyReduce_59 = happySpecReduce_1 15# happyReduction_59 +happyReduction_59 happy_x_1 + = case happyOut30 happy_x_1 of { happy_var_1 -> + happyIn45 + (KS happy_var_1 + )} + +happyReduce_60 = happyReduce 7# 15# happyReduction_60 +happyReduction_60 (happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut55 happy_x_3 of { happy_var_3 -> + case happyOut56 happy_x_5 of { happy_var_5 -> + happyIn45 + (KP (reverse happy_var_3) happy_var_5 + ) `HappyStk` happyRest}} + +happyReduce_61 = happySpecReduce_3 16# happyReduction_61 +happyReduction_61 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut55 happy_x_1 of { happy_var_1 -> + case happyOut55 happy_x_3 of { happy_var_3 -> + happyIn46 + (Var (reverse happy_var_1) (reverse happy_var_3) + )}} + +happyReduce_62 = happySpecReduce_0 17# happyReduction_62 +happyReduction_62 = happyIn47 + ([] + ) + +happyReduce_63 = happySpecReduce_3 17# happyReduction_63 +happyReduction_63 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut47 happy_x_1 of { happy_var_1 -> + case happyOut36 happy_x_2 of { happy_var_2 -> + happyIn47 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_64 = happySpecReduce_0 18# happyReduction_64 +happyReduction_64 = happyIn48 + ([] + ) + +happyReduce_65 = happySpecReduce_3 18# happyReduction_65 +happyReduction_65 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut48 happy_x_1 of { happy_var_1 -> + case happyOut37 happy_x_2 of { happy_var_2 -> + happyIn48 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_66 = happySpecReduce_0 19# happyReduction_66 +happyReduction_66 = happyIn49 + ([] + ) + +happyReduce_67 = happySpecReduce_3 19# happyReduction_67 +happyReduction_67 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut49 happy_x_1 of { happy_var_1 -> + case happyOut38 happy_x_2 of { happy_var_2 -> + happyIn49 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_68 = happySpecReduce_0 20# happyReduction_68 +happyReduction_68 = happyIn50 + ([] + ) + +happyReduce_69 = happySpecReduce_3 20# happyReduction_69 +happyReduction_69 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut50 happy_x_1 of { happy_var_1 -> + case happyOut39 happy_x_2 of { happy_var_2 -> + happyIn50 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_70 = happySpecReduce_0 21# happyReduction_70 +happyReduction_70 = happyIn51 + ([] + ) + +happyReduce_71 = happySpecReduce_3 21# happyReduction_71 +happyReduction_71 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut51 happy_x_1 of { happy_var_1 -> + case happyOut40 happy_x_2 of { happy_var_2 -> + happyIn51 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_72 = happySpecReduce_0 22# happyReduction_72 +happyReduction_72 = happyIn52 + ([] + ) + +happyReduce_73 = happySpecReduce_1 22# happyReduction_73 +happyReduction_73 happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + happyIn52 + ((:[]) happy_var_1 + )} + +happyReduce_74 = happySpecReduce_3 22# happyReduction_74 +happyReduction_74 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut52 happy_x_3 of { happy_var_3 -> + happyIn52 + ((:) happy_var_1 happy_var_3 + )}} + +happyReduce_75 = happySpecReduce_0 23# happyReduction_75 +happyReduction_75 = happyIn53 + ([] + ) + +happyReduce_76 = happySpecReduce_1 23# happyReduction_76 +happyReduction_76 happy_x_1 + = case happyOut44 happy_x_1 of { happy_var_1 -> + happyIn53 + ((:[]) happy_var_1 + )} + +happyReduce_77 = happySpecReduce_3 23# happyReduction_77 +happyReduction_77 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut44 happy_x_1 of { happy_var_1 -> + case happyOut53 happy_x_3 of { happy_var_3 -> + happyIn53 + ((:) happy_var_1 happy_var_3 + )}} + +happyReduce_78 = happySpecReduce_0 24# happyReduction_78 +happyReduction_78 = happyIn54 + ([] + ) + +happyReduce_79 = happySpecReduce_2 24# happyReduction_79 +happyReduction_79 happy_x_2 + happy_x_1 + = case happyOut54 happy_x_1 of { happy_var_1 -> + case happyOut42 happy_x_2 of { happy_var_2 -> + happyIn54 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_80 = happySpecReduce_0 25# happyReduction_80 +happyReduction_80 = happyIn55 + ([] + ) + +happyReduce_81 = happySpecReduce_2 25# happyReduction_81 +happyReduction_81 happy_x_2 + happy_x_1 + = case happyOut55 happy_x_1 of { happy_var_1 -> + case happyOut30 happy_x_2 of { happy_var_2 -> + happyIn55 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_82 = happySpecReduce_0 26# happyReduction_82 +happyReduction_82 = happyIn56 + ([] + ) + +happyReduce_83 = happySpecReduce_1 26# happyReduction_83 +happyReduction_83 happy_x_1 + = case happyOut46 happy_x_1 of { happy_var_1 -> + happyIn56 + ((:[]) happy_var_1 + )} + +happyReduce_84 = happySpecReduce_3 26# happyReduction_84 +happyReduction_84 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut46 happy_x_1 of { happy_var_1 -> + case happyOut56 happy_x_3 of { happy_var_3 -> + happyIn56 + ((:) happy_var_1 happy_var_3 + )}} + +happyReduce_85 = happySpecReduce_3 27# happyReduction_85 +happyReduction_85 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut33 happy_x_1 of { happy_var_1 -> + case happyOut41 happy_x_3 of { happy_var_3 -> + happyIn57 + (Hyp happy_var_1 happy_var_3 + )}} + +happyReduce_86 = happySpecReduce_3 28# happyReduction_86 +happyReduction_86 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut54 happy_x_1 of { happy_var_1 -> + case happyOut42 happy_x_3 of { happy_var_3 -> + happyIn58 + (Equ (reverse happy_var_1) happy_var_3 + )}} + +happyReduce_87 = happySpecReduce_0 29# happyReduction_87 +happyReduction_87 = happyIn59 + ([] + ) + +happyReduce_88 = happySpecReduce_3 29# happyReduction_88 +happyReduction_88 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut59 happy_x_1 of { happy_var_1 -> + case happyOut57 happy_x_2 of { happy_var_2 -> + happyIn59 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyReduce_89 = happySpecReduce_0 30# happyReduction_89 +happyReduction_89 = happyIn60 + ([] + ) + +happyReduce_90 = happySpecReduce_3 30# happyReduction_90 +happyReduction_90 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut60 happy_x_1 of { happy_var_1 -> + case happyOut58 happy_x_2 of { happy_var_2 -> + happyIn60 + (flip (:) happy_var_1 happy_var_2 + )}} + +happyNewToken action sts stk [] = + happyDoAction 36# notHappyAtAll action sts stk [] + +happyNewToken action sts stk (tk:tks) = + let cont i = happyDoAction i tk action sts stk tks in + case tk of { + PT _ (TS "(") -> cont 1#; + PT _ (TS ")") -> cont 2#; + PT _ (TS ";") -> cont 3#; + PT _ (TS "{") -> cont 4#; + PT _ (TS "}") -> cont 5#; + PT _ (TS "=") -> cont 6#; + PT _ (TS "[") -> cont 7#; + PT _ (TS "]") -> cont 8#; + PT _ (TS ":") -> cont 9#; + PT _ (TS "->") -> cont 10#; + PT _ (TS "?") -> cont 11#; + PT _ (TS "!") -> cont 12#; + PT _ (TS "$") -> cont 13#; + PT _ (TS "[|") -> cont 14#; + PT _ (TS "|]") -> cont 15#; + PT _ (TS "+") -> cont 16#; + PT _ (TS "/") -> cont 17#; + PT _ (TS ",") -> cont 18#; + PT _ (TS "abstract") -> cont 19#; + PT _ (TS "cat") -> cont 20#; + PT _ (TS "concrete") -> cont 21#; + PT _ (TS "flags") -> cont 22#; + PT _ (TS "fun") -> cont 23#; + PT _ (TS "grammar") -> cont 24#; + PT _ (TS "lin") -> cont 25#; + PT _ (TS "lincat") -> cont 26#; + PT _ (TS "lindef") -> cont 27#; + PT _ (TS "oper") -> cont 28#; + PT _ (TS "pre") -> cont 29#; + PT _ (TS "printname") -> cont 30#; + PT _ (TL happy_dollar_dollar) -> cont 31#; + PT _ (TI happy_dollar_dollar) -> cont 32#; + PT _ (TD happy_dollar_dollar) -> cont 33#; + PT _ (T_CId happy_dollar_dollar) -> cont 34#; + _ -> cont 35#; + _ -> happyError' (tk:tks) + } + +happyError_ tk tks = happyError' (tk:tks) + +happyThen :: () => Err a -> (a -> Err b) -> Err b +happyThen = (thenM) +happyReturn :: () => a -> Err a +happyReturn = (returnM) +happyThen1 m k tks = (thenM) m (\a -> k a tks) +happyReturn1 :: () => a -> b -> Err a +happyReturn1 = \a tks -> (returnM) a +happyError' :: () => [Token] -> Err a +happyError' = happyError + +pGrammar tks = happySomeParser where + happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut34 x)) + +pAbstract tks = happySomeParser where + happySomeParser = happyThen (happyParse 1# tks) (\x -> happyReturn (happyOut35 x)) + +pConcrete tks = happySomeParser where + happySomeParser = happyThen (happyParse 2# tks) (\x -> happyReturn (happyOut36 x)) + +pFlag tks = happySomeParser where + happySomeParser = happyThen (happyParse 3# tks) (\x -> happyReturn (happyOut37 x)) + +pCatDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 4# tks) (\x -> happyReturn (happyOut38 x)) + +pFunDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 5# tks) (\x -> happyReturn (happyOut39 x)) + +pLinDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 6# tks) (\x -> happyReturn (happyOut40 x)) + +pType tks = happySomeParser where + happySomeParser = happyThen (happyParse 7# tks) (\x -> happyReturn (happyOut41 x)) + +pExp tks = happySomeParser where + happySomeParser = happyThen (happyParse 8# tks) (\x -> happyReturn (happyOut42 x)) + +pAtom tks = happySomeParser where + happySomeParser = happyThen (happyParse 9# tks) (\x -> happyReturn (happyOut43 x)) + +pTerm tks = happySomeParser where + happySomeParser = happyThen (happyParse 10# tks) (\x -> happyReturn (happyOut44 x)) + +pTokn tks = happySomeParser where + happySomeParser = happyThen (happyParse 11# tks) (\x -> happyReturn (happyOut45 x)) + +pVariant tks = happySomeParser where + happySomeParser = happyThen (happyParse 12# tks) (\x -> happyReturn (happyOut46 x)) + +pListConcrete tks = happySomeParser where + happySomeParser = happyThen (happyParse 13# tks) (\x -> happyReturn (happyOut47 x)) + +pListFlag tks = happySomeParser where + happySomeParser = happyThen (happyParse 14# tks) (\x -> happyReturn (happyOut48 x)) + +pListCatDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 15# tks) (\x -> happyReturn (happyOut49 x)) + +pListFunDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 16# tks) (\x -> happyReturn (happyOut50 x)) + +pListLinDef tks = happySomeParser where + happySomeParser = happyThen (happyParse 17# tks) (\x -> happyReturn (happyOut51 x)) + +pListCId tks = happySomeParser where + happySomeParser = happyThen (happyParse 18# tks) (\x -> happyReturn (happyOut52 x)) + +pListTerm tks = happySomeParser where + happySomeParser = happyThen (happyParse 19# tks) (\x -> happyReturn (happyOut53 x)) + +pListExp tks = happySomeParser where + happySomeParser = happyThen (happyParse 20# tks) (\x -> happyReturn (happyOut54 x)) + +pListString tks = happySomeParser where + happySomeParser = happyThen (happyParse 21# tks) (\x -> happyReturn (happyOut55 x)) + +pListVariant tks = happySomeParser where + happySomeParser = happyThen (happyParse 22# tks) (\x -> happyReturn (happyOut56 x)) + +pHypo tks = happySomeParser where + happySomeParser = happyThen (happyParse 23# tks) (\x -> happyReturn (happyOut57 x)) + +pEquation tks = happySomeParser where + happySomeParser = happyThen (happyParse 24# tks) (\x -> happyReturn (happyOut58 x)) + +pListHypo tks = happySomeParser where + happySomeParser = happyThen (happyParse 25# tks) (\x -> happyReturn (happyOut59 x)) + +pListEquation tks = happySomeParser where + happySomeParser = happyThen (happyParse 26# tks) (\x -> happyReturn (happyOut60 x)) + +happySeq = happyDontSeq + + +returnM :: a -> Err a +returnM = return + +thenM :: Err a -> (a -> Err b) -> Err b +thenM = (>>=) + +happyError :: [Token] -> Err a +happyError ts = + Bad $ "syntax error at " ++ tokenPos ts ++ + case ts of + [] -> [] + [Err _] -> " due to lexer error" + _ -> " before " ++ unwords (map prToken (take 4 ts)) + +myLexer = tokens +{-# LINE 1 "GenericTemplate.hs" #-} +{-# LINE 1 "<built-in>" #-} +{-# LINE 1 "<command line>" #-} +{-# LINE 1 "GenericTemplate.hs" #-} +-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp + +{-# LINE 28 "GenericTemplate.hs" #-} + + +data Happy_IntList = HappyCons Int# Happy_IntList + + + + + +{-# LINE 49 "GenericTemplate.hs" #-} + +{-# LINE 59 "GenericTemplate.hs" #-} + +{-# LINE 68 "GenericTemplate.hs" #-} + +infixr 9 `HappyStk` +data HappyStk a = HappyStk a (HappyStk a) + +----------------------------------------------------------------------------- +-- starting the parse + +happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll + +----------------------------------------------------------------------------- +-- Accepting the parse + +-- If the current token is 0#, it means we've just accepted a partial +-- parse (a %partial parser). We must ignore the saved token on the top of +-- the stack in this case. +happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) = + happyReturn1 ans +happyAccept j tk st sts (HappyStk ans _) = + (happyTcHack j (happyTcHack st)) (happyReturn1 ans) + +----------------------------------------------------------------------------- +-- Arrays only: do the next action + + + +happyDoAction i tk st + = {- nothing -} + + + case action of + 0# -> {- nothing -} + happyFail i tk st + -1# -> {- nothing -} + happyAccept i tk st + n | (n <# (0# :: Int#)) -> {- nothing -} + + (happyReduceArr ! rule) i tk st + where rule = (I# ((negateInt# ((n +# (1# :: Int#)))))) + n -> {- nothing -} + + + happyShift new_state i tk st + where new_state = (n -# (1# :: Int#)) + where off = indexShortOffAddr happyActOffsets st + off_i = (off +# i) + check = if (off_i >=# (0# :: Int#)) + then (indexShortOffAddr happyCheck off_i ==# i) + else False + action | check = indexShortOffAddr happyTable off_i + | otherwise = indexShortOffAddr happyDefActions st + +{-# LINE 127 "GenericTemplate.hs" #-} + + +indexShortOffAddr (HappyA# arr) off = +#if __GLASGOW_HASKELL__ > 500 + narrow16Int# i +#elif __GLASGOW_HASKELL__ == 500 + intToInt16# i +#else + (i `iShiftL#` 16#) `iShiftRA#` 16# +#endif + where +#if __GLASGOW_HASKELL__ >= 503 + i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low) +#else + i = word2Int# ((high `shiftL#` 8#) `or#` low) +#endif + high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) + low = int2Word# (ord# (indexCharOffAddr# arr off')) + off' = off *# 2# + + + + + +data HappyAddr = HappyA# Addr# + + + + +----------------------------------------------------------------------------- +-- HappyState data type (not arrays) + +{-# LINE 170 "GenericTemplate.hs" #-} + +----------------------------------------------------------------------------- +-- Shifting a token + +happyShift new_state 0# tk st sts stk@(x `HappyStk` _) = + let i = (case unsafeCoerce# x of { (I# (i)) -> i }) in +-- trace "shifting the error token" $ + happyDoAction i tk new_state (HappyCons (st) (sts)) (stk) + +happyShift new_state i tk st sts stk = + happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk) + +-- happyReduce is specialised for the common cases. + +happySpecReduce_0 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_0 nt fn j tk st@((action)) sts stk + = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk) + +happySpecReduce_1 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk') + = let r = fn v1 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happySpecReduce_2 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk') + = let r = fn v1 v2 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happySpecReduce_3 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk') + = let r = fn v1 v2 v3 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happyReduce k i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyReduce k nt fn j tk st sts stk + = case happyDrop (k -# (1# :: Int#)) sts of + sts1@((HappyCons (st1@(action)) (_))) -> + let r = fn stk in -- it doesn't hurt to always seq here... + happyDoSeq r (happyGoto nt j tk st1 sts1 r) + +happyMonadReduce k nt fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyMonadReduce k nt fn j tk st sts stk = + happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk)) + where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts)) + drop_stk = happyDropStk k stk + +happyMonad2Reduce k nt fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyMonad2Reduce k nt fn j tk st sts stk = + happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk)) + where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts)) + drop_stk = happyDropStk k stk + + off = indexShortOffAddr happyGotoOffsets st1 + off_i = (off +# nt) + new_state = indexShortOffAddr happyTable off_i + + + + +happyDrop 0# l = l +happyDrop n (HappyCons (_) (t)) = happyDrop (n -# (1# :: Int#)) t + +happyDropStk 0# l = l +happyDropStk n (x `HappyStk` xs) = happyDropStk (n -# (1#::Int#)) xs + +----------------------------------------------------------------------------- +-- Moving to a new state after a reduction + + +happyGoto nt j tk st = + {- nothing -} + happyDoAction j tk new_state + where off = indexShortOffAddr happyGotoOffsets st + off_i = (off +# nt) + new_state = indexShortOffAddr happyTable off_i + + + + +----------------------------------------------------------------------------- +-- Error recovery (0# is the error token) + +-- parse error if we are in recovery and we fail again +happyFail 0# tk old_st _ stk = +-- trace "failing" $ + happyError_ tk + +{- We don't need state discarding for our restricted implementation of + "error". In fact, it can cause some bogus parses, so I've disabled it + for now --SDM + +-- discard a state +happyFail 0# tk old_st (HappyCons ((action)) (sts)) + (saved_tok `HappyStk` _ `HappyStk` stk) = +-- trace ("discarding state, depth " ++ show (length stk)) $ + happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk)) +-} + +-- Enter error recovery: generate an error token, +-- save the old token and carry on. +happyFail i tk (action) sts stk = +-- trace "entering error recovery" $ + happyDoAction 0# tk action sts ( (unsafeCoerce# (I# (i))) `HappyStk` stk) + +-- Internal happy errors: + +notHappyAtAll = error "Internal Happy error\n" + +----------------------------------------------------------------------------- +-- Hack to get the typechecker to accept our action functions + + +happyTcHack :: Int# -> a -> a +happyTcHack x y = y +{-# INLINE happyTcHack #-} + + +----------------------------------------------------------------------------- +-- Seq-ing. If the --strict flag is given, then Happy emits +-- happySeq = happyDoSeq +-- otherwise it emits +-- happySeq = happyDontSeq + +happyDoSeq, happyDontSeq :: a -> b -> b +happyDoSeq a b = a `seq` b +happyDontSeq a b = b + +----------------------------------------------------------------------------- +-- Don't inline any functions from the template. GHC has a nasty habit +-- of deciding to inline happyGoto everywhere, which increases the size of +-- the generated parser quite a bit. + + +{-# NOINLINE happyDoAction #-} +{-# NOINLINE happyTable #-} +{-# NOINLINE happyCheck #-} +{-# NOINLINE happyActOffsets #-} +{-# NOINLINE happyGotoOffsets #-} +{-# NOINLINE happyDefActions #-} + +{-# NOINLINE happyShift #-} +{-# NOINLINE happySpecReduce_0 #-} +{-# NOINLINE happySpecReduce_1 #-} +{-# NOINLINE happySpecReduce_2 #-} +{-# NOINLINE happySpecReduce_3 #-} +{-# NOINLINE happyReduce #-} +{-# NOINLINE happyMonadReduce #-} +{-# NOINLINE happyGoto #-} +{-# NOINLINE happyFail #-} + +-- end of Happy Template. diff --git a/src/GF/GFCC/PrintGFCC.hs b/src/GF/GFCC/PrintGFCC.hs new file mode 100644 index 000000000..de3482369 --- /dev/null +++ b/src/GF/GFCC/PrintGFCC.hs @@ -0,0 +1,217 @@ +{-# OPTIONS -fno-warn-incomplete-patterns #-} +module GF.GFCC.PrintGFCC where + +-- pretty-printer generated by the BNF converter + +import GF.GFCC.AbsGFCC +import Char + +-- the top-level printing method +printTree :: Print a => a -> String +printTree = render . prt 0 + +type Doc = [ShowS] -> [ShowS] + +doc :: ShowS -> Doc +doc = (:) + +render :: Doc -> String +render d = rend 0 (map ($ "") $ d []) "" where + rend i ss = case ss of + "[" :ts -> showChar '[' . rend i ts + "(" :ts -> showChar '(' . rend i ts + "{" :ts -> showChar '{' . new (i+1) . rend (i+1) ts + "}" : ";":ts -> new (i-1) . space "}" . showChar ';' . new (i-1) . rend (i-1) ts + "}" :ts -> new (i-1) . showChar '}' . new (i-1) . rend (i-1) ts + ";" :ts -> showChar ';' . new i . rend i ts + t : "," :ts -> showString t . space "," . rend i ts + t : ")" :ts -> showString t . showChar ')' . rend i ts + t : "]" :ts -> showString t . showChar ']' . rend i ts + t :ts -> space t . rend i ts + _ -> id + new i = showChar '\n' . replicateS (2*i) (showChar ' ') . dropWhile isSpace + space t = showString t . (\s -> if null s then "" else (' ':s)) + +parenth :: Doc -> Doc +parenth ss = doc (showChar '(') . ss . doc (showChar ')') + +concatS :: [ShowS] -> ShowS +concatS = foldr (.) id + +concatD :: [Doc] -> Doc +concatD = foldr (.) id + +replicateS :: Int -> ShowS -> ShowS +replicateS n f = concatS (replicate n f) + +-- the printer class does the job +class Print a where + prt :: Int -> a -> Doc + prtList :: [a] -> Doc + prtList = concatD . map (prt 0) + +instance Print a => Print [a] where + prt _ = prtList + +instance Print Char where + prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'') + prtList s = doc (showChar '"' . concatS (map (mkEsc '"') s) . showChar '"') + +mkEsc :: Char -> Char -> ShowS +mkEsc q s = case s of + _ | s == q -> showChar '\\' . showChar s + '\\'-> showString "\\\\" + '\n' -> showString "\\n" + '\t' -> showString "\\t" + _ -> showChar s + +prPrec :: Int -> Int -> Doc -> Doc +prPrec i j = if j<i then parenth else id + + +instance Print Integer where + prt _ x = doc (shows x) + +instance Print Int where --H + prt _ x = doc (shows x) --H + +instance Print Double where + prt _ x = doc (shows x) + + + +instance Print CId where + prt _ (CId i) = doc (showString i) + prtList es = case es of + [] -> (concatD []) + [x] -> (concatD [prt 0 x]) + x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs]) + + + +instance Print Grammar where + prt i e = case e of + Grm cid cids abstract concretes -> prPrec i 0 (concatD [doc (showString "grammar") , prt 0 cid , doc (showString "(") , prt 0 cids , doc (showString ")") , doc (showString ";") , prt 0 abstract , doc (showString ";") , prt 0 concretes]) + + +instance Print Abstract where + prt i e = case e of + Abs flags fundefs catdefs -> prPrec i 0 (concatD [doc (showString "abstract") , doc (showString "{") , doc (showString "flags") , prt 0 flags , doc (showString "fun") , prt 0 fundefs , doc (showString "cat") , prt 0 catdefs , doc (showString "}")]) + + +instance Print Concrete where + prt i e = case e of + Cnc cid flags lindefs0 lindefs1 lindefs2 lindefs3 lindefs -> prPrec i 0 (concatD [doc (showString "concrete") , prt 0 cid , doc (showString "{") , doc (showString "flags") , prt 0 flags , doc (showString "lin") , prt 0 lindefs0 , doc (showString "oper") , prt 0 lindefs1 , doc (showString "lincat") , prt 0 lindefs2 , doc (showString "lindef") , prt 0 lindefs3 , doc (showString "printname") , prt 0 lindefs , doc (showString "}")]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print Flag where + prt i e = case e of + Flg cid str -> prPrec i 0 (concatD [prt 0 cid , doc (showString "=") , prt 0 str]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print CatDef where + prt i e = case e of + Cat cid hypos -> prPrec i 0 (concatD [prt 0 cid , doc (showString "[") , prt 0 hypos , doc (showString "]")]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print FunDef where + prt i e = case e of + Fun cid type' exp -> prPrec i 0 (concatD [prt 0 cid , doc (showString ":") , prt 0 type' , doc (showString "=") , prt 0 exp]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print LinDef where + prt i e = case e of + Lin cid term -> prPrec i 0 (concatD [prt 0 cid , doc (showString "=") , prt 0 term]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print Type where + prt i e = case e of + Typ cids cid -> prPrec i 0 (concatD [prt 0 cids , doc (showString "->") , prt 0 cid]) + DTyp hypos cid exps -> prPrec i 0 (concatD [doc (showString "[") , prt 0 hypos , doc (showString "]") , prt 0 cid , prt 0 exps]) + + +instance Print Exp where + prt i e = case e of + Tr atom exps -> prPrec i 0 (concatD [doc (showString "(") , prt 0 atom , prt 0 exps , doc (showString ")")]) + DTr cids atom exps -> prPrec i 0 (concatD [doc (showString "[") , doc (showString "(") , prt 0 cids , doc (showString ")") , prt 0 atom , prt 0 exps , doc (showString "]")]) + EEq equations -> prPrec i 0 (concatD [doc (showString "{") , prt 0 equations , doc (showString "}")]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , prt 0 xs]) + +instance Print Atom where + prt i e = case e of + AC cid -> prPrec i 0 (concatD [prt 0 cid]) + AS str -> prPrec i 0 (concatD [prt 0 str]) + AI n -> prPrec i 0 (concatD [prt 0 n]) + AF d -> prPrec i 0 (concatD [prt 0 d]) + AM n -> prPrec i 0 (concatD [doc (showString "?") , prt 0 n]) + AV cid -> prPrec i 0 (concatD [doc (showString "$") , prt 0 cid]) + + +instance Print Term where + prt i e = case e of + R terms -> prPrec i 0 (concatD [doc (showString "[") , prt 0 terms , doc (showString "]")]) + P term0 term -> prPrec i 0 (concatD [doc (showString "(") , prt 0 term0 , doc (showString "!") , prt 0 term , doc (showString ")")]) + S terms -> prPrec i 0 (concatD [doc (showString "(") , prt 0 terms , doc (showString ")")]) + K tokn -> prPrec i 0 (concatD [prt 0 tokn]) + V n -> prPrec i 0 (concatD [doc (showString "$") , prt 0 n]) + C n -> prPrec i 0 (concatD [prt 0 n]) + F cid -> prPrec i 0 (concatD [prt 0 cid]) + FV terms -> prPrec i 0 (concatD [doc (showString "[|") , prt 0 terms , doc (showString "|]")]) + W str term -> prPrec i 0 (concatD [doc (showString "(") , prt 0 str , doc (showString "+") , prt 0 term , doc (showString ")")]) + TM -> prPrec i 0 (concatD [doc (showString "?")]) + + prtList es = case es of + [] -> (concatD []) + [x] -> (concatD [prt 0 x]) + x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs]) + +instance Print Tokn where + prt i e = case e of + KS str -> prPrec i 0 (concatD [prt 0 str]) + KP strs variants -> prPrec i 0 (concatD [doc (showString "[") , doc (showString "pre") , prt 0 strs , doc (showString "[") , prt 0 variants , doc (showString "]") , doc (showString "]")]) + + +instance Print Variant where + prt i e = case e of + Var strs0 strs -> prPrec i 0 (concatD [prt 0 strs0 , doc (showString "/") , prt 0 strs]) + + prtList es = case es of + [] -> (concatD []) + [x] -> (concatD [prt 0 x]) + x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs]) + +instance Print Hypo where + prt i e = case e of + Hyp cid type' -> prPrec i 0 (concatD [prt 0 cid , doc (showString ":") , prt 0 type']) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + +instance Print Equation where + prt i e = case e of + Equ exps exp -> prPrec i 0 (concatD [prt 0 exps , doc (showString "->") , prt 0 exp]) + + prtList es = case es of + [] -> (concatD []) + x:xs -> (concatD [prt 0 x , doc (showString ";") , prt 0 xs]) + + diff --git a/src/GF/GFCC/SkelGFCC.hs b/src/GF/GFCC/SkelGFCC.hs new file mode 100644 index 000000000..7d5fb3eab --- /dev/null +++ b/src/GF/GFCC/SkelGFCC.hs @@ -0,0 +1,110 @@ +module GF.GFCC.SkelGFCC where + +-- Haskell module generated by the BNF converter + +import GF.GFCC.AbsGFCC +import GF.GFCC.ErrM +type Result = Err String + +failure :: Show a => a -> Result +failure x = Bad $ "Undefined case: " ++ show x + +transCId :: CId -> Result +transCId x = case x of + CId str -> failure x + + +transGrammar :: Grammar -> Result +transGrammar x = case x of + Grm cid cids abstract concretes -> failure x + + +transAbstract :: Abstract -> Result +transAbstract x = case x of + Abs flags fundefs catdefs -> failure x + + +transConcrete :: Concrete -> Result +transConcrete x = case x of + Cnc cid flags lindefs0 lindefs1 lindefs2 lindefs3 lindefs -> failure x + + +transFlag :: Flag -> Result +transFlag x = case x of + Flg cid str -> failure x + + +transCatDef :: CatDef -> Result +transCatDef x = case x of + Cat cid hypos -> failure x + + +transFunDef :: FunDef -> Result +transFunDef x = case x of + Fun cid type' exp -> failure x + + +transLinDef :: LinDef -> Result +transLinDef x = case x of + Lin cid term -> failure x + + +transType :: Type -> Result +transType x = case x of + Typ cids cid -> failure x + DTyp hypos cid exps -> failure x + + +transExp :: Exp -> Result +transExp x = case x of + Tr atom exps -> failure x + DTr cids atom exps -> failure x + EEq equations -> failure x + + +transAtom :: Atom -> Result +transAtom x = case x of + AC cid -> failure x + AS str -> failure x + AI n -> failure x + AF d -> failure x + AM n -> failure x + AV cid -> failure x + + +transTerm :: Term -> Result +transTerm x = case x of + R terms -> failure x + P term0 term -> failure x + S terms -> failure x + K tokn -> failure x + V n -> failure x + C n -> failure x + F cid -> failure x + FV terms -> failure x + W str term -> failure x + TM -> failure x + + +transTokn :: Tokn -> Result +transTokn x = case x of + KS str -> failure x + KP strs variants -> failure x + + +transVariant :: Variant -> Result +transVariant x = case x of + Var strs0 strs -> failure x + + +transHypo :: Hypo -> Result +transHypo x = case x of + Hyp cid type' -> failure x + + +transEquation :: Equation -> Result +transEquation x = case x of + Equ exps exp -> failure x + + + diff --git a/src/GF/GFCC/TestGFCC.hs b/src/GF/GFCC/TestGFCC.hs new file mode 100644 index 000000000..761e1db5f --- /dev/null +++ b/src/GF/GFCC/TestGFCC.hs @@ -0,0 +1,58 @@ +-- automatically generated by BNF Converter +module Main where + + +import IO ( stdin, hGetContents ) +import System ( getArgs, getProgName ) + +import GF.GFCC.LexGFCC +import GF.GFCC.ParGFCC +import GF.GFCC.SkelGFCC +import GF.GFCC.PrintGFCC +import GF.GFCC.AbsGFCC + + + + +import GF.GFCC.ErrM + +type ParseFun a = [Token] -> Err a + +myLLexer = myLexer + +type Verbosity = Int + +putStrV :: Verbosity -> String -> IO () +putStrV v s = if v > 1 then putStrLn s else return () + +runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO () +runFile v p f = putStrLn f >> readFile f >>= run v p + +run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO () +run v p s = let ts = myLLexer s in case p ts of + Bad s -> do putStrLn "\nParse Failed...\n" + putStrV v "Tokens:" + putStrV v $ show ts + putStrLn s + Ok tree -> do putStrLn "\nParse Successful!" + showTree v tree + + + +showTree :: (Show a, Print a) => Int -> a -> IO () +showTree v tree + = do + putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree + putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree + +main :: IO () +main = do args <- getArgs + case args of + [] -> hGetContents stdin >>= run 2 pGrammar + "-s":fs -> mapM_ (runFile 0 pGrammar) fs + fs -> mapM_ (runFile 2 pGrammar) fs + + + + + |