58 lines
1.4 KiB
Haskell
58 lines
1.4 KiB
Haskell
-- automatically generated by BNF Converter
|
|
module Main where
|
|
|
|
|
|
import IO ( stdin, hGetContents )
|
|
import System ( getArgs, getProgName )
|
|
|
|
import LexJavalette
|
|
import ParJavalette
|
|
import SkelJavalette
|
|
import PrintJavalette
|
|
import AbsJavalette
|
|
|
|
|
|
|
|
|
|
import 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 pProgram
|
|
"-s":fs -> mapM_ (runFile 0 pProgram) fs
|
|
fs -> mapM_ (runFile 2 pProgram) fs
|
|
|
|
|
|
|
|
|
|
|