i+bb      Safe2579;HState monad providing context, i.e. function we've already called before.datatype for a token returning a random string$Pretoken, aka token as first read in dataype for a key aka token name0datatype for a double representing a probability@Compare inside the state monad using only the underlying objectsMake O a monoid so we can append them together nicely (since they do generate text). d(Value "Hello") <> (List [(0.5," you"), (0.5, " me")]) (List [(0.5,"Hello you"), (0.5, "Hello me")])   None2579; Drop file Extension"Get directory associated to a file1Function to apply a value on both arguments, e.g. between .$ (char '"') Add a PR for this? Could be useful in Megaparsec idk Allows us to use monoidal addition on parsers instance (Monoid a) => Monoid (Parser a) where mempty = pure mempty mappend x y = mappend  $ x  * y0Normalize pre-tokens/corresponding probabilities!-Helper function for creating a cdf from a pdf"Show as a T.Text#Pretty-print a ParseError$Strip a pre-token's name%Read a file in as a Text  !"#$%  !"#$%  !"#$%None257:Datatype for a semantic error&5Throw custom error given by string, within the parser'Throw  error within parser(+Throws argument for circular function calls)-Throws error when a function is defined twice*'Throws error for insufficient arguments+Constant to start s, Convert a Text to a - for use with a pretty-printer.*big semantics checker that sequences stuff/'helper to filter out stuff that doesn't0fTake the head of the list, or throw the appropriate error given which functions we are trying to call.1:Access argument, or throw error if the list is too short. 2'checker to verify there is at most one :return or  :define key statement3 Checks that we have at most one  `:return` template in the file4+Checks that there are no instances of a key5Derived via our show instance;6 display a ! nicely with coloration & whatnot &7'8()*+,./0123456 &7'8()*+,./01234 &7'8()*+,./0123456None257  Generate randomized text from a  getText :: IO T.Text getText = do let exampleTok = List [(1.0,List [(0.5,Value "heads"),(0.5,Value "tails")])] run exampleTok 95Helper function to compute the cdf when we have a pdf 9 9 9Safe257:Draw as a syntax Tree;Function to transform a 8 into a `Tree String` so that it can be pretty-printed. tokToTree 1.0 tok:;:;:;None257 < A map with all the modifiers we =Jumble the words in a string>Strip file extension?Get the :return value@(Convert the stuff after the number to a A6Build token in tree structure, without concatenating. B2Build the token without concatenating, yielding a $ suitable to be printed as a tree. C+Given keys naming the tokens, and lists of  , build our DPSort the keys that we have parsed so that dependencies are in the correct placesE.Ordering on the keys to account for dependency <=>?@ABCDE <=>?@ABCDE <=>?@ABCDENone257F1Parse a lexeme, aka deal with whitespace nicely. G*space consumer with awareness for commentsH6parse a symbol, i.e. string plus surrouding whitespaceIParse a number/probabilityJParse an integerK-Make sure definition blocks start un-indentedL0Make contents of definition blocks are indented.MParse between quotesNParse a keywordO Parse a varP Parse the P keyword.Q Parse the Q keyword.R Parse the  `:return` keyword.S&Parse a template name (what follows a  `:define` or T block)UParse a modifierVParse template into a  of referents and stringsW*Parse a probability/corresponding templateX Parse an QYParse a P blockZ Parse the  `:return` block[Parse the program in terms of  and the s to link them. QParse text as a token + context (aka a reader monad with all the other functions)\Parse text as token + context]!Parse text as a list of functions^@Parse text as a list of tokens, suitable for printing as a tree. Parse text given a context }import qualified Data.Text.IO as TIO getParsed = do f <- TIO.readFile "template.mad" parseTok "filename.mad" [] [] f_8Parse text as a token, suitable for printing as a tree..`Parse inclustionsFGHIJKLMNOPQRSUVWXYZ[ \]^ !File name to use for parse errors2Context, i.e. other random data paired with a key.1list of variables to substitute into the templateActaul text to parseResult_`FGHIJKLMNOPQRSUVWXYZ[ \]^ _`FGHIJKLMNOPQRSUVWXYZ[ \]^ _` None257: Parse a template file into the  data typea'Generate text from file with inclusions:Generate randomized text from a file containing a templatebRun in the appropriate folder-Run based on text input, with nothing linked.cGet file as contextBParse a template into a RandTok suitable to be displayed as a tree )variables to substitute into the templatefolderfilepath within folderparsed a1List of variables to substitute into the templatePath to .mad file.Resultbc abc abc None257d for an EDSL, e.g. xdemoQQ :: T.Text demoQQ = run [madlang| :define something 1.0 "hello" 1.0 "goodbye" :return 1.0 something|] nNote that this is in general much faster than running interpreted code, though inclusions do not work in the d or in spliced expressions.e Convert a f6 containing to a `Q Exp` with the parsed syntax tree.g_Turn a parse error into an error that will be caught when Template Haskell compiles at runtime.Splice for embedding a '.mad' file, e.g. >demo :: IO T.Text demo = run $(madFile "twitter-bot.mad") 7Note that the embedded code cannot have any inclusions.egeeg Safe257 hijklmnopqrstiopqrst hijklmnopqrst None257udatatype for the subcommandsvdatatype for the programw/Parser for command-line options for the programxParser for the run subcommandyParser for the lint subcommandMain program actionExample Usage: -$ madlang run example.mad some text generatedzWraps parser with help parser{7given a parsed record perform the appropriate IO actionu|}~vwxyz{u|}~vwxyz{ u|}~vwxyz{None257             !"#$%&!'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop q r stuv wbcx y z { | } ~        &madlang-2.3.0.4-IkjqkqFqhOe3KjygtzdJkr Text.MadlibsText.Madlibs.Internal.TypesText.Madlibs.Internal.UtilsText.Madlibs.Cata.SemErrText.Madlibs.Cata.RunText.Madlibs.Cata.DisplayText.Madlibs.Ana.ParseUtilsText.Madlibs.Ana.ParseText.Madlibs.Ana.ResolveText.Madlibs.Generate.TH Paths_madlangText.Madlibs.Exec.MainContextRandTokListValue SemanticErrorNoReturnCircularFunctionCallsInsufficientArgsDoubleDefinition NoContextrun parseTokMparseTok parseFilerunFilerunTextmakeTreemadlangmadFile runMadlangPreTokKeyProb $fEqStateT$fMonoidRandTokNameapply $fEqPreTok dropExtensiongetDir.$ normalizecdfshow'parseErrorPretty'unTok readFile' customErrornoReturncircularFunctionCallsdoubleDefinitioninsufficientArgs semErrStarttext',ansi-wl-pprint-0.6.7.3-EqhsHSbxOT2xFHZZJCFwfText.PrettyPrint.ANSI.LeijenDoccheckSemanticssumProbhead'accesscheckKeysingleInstance noInstance$fExceptionSemanticError$fShowSemanticErrorshowCustomError noContextmkCdf displayTree tokToTree modifierListjumblestrip takeTemplate concatTokbuildTok buildTreebuildsortKeys orderKeyslexeme spaceConsumersymbolfloatinteger nonIndented indentGuardquotekeywordvardefineincludemainnamebaseGHC.BasereturnmodifierpreStrpair inclusions definitionfinalprogram parseTreeM parseTokF parseTreeF parseTreeparseInclusionsgetInclusionCtx runInFolderparseCtxtemplate-haskellLanguage.Haskell.TH.Quote QuasiQuotertextToExpressionStringerrorgencatchIOversionbindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName SubcommandProgramorderstemplintwrappertemplateDebugRunLintrepclInputssubinput versionInfo