1 -- automatically generated by BNF Converter
5 import IO ( stdin, hGetContents )
6 import System ( getArgs, getProgName )
16 import Control.Monad.State
17 import Data.Map as Map hiding (showTree,map)
21 type ParseFun a = [Token] -> Err a
27 cHeader = "#include <stdio.h>\nint read(){\nint n;\nscanf(\"%d\",&n);\nreturn n;\n}\nint main(void){\n"
29 cFooter = "return 0;}"
31 putStrV :: Verbosity -> String -> IO ()
32 putStrV v s = if v > 1 then putStrLn s else return ()
34 runFile :: Verbosity -> ParseFun Stms -> FilePath -> IO ()
35 runFile v p f = readFile f >>= run v p
37 run :: Verbosity -> ParseFun Stms -> String -> IO ()
38 run v p s = let ts = myLLexer s in case p ts of
40 putStrLn "\nParse Failed...\n"
45 runStateT (mapM typeCheckStm s) [empty]
46 putStr $ cHeader++concat (map compileStm s)++cFooter
49 showTree :: (Show a, Print a) => Int -> a -> IO ()
52 putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
53 putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
56 main = do args <- getArgs
58 [] -> hGetContents stdin >>= run 2 pStms
59 "-s":fs -> mapM_ (runFile 0 pStms) fs
60 fs -> mapM_ (runFile 2 pStms) fs