1 -- automatically generated by BNF Converter
5 import IO ( stdin, hGetContents )
6 import System ( getArgs, getProgName )
15 import Control.Monad.State
16 import Data.Map as Map hiding (showTree)
20 type ParseFun a = [Token] -> Err a
26 putStrV :: Verbosity -> String -> IO ()
27 putStrV v s = if v > 1 then putStrLn s else return ()
29 runFile :: Verbosity -> ParseFun Stms -> FilePath -> IO ()
30 runFile v p f = putStrLn f >> readFile f >>= run v p
32 run :: Verbosity -> ParseFun Stms -> String -> IO ()
33 run v p s = let ts = myLLexer s in case p ts of
35 putStrLn "\nParse Failed...\n"
40 putStrLn "\nParse Successful!"
41 showTree v (Program s)
42 runStateT (mapM typeCheckStm s) [empty]
43 print "The program is type-correct!!"
46 showTree :: (Show a, Print a) => Int -> a -> IO ()
49 putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
50 putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
53 main = do args <- getArgs
55 [] -> hGetContents stdin >>= run 2 pStms
56 "-s":fs -> mapM_ (runFile 0 pStms) fs
57 fs -> mapM_ (runFile 2 pStms) fs