1 -- automatically generated by BNF Converter
5 import IO ( stdin, hGetContents )
6 import System ( getArgs, getProgName )
19 type ParseFun a = [Token] -> Err a
25 putStrV :: Verbosity -> String -> IO ()
26 putStrV v s = if v > 1 then putStrLn s else return ()
28 runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO ()
29 runFile v p f = putStrLn f >> readFile f >>= run v p
31 run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO ()
32 run v p s = let ts = myLLexer s in case p ts of
33 Bad s -> do putStrLn "\nParse Failed...\n"
37 Ok tree -> do putStrLn "\nParse Successful!"
42 showTree :: (Show a, Print a) => Int -> a -> IO ()
45 putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
46 putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
49 main = do args <- getArgs
51 [] -> hGetContents stdin >>= run 2 pProgram
52 "-s":fs -> mapM_ (runFile 0 pProgram) fs
53 fs -> mapM_ (runFile 2 pProgram) fs