Make lexer FA graph output optional

Main.hs

@@ -21,19 +21,19 @@ import qualified Options.Applicative as OA
 import Data.Version
 import Paths_alpaca_parser_generator
 
-type MainProgram = Text -> FilePath -> FilePath -> IO ()
+type MainProgram = Bool -> Text -> FilePath -> FilePath -> IO ()
 
 runProgram :: (LexerWriter lang, ParserWriter parser lang) =>
               Proxy lang -> Proxy parser -> MainProgram
-runProgram lang parserMethod parserName baseFileName inputFile = do
+runProgram lang parserMethod debugLexer parserName baseFileName inputFile = do
   input <- T.readFile inputFile
   let (lexicRaw, grammarLines) = second (drop 1) . break (=="%%") $ T.lines input
       rootdir = takeDirectory inputFile
       grammar = T.unlines grammarLines
       lexic = filter (not . T.null) lexicRaw
   setCurrentDirectory rootdir
   runInIO $ do
-    writeFiles =<< makeLexer lang lexic
+    writeFiles =<< makeLexer lang debugLexer lexic
     wrap parserName $ makeParser lang parserMethod ParserOptions{
         parserOptionsName = parserName
       , parserOptionsBaseFileName = baseFileName
@@ -88,6 +88,9 @@ parser = (option (enumReader langTbl)
       <> help "Parser method, default lalr"
       <> metavar (intercalate "|" (concatMap fst parsTbl))
       <> value (ParserProxy lalrParser)))
+  <*> switch
+       ( long "debug-lexer"
+      <> help "Output lexer finite automata graphs in GraphViz format")
   <*> strOption
        ( short 'n'
       <> long "name"

README.md

@@ -30,6 +30,8 @@ Available options:
                            Target language, default cpp
   -p,--parser recursive|rec|ll1|lr0|lr1|slr|lalr
                            Parser method, default lalr
+  --debug-lexer            Output lexer finite automata graphs in GraphViz
+                           format
   -n,--name NAME           Parser class name, default "Parser"
   -b,--basename FILENAME   Parser output file base name, default "parser"
   GRAMMARFILE              Grammar input file

lib/Lexer/Build.hs

@@ -24,12 +24,14 @@ import Lexer.Types
 import Data.Proxy
 
 makeLexer :: (LexerWriter lang, Monad m) => Proxy lang
-           -> [Text] -> MyMonadT m [(FilePath,Text)]
-makeLexer lang input = do
+          -> Bool -> [Text] -> MyMonadT m [(FilePath,Text)]
+makeLexer lang outputDebug input = do
   defs <- liftEither . left T.lines $ mapM (fmap regex . scanLine) input
   let nfa = evalState (buildNFA defs) 0
       dfa = simplifyDFA . nfaToDFA $ nfa
-      debug = (("nfa.gv", nfaToGraphviz nfa) :) . (("dfa.gv", dfaToGraphviz dfa) :)
+      debug = if outputDebug
+        then (("nfa.gv", nfaToGraphviz nfa) :) . (("dfa.gv", dfaToGraphviz dfa) :)
+        else id
       stList = map (second (second M.toList)) $ IM.toList dfa
 
   accSt <- catMaybes <$> mapM (\(f, (s, _)) -> fmap (f,) <$> isSingle f s) stList