нУЁh$WхH╞ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґўєNone∙%╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопяр None3Чстужвьызшэщч Safe-InferredЕъgfгCreate a new cache that uses the given function to read and parse filesЮgfForget all cached objectsАgfйForget cached objects that have been unused for longer than the given timeБgfList currently cached filesЦgfъLookup a cached object (or read the file if it is not in the cache or if it has been modified)ДgfLike Ц8, but also return the last modification time of the fileЕъЮАБЦДLennart Kolmodin, Ross PatersonBSD3-style (see LICENSE),Lennart Kolmodin experimentalportable to Hugs and GHCNoneг ≤ФgfA Ф# is an efficient way to build lazy Г1s. There are several functions for constructing Фьs, but only one to inspect them: to extract any data, you have to turn them into lazy Гs using Х.Internally, a Ф constructs a lazy ┘ by filling byte arrays piece by piece. As each buffer is filled, it is 'popped' off, to become a new chunk of the resulting lazy Г+. All this is hidden from the user of the Ф.ИgfO(1). The empty Builder, satisfyingХ И = ЙКgfO(1).+ A Builder taking a single byte, satisfyingХ (К b) = Л bМgfO(1).л The concatenation of two Builders, an associative operation with identity И, satisfyingХ (М x y) = Н (Х x) (Х y)ОgfO(1). A Builder taking a П, satisfyingХ (О bs) = Я [bs]РgfO(1). A Builder taking a lazy Г, satisfyingХ (Р bs) = bsХgfO(n). Extract a lazy Г from a Фп. The construction work takes place if and when the relevant part of the lazy Г is demanded.СgfO(1). Pop the Пн we have constructed so far, if any, yielding a new chunk in the result lazy Г.Тgf#Write a Word16 in big endian formatУgf&Write a Word16 in little endian formatЖgf#Write a Word32 in big endian formatВgf&Write a Word32 in little endian formatЬgf#Write a Word64 in big endian formatЫgf&Write a Word64 in little endian formatЗgfO(1).╩ A Builder taking a single native machine word. The word is written in host order, host endian form, for the machine you're on. On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine, 4 bytes. Values written this way are not portable to different endian or word sized machines, without conversion.ШgfщWrite a Word16 in native host order and host endianness. 2 bytes will be written, unaligned.ЭgfщWrite a Word32 in native host order and host endianness. 4 bytes will be written, unaligned.Щgf⌠Write a Word64 in native host order. On a 32 bit machine we write two host order Word32s, in big endian form. 8 bytes will be written, unaligned.ФИКМОРХСТУЖВЬЫЗШЭЩLennart KolmodinBSD3-style (see LICENSE),Lennart Kolmodin experimentalportable to Hugs and GHC.Noneг+ЧgfхThe Get monad is just a State monad carrying around the input ByteStringЪgfRun the Get monad applies a ─ %-based parser on the input ByteString│ gfRun the Get monad applies a ─ ▀-based parser on the input ByteString. Additional to the result of get it returns the number of consumed bytes and the rest of the input.┌ gfSkip ahead n bytes. Fails if fewer than n bytes are available.┐ gfSkip ahead n- bytes. No error if there isn't enough bytes.└ gfRun ga4, but return without consuming its input. Fails if ga fails.┘ gfLike └ , but consume the input if gma returns 'Just _'. Fails if gma fails.├ gfLike └ , but consume the input if gea returns 'Right _'. Fails if gea fails.┤ gfGet the next up to n5 bytes as a lazy ByteString, without consuming them. ┬ gf1Get the total number of bytes read to this point.┴ gf⌠Get the number of remaining unparsed bytes. Useful for checking whether all input has been consumed. Note that this forces the rest of the input.┼ gfжTest whether all input has been consumed, i.e. there are no remaining unparsed bytes.▀ gf An efficient ─ 5 method for strict ByteStrings. Fails if fewer than n bytes are left in the input.▄ gf An efficient ─ ; method for lazy ByteStrings. Does not fail if fewer than n bytes are left in the input.█ gfЖGet a lazy ByteString that is terminated with a NUL byte. Fails if it reaches the end of input without hitting a NUL.▌ gf,Get the remaining bytes as a lazy ByteString▐ gf importantPull n. bytes from the input, as a strict ByteString.░ gf!Read a Word8 from the monad state▒ gf"Read a Word16 in big endian format▓ gf%Read a Word16 in little endian format⌠ gf"Read a Word32 in big endian format■ gf%Read a Word32 in little endian format∙ gf"Read a Word64 in big endian format√ gf%Read a Word64 in little endian format≈ gfO(1).а Read a single native machine word. The word is read in host order, host endian form, for the machine you're on. On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine, 4 bytes.≤ gfO(1).? Read a 2 byte Word16 in native host order and host endianness.≥ gfO(1).8 Read a Word32 in native host order and host endianness. gfO(1).7 Read a Word64 in native host order and host endianess.ЧЪ│ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼ ▀ ▄ █ ▌ ▐ ░ ▒ ▓ ⌠ ■ ∙ √ ≈ ≤ ≥ Lennart KolmodinBSD3-style (see LICENSE),Lennart Kolmodin stable(Portable to Hugs and GHC. Requires MPTCsNone2ъ⌡ gfunstableфportable to Hugs and GHC. Requires the FFI and some flexible instancesNone>?ю:gfThe Binary class provides ╩ and ╪ Ц, methods to encode and decode a Haskell value to a lazy ByteString. It mirrors the Read and Show classes for textual representation of Haskell types, and is suitable for serialising Haskell values to disk, over the network.лFor parsing and generating simple external binary formats (e.g. C structures), Binary may be used, but in general is not suitable for complex protocols. Instead use the Put and Get primitives directly.:Instances of Binary should satisfy the following property:decode . encode == id That is, the ╪ and ╩ Й methods should be the inverse of each other. A range of instances are provided for basic Haskell types. ╩ gf Encode a value in the Put monad.╪ gfDecode a value in the Get monadgf?Encode a value using binary serialisation to a lazy ByteString.gfмDecode a value from a lazy ByteString, reconstructing the original structure.gf"Lazily serialise a value to a fileюабты:╒л м н о п я р с т у ж в ь ы з ш AR(stable) (portable) Safe-Inferred;²gfLike э type with error msgsgfAnalogue of щ gfAnalogue of fromMaybeч gfadded by KJъ gfadded 2/10/2003 by PEBBB(stable) (portable) Safe-Inferred?АЮ gfCreate a new empty graph.А gfGet all the nodes in the graph.Б gfGet all the edges in the graph.Ц gf$Map a function over the node labels.Д gf$Map a function over the edge labels.Е gfAdd a node to the graph.Ф gf2Remove a node and all edges to and from that node.Г gfgfкFix point iterator (for computing e.g. transitive closures or reachability)?gf#chop into separator-separated parts. !"#$%&'()*+,-./0123456789:;<=>?@AB(5)5*5,5BB(stable) (portable) Safe-InferredL-л gfкGraph type, graph ID, graph attirbutes, graph nodes, graph edges, subgraphsм н о п я р с т л у ж в ь ы з ш э щ ч ъ Safe-InferredL| Ю А Б Ц Д Е Ф Г Х И Й К Л Safe-InferredLЎМ NoneLчН О П Я Р С Т У Ж В Ь Ы З Ш Э Щ Ч Ъ ─(c) Sven Panne 2002-2005/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgexperimentalportable Safe-InferredS│gfСDescribes whether an option takes an argument or not, and if so how the argument is injected into a value of type a.┌gfno argument expected┐gfoption requires argument└gfoptional argument┘gfEach ┘ describes a single option.The arguments to ├ are:list of short option characters*list of long option strings (without "--")argument descriptorexplanation of option for user┤gf-What to do with options following non-options┬gf+no option processing after first non-option┴gf*freely intersperse options and non-options┼gfwrap non-options into options▀gf░Return a string describing the usage of a command, derived from the header (first argument) and the options described by the second argument.▄gfПProcess the command-line, and return the list of values that matched (and those that didn't). The arguments are:The order requirements (see ┤)The option descriptions (see ┘):The actual command line arguments (presumably got from ).▄Й returns a triple consisting of the option arguments, a list of non-options, and a list of error messages.█gfThis is almost the same as ▄▓, but returns a quadruple consisting of the option arguments, a list of non-options, a list of unrecognized options, and a list of error messages. │┌┐└┘├┤┬┴┼▀▄█! Safe-InferredSM*▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ" Safe-InferredSх╦╧╨╩╪#BB(stable) (portable) Safe-InferredX{Ґgf┼Type parameters: node id type, state label type, edge label type Data constructor arguments: nodes and edges, start state, final statesЎgfюCreate a new finite automaton with an initial and a final state.©gfэGets all incoming transitions to a given state, excluding transtions from the state itself.юgfGive new names to all nodes.аgfInsert an NFA into anotherбgf■Make the finite automaton have a single final state by adding a new final state and adding an edge from the old final states to the new state.цgf²Transform a standard finite automaton with labelled edges to one where the labels are on the nodes instead. This can add up to one extra node per edge.дgfТRemove empty nodes which are not start or final, and have exactly one outgoing edge or exactly one incoming edge.еgfStart node labelюgfInfinite supply of new namesаgfNFA to insert intogfStates to insert betweengfNFA to insert.бgfLabel to give the new nodegfLabel to give the new edgesgfThe old networkgfThe new network%фгҐхийклмеЎнопярстужвьыз©шэюащбцдчъЮА$ Safe-InferredY(БgfREUnion [] is nullЦgfREConcat [] is epsilonДБЦЕФГХИЙКЛМНОПЯРСТУ% Safe-InferredYwCD& Safe-InferredZ╟ЖgfмSet parallelism to a given number, or use the number of processors. Returns Вз if compiled with GHC<7.6 and the desired number of threads hasn't already been set with +RTS -Nn -RTS.Ьgf/Returns the number of processors in the system.ЖЬ' Safe-Inferred[0JgfйSet the console encoding (for Windows, has no effect on Unix-like systems)EFIGHJKL( Safe-Inferred[_цЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩) Safe-Inferred\ў╪gf=Feed some input to a shell process and read the output lazily╪gf shell commandgfinput to shell commandgfoutput from shell command╪*Bjorn Bringert(stability) (portability) Safe-Inferred_єҐgf⌠Run an IO action, and allow it to be interrupted by a SIGINT to the current process. Returns an exception if the process did not complete normally. NOTES: * This will replace any existing SIGINT handler during the action. After the computation has completed the existing handler will be restored. * If the IO action is lazy (e.g. using readFile, unsafeInterleaveIO etc.) the lazy computation will not be interruptible, as it will be performed after the signal handler has been removed.ЎgfLike Ґа, but always returns (), whether the computation fails or not.©gf"Run an action with SIGINT blocked.юабҐЎ©+Bjorn Bringert(stability) (portability) Safe-Inferred`Ґ©, Safe-Inferred`,цд-None`Nефгхи Safe-Inferred`' MNOPQRSTUVWXYZ[\]^_`abcde'MNOPQRSTUVWXYZ[\]^_`abcde S5T5U6V6. Safe-Inferreda2mgfAttaching location informationmnorqpstuvwx/ Safe-Inferredaeйклмн Safe-Inferredaм{gf.Bind tokens separated by Prelude.BIND, i.e. &+yz{yz{0 Safe-Inferredcb|gfвAn abstract data type that represents identifiers for functions and categories in PGF.~gfCreates a new identifier from оgf+Creates an identifier from a UTF-8-encoded ByteString─gfReads an identifier from о. The function returns п' if the string is not valid identifier.│gfRenders the identifier as о |я}~─│р┌┐1 Safe-InferredcМсgfstring constantтgfinteger constantуgffloating point constant&жвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУстуЖВЬ Safe-Inferred>юабдf║ ┬gf-Haskell representation of the GF record type {s:t}┼gf#Overloaded function to project the s field from any record type█gfTokens∙gf4Token sequences, output form linearization functions√gf/For enumerating parameter values used in tables≤gfTables≥gfRender a token sequence as a о gfCoerce from any record type {...,s:t,...} to the supertype {s:t}⌡gfConcatenation with variants°gf#Selection from tables with variants▄gf2To be matched with the prefix of a following token┬┴┼▀▄█■⌠▓▒░▐▌∙√≈≤≥ ⌡°²·√≈≤∙█■⌠▓▒░▐▌▄≥┼▀┬┴ ⌡°²·⌡52 Safe-Inferredg*ЫЗШЭЩЧЪ─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼ 3 Safe-Inferredjwїgfїо represents a hypothesis in a type i.e. in the type A -> B, A is the hypothesis╗gfTo read a type from a о, use ╘.╘gfReads a ╗ from a о.╙gfrenders type as оЗ. The list of identifiers is the list of all free variables in the expression in order reverse to the order of binding.╚gfМcreates a type from list of hypothesises, category and list of arguments for the category. The operation $mkType [h_1,...,h_n] C [e_1,...,e_m] will create "h_1 -> ... -> h_n -> C e_1 ... e_m╛gf0creates hypothesis for non-dependent type i.e. Aґgf2creates hypothesis for dependent type i.e. (x : A)ўgfкcreates hypothesis for dependent type with implicit argument i.e. ({x} : A)|ї╗▀ ╘╙╚╛ґў╞▄ █ ▌ 4 Safe-Inferredr² ┤gf≈An expression in the abstract syntax of the grammar. It could be both parameter of a dependent type or an abstract syntax tree for for some sentence.▐ gfНThe equation is used to define lambda function as a sequence of equations with pattern matching. The list of ┤) represents the patterns and the second ┤) is the function body for this equation.░ gfнThe pattern is used to define equations in the abstract syntax of the grammar.▒ gfдapplication. The identifier should be constructor i.e. defined with 'data'▓ gfliteral⌠ gfvariable■ gfvariable@pattern∙ gfwildcard√ gfimplicit argument in pattern≈ gflambda abstraction≤ gfapplication≥ gfliteral gf meta variable⌡ gffunction or data constructor° gfvariable with de Bruijn index² gflocal type signature· gfimplicit argument in expression╟gfЕTree is the abstract syntax representation of a given sentence in some concrete syntax. Technically ╟ is a type synonym of ┤.╠gfparses о as an expression╡gfrenders expression as оЗ. The list of identifiers is the list of all free variables in the expression in order reverse to the order of binding.╣gfхConstructs an expression by applying a function to a list of expressionsІgf5Decomposes an expression into application of functionЇgfБDecomposes an expression into an application of a constructor such as a constant or a metavariable╦gf,Constructs an expression from string literal╧gf,Decomposes an expression into string literal╨gf-Constructs an expression from integer literal╩gf-Decomposes an expression into integer literal╪gf1Constructs an expression from real number literalҐgf1Decomposes an expression into real number literalюgf/Constructs an expression which is meta variableаgf/Checks whether an expression is a meta variable÷ gf$Compute an expression to normal formиУстуЖ└┘├┤≥ ⌡ ° ≈ ≤ ² · ═ ║ ╒ ё є ╔ і ї ╗ ╘ ╙ ╚ ╛ ґ ў ╞ ▐ ╟ ░ ▒ ▓ ⌠ ■ ∙ √ ╠ ╟╡ ╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабЁ Є ╣ І ц÷ Ї ╦ ╧ ╨ 5 Safe-InferreduУ╩ gfТThe tree is an evaluated expression in the abstract syntax of the grammar. The type is especially restricted to not allow unapplied lambda abstractions. The tree is used directly from the linearizer and is produced directly from the parser.╪ gf6lambda abstraction. The list of variables is non-emptyҐ gfvariableЎ gffunction application© gfliteralю gf meta variableа gfАConverts a tree to expression. The conversion is always total, every tree is a valid expression.б gf░Converts an expression to tree. The conversion is only partial. Variables and meta variables of function type and beta redexes are not allowed. ╩ Ґ ю Ў © ╪ а б ц 6 Safe-InferredxpдgfThis is just a |╘ with the language name. A language name is the identifier that you write in the top concrete or abstract module in GF after the concrete/abstract keyword. Example:2abstract Lang = ... concrete LangEng of Lang = ...д gfvalue of a flagе gf5type, arrity and definition of function + probabilityф gf context of a categoryьfunctions of a category. The functions are stored in decreasing probability order.probabilityкgfтAn abstract data type representing multilingual grammar in Portable Grammar Format.▓|УустЖ└┘├┤· ² ≤ ≈ ° ≥ ⌡ ═ ║ ╒ ё є ї╗▀ ╘╙╚╛ґў╞▄ █ ▌ ╞ ў ґ ╛ ╚ ╙ ╗ ╘ ▐ ╟ ░ ╠ √ ∙ ■ ⌠ ▒ ▓ ╡ ╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабЁ Є ╣ І ц÷ дефгг х и й к л м н о п я р с т у ж в ь ы з ш э щ хийч ъ Ю А Б Ц Д Е Ф Г Х И Й К Л М д е ф кН О П Я Р С Т У Ж лмВ Ь Ы З Ш Э 7 Safe-Inferredy╩Щ 8 Safe-Inferred?yЕЧ Ъ ─│┌┐└9AR(stable) (portable) Safe-Inferredz1н┘: Safe-Inferredz\опярстужв├┤;None?гTьgfЦBracketedString represents a sentence that is linearized as usual but we also want to retain the ' brackets': that mark the beginning and the end of each constituent.ыgf$this is the leaf i.e. a single tokenзgfthis is a bracket. The |% is the category of the phrase. The и╞ is an unique identifier for every phrase in the sentence. For context-free grammars i.e. without discontinuous constituents this identifier is also unique for every bracket. When there are discontinuous phrases then the identifiers are unique for every phrase but not for every bracket since the bracket represents a constituent. The different constituents could still be distinguished by using the constituent index i.e. х┬. If the grammar is reduplicating then the constituent indices will be the same for all brackets that represents the same constituent.шgfаList of functions that lack linearizations in the given language.эgf*Show the printname of function or categoryщgfиRenders the bracketed string as string where the brackets are shown as (S ...) where S is the category.┬gf7The length of the bracketed string in number of tokens.2┴┼▀▄█▌▐░▒▓ьзы⌠■∙√≈≤≥ ⌡°²ш·÷═║╒ёє╔іэї╗╘╙╚╛щґ┬ў╞╟ч╠╡<None┐KъgfХAn abstract data structure which represents the probabilities for the different functions in a grammar.Юgf+Renders the probability structure as stringАgf·Reads the probabilities from a file. This should be a text file where on every line there is a function name followed by a real number. The number represents the probability mass allocated for that function. The function name and the probability should be separated by a whitespace.Бgf┬Builds probability tables. The second argument is a map which contains the know probabilities. If some function is not in the map then it gets assigned some probability based on the even distribution of the unallocated probability mass for the result category.Цgf%Returns the default even distibution.Еgf'compute the probability of a given treeФgf'rank from highest to lowest probability ъЁЄ╣ЮАБЦІДЕФЇ=None?┐┘╦╧>None┐ї╨╩╪?None?┘їГgf5Linearizes given expression as string in the languageХgfThe same as И# but does not return the language.ИgfяLinearizes given expression as string in all languages available in the grammar.ЙgfаLinearizes given expression as a bracketed string in the languageКgfаLinearizes given expression as a bracketed string in the languageЛgfэCreates a table from feature name to linearization. The outher list encodes the variationsГХИЙКЛ@None┘яҐAKrasimir Angelov(stable) (portable)None>юабты▄oМgfМIf an error occurs in the typechecking phase the type checker returns not a plain text error message but a М% structure which describes the error.Нgf Unknown category name was found.Оgf Unknown function name was found.Пgf═A category was applied to wrong number of arguments. The first integer is the number of expected arguments and the second the number of given arguments. The [CId]п argument is the list of free variables in the type. It should be used for the ╙ function.ЯgfЫThe expression is not of the expected type. The first type is the expected type, while the second is the inferred. The [CId]Й argument is the list of free variables in both the expression and the type. It should be used for the ╙ and ╡ functions.РgfбSomething that is not of function type was applied to an argument.Сgf6It is not possible to infer the type of an expression.ТgfяSome metavariables have to be instantiated in order to complete the typechecking.Уgfhttp://www.w3.org/TR/2003/WD-semantic-interpretation-20030401/°gf:Pretty-print the options that are preserved in .gfo files.²gf:Pretty-print the options that are preserved in .pgf files.іgf√This is for bacward compatibility. Since GHC 6.12 we started using the native Unicode support in GHC but it uses different names for the code pages.≥gflist of string arguments gflist of string arguments▓·÷═╡Ёе║╒ёє╔ії╗╘╙╚╛ґў╞╟╠Є╣ІЇ╦╧╨╩╪ҐЎ©юабцдфгхийоянклмпрстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘┬┤├┴┼▌▀▄█▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞M(Maintainer)(stable) (portable)None·ІмgfReport a fatal errorнgf&warnings should be reversed in the endоgf%Report a nonfatal (accumulated) errorпgf6Turn a fatal error into a nonfatal (accumulated) errorяgf*Turn accumulated errors into a fatal errorрgf.Run an error check, report errors and warningsсgf;Run an error check, report errors and (optionally) warningsтgfЛAugment error messages with a relative path to the source module and an contextual hint (which can be left )ужвмьныопярсзшэщтNNoneг·ЫычъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІprovisionalNone567═Ш╡gfбPretty print atomically (i.e. wrap it in parentheses if necessary)хgf!Name of param type or param valueЕgfLinearization value, RHS of linЖgfLinearization type, RHS of lincat┘gfConcrete Syntax▒gfAbstract Syntax⌠gfA Complete grammarИ╟╠╡ЁЄІ╣Ї╦╩╧╨╪ҐЎ©юабцдефгхийклмнопярстужвьызшэЮъчщАДЦБЕСРЯПОНМЛКЙИХГФТУЖЩЭШЗЫЬВЧЪ─│┌└┐┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤И⌠■▒▓∙▐░█▌▀▄┴┼┤┬┘├√┌└┐─│ЧЪЖЩЭШЗЫЬВТУЕСРЯПОНМЛКЙИХГФАДЦБэЮъчщшзывьжутрспянолмйкхифгдебц©юаҐЎ╪╦╩╧╨ЇЄІ╣╡Ё╟╠≈≤ONone╒ЎЇPAR(stable) (portable)NoneЁєз⌠gfrecord label√gf0to guide computation and type checking of tables≈gf%received from parser; can be anything≤gf$type annontated, but can be anything≥gfexpanded gf.just one wild card pattern, no need to expand ⌡gfPatterns°gfconstructor pattern: C p1 ... pn C ²gfpackage constructor pattern: P.C p1 ... pn P.C ·gfvariable pattern: x÷gfwild card pattern: _═gfrecord pattern: {r = p ; ...} -- only concrete║gfstring literal pattern: "foo" -- only abstract╒gfinteger literal pattern: 12 -- only abstractёgffloat literal pattern: 1.2 -- only abstractєgftype-annotated pattern╔gfas-pattern: x@pіgf.placeholder for pattern for implicit argument {p}їgfinaccessible pattern╗gfnegated pattern: -p╘gfdisjunctive pattern: p1 | p2╙gfsequence of token parts: p + q╚gfsequence of token parts: p + q╛gfrepetition of token part: p*ґgfstring of length one: ?ўgfcharacter list: ["aeiou"]╡gfvariableЁgfconstantЄgfconstructor╣gf basic typeІgfinteger literalЇgffloating point literal╦gfstring literal or token: "foo"╧gfthe empty string []╨gf application: f a╩gf abstraction: x -> b╪gfmetavariable: ?i (only parsable: ? = ?0)Ґgf"placeholder for implicit argument {t}Ўgffunction type: (x : A) -> B, A -> B, ({x} : A) -> B©gftype-annotated term9below this, the constructors are only for concrete syntaxюgf!example-based term: @in M.C "foo"аgf record type: { p : A ; ...}бgf record: { p = a ; ...}цgf projection: r.pдgf extension: R ** {x : A} (both types and terms)еgf table type: P => Aфgf table: table {p => c ; ...}гgf!table given as course of values: table T [c1 ; ... ; cn]хgf selection: t ! pиgflocal definition: let {t : T = a} in bйgf!qualified constant from a packageкgf$qualified constructor from a packageлgfconcatenation: s ++ tмgfagglutination: s + tнgf"pattern (in macro definition): # pоgfpattern type: pattern Tпgf!boxed linearization type of Identяgf!boxed linearization of type Identрgf&ad hoc overloading generated in Renameсgf alternatives in free variation: variants { s ; ... }тgfalternatives by prefix: pre {t ; s/c ; ...}уgfconditioning prefix strings: strs {s ; ...}жgf%error values returned by Predef.errorшgf#the constructors are judgements in abstract syntax (ABS) resource (RES)concrete syntax (CNC)and indirection to module (INDIR)эgf(ABS) context of a categoryщgf(ABS+) type, arrity and definition of a functionчgf(RES5) the second parameter is list of all possible valuesъgf(RES+) to mark parameter constructors for lookupЮgf(RES)Аgf(RES) idents: modules inheritedБgf(CNC) lindef ini'zed, Цgf(CNC) type info added at TCДgf(INDIR) the ╦ says if canonicalСgfencoding the type of the module┬gfModules┴gf;A grammar is a self-contained collection of grammar modules░gfinitial dependency list▒gfall dependencies▓gfгselect just those modules that a given one depends on, including itself⌠gfиall modules that a module extends, directly or indirectly, with restricts■gfthe same as ⌠, plus that an instance extends its interface≤gf,we store the module type with the identifier·gf=don't generate code for interfaces and for incomplete modules÷gf-interface and "incomplete M" are not complete═gf8all abstract modules sorted from least to most dependent║gf4the last abstract in dependency order (head of list)╒gfall resource modulesёgf)the greatest resource in dependency orderєgf"all concretes for a given abstract╔gf%all concrete modules for any abstractЇmnopqruvwx└┘├ефгхи┘┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡²╔ії°·÷═║╒ёє╗╘╙╚╛ґў╞╟╠сблхй╪Є╨╧ежфц╩Іу╡Ё╣Ї╦ҐЎ©юадгикмнопяртвьызшБЦэщчъЮАДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴▀┼▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚QNone╣'╧RAR(stable) (portable)None╣^╚╨╩╪ҐЎ©юабцдефгхиSKrasimir Angelov(stable) (portable)None?╣дц╛╟ґў╞╠╡ЁЄ╣ІЇ╦╧TAR(stable) (portable)None╦╩ Зgfdefault linearization typeШgfrefreshing variablesЭgf!trying to preserve a given symbolЪgf*quick hack for refining with var in editor─gf%create a terminal for concrete syntax┐gf!create a terminal from identifier▀gf&to define compositional term functions▄gf&to define compositional term functions⌠gf;to gather ultimate cases in a table; preserves pattern list■gfцto get a string from a term that represents a sequence of terminals≈gf to find the word items in a term gf/normalize records and record types; put s first⌡gfхdependency check, detecting circularities and returning topo-sorted listД╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²UAR(stable) (portable)None╧╧йклмVAR(stable) (portable)None╧ЖнопяWAR(stable) (portable)None╨лрgfreturns the original ш" and the module where it was foundсgfthis is needed at compile timeтgfthis is needed at compile timeужвьызршэщчъстЮАXNone╩ БЦДЕФГХИYNone╩8ЙКЛМНОПZAR(stable) (portable)None╩{уmnorpquvwx└┘├цефгхи┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²╚┬┴┼▀▄█▌▐░▒▓⌠■∙√ ≥≈≤⌡╟╞ўґ╛╚╙╘╗єё╒║═÷·°їі²╔╠тряпонмкигдаю©ЎҐ╦Ї╣Ё╡уІ╩цфже╧╨Є╪йхлсбвьызшДАЮъчщэБЦЕФГХИЙКЛМНОРПЯСЬВЖТУЫЗШЭЩ┤├┘└┐┌│─ЧЪ┬┴▀┼▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╨╩╪ҐЎдцба©юефгхи╛╞ў╟ґ╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²[AR(stable) (portable)NoneЎQЯ\AR(stable) (portable)NoneЎ┬РСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬]NoneЎт┴┼^NoneЎЖ▀▄█▌_AR(stable) (portable)None©3▐░▒▓`AR(stable) (portable)Noneю!⌠gfюcombine a list of definitions into a balanced binary search tree■gfнrebuilding instance + interface, and "with" modules, prior to renaming. AR 24102003⌠∙■aAR(stable) (portable)None?ю]√≈bAR(stable) (portable)NoneюЕ≤gfдthis gives top-level access to renaming term input in the cc command≤≥cNoneа▒ gfPredefined functions⌡gf%Show | Read | ToStr | MapStr | EqVal °gf3Self-contained (not quite) representation of values< ²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣⌡ІЇ╦╧╨╩╪°ҐЎ©юабцдефгхийклмнопярстуdNone>юб*жвьeNoneб╧ыgf9Convert operators once, not every time they are looked upзgfConvert a value back to a term&╦╧╨°утсряпонмлкйихгфедцбаю©ЎҐшэщчъЮыАзБ1Ц1fNoneц2ДЕgAR(stable) (portable)NoneцюФgfйpartial evaluation of concrete syntax. AR 6/2001 -- 16/5/2003 -- 5/2/2005.ФhNoneе[·gfшGenerate Canonical code for the named abstract syntax and all associated concrete syntaxes÷gf5Generate Canonical code for the named abstract syntax═gfЖGenerate Canonical code for the all concrete syntaxes associated with the named abstract syntax in given the grammar.║gf!Smart constructor for projections╒gf Smart constructor for selections·÷═║╒iNoneфіГgfТGenerate Haskell code for the all concrete syntaxes associated with the named abstract syntax in given the grammar.ХgfЦGenerate Haskell code for the given concrete module. The only options that make a difference are -haskell=noprefix and -haskell=variants.ГХjAR(stable) (portable)Noneг!Иgf8checking is performed in the dependency order of modulesИkKrasimir AngelovstableportableNone>хBЙgfтThis function extracts the list of all completed parse trees that spans the whole input consumed so far. The trees are also limited by the category specified, which is usually the same as the startup category.ьщ┬КЛМНОПЯЙlNone?тырРgfЮAn abstract data type whose values represent the state in an incremental parser after an error.ёgfыAn abstract data type whose values represent the current state in an incremental parser.єgfрThis data type encodes the different outcomes which you could get from the parser.╔gfхThe integer is the position in number of tokens where the parser failed.іgfсThe parsing was successful but none of the trees is type correct. The forest id (ию) points to the bracketed string from the parser where the type checking failed. More than one error is returned if there are many analizes for some phrase but they all are not type correct.їgfЗIf the parsing and the type checking are successful we get a list of abstract syntax trees. The list should be non-empty.╗gf=The sentence is not complete. Only partial output is produced╘gfюThe input to the parser is a pair of predicates. The first one ╚█ selects a token from a list of suggestions from the grammar, actually appears at the current position in the input string. The second one ╛- recognizes whether a literal with forest id и+ could be matched at the current position.ґgfлCreates an initial parsing state for a given language and startup category.ўgfШThis function constructs the simplest possible parser input. It checks the tokens for exact matching and recognizes only String, Int and Float literals. The Int and Float> literals match only if the token passed is some number. The Stringл literal always match but the length of the literal could be only one token.╟gf+From the current state and the next token ╟ї computes a new state, where the token is consumed and the current position is shifted by one. If the new token cannot be accepted then an error state is returned.╠gfуIf the next token is not known but only its prefix (possible empty prefix) then the ╠░ function can be used to calculate the possible next words and the consequent states. This is used for word completions in the GF interpreter.ЁgfтThis function extracts the list of all completed parse trees that spans the whole input consumed so far. The trees are also limited by the category specified, which is usually the same as the startup category.ЄgfсReturn the Continuation of a Parsestate with exportable types Used by PGFServiceРёєі╔ї╗╘╙╚╛СТґў╞╟╠╡ЁЄmKA(stable) (portable)Noneуrдgf>Renders abstract syntax tree in Graphviz format. The pair of ╦ (funs,cats)ъ lets you control whether function names and category names are included in the rendered tree.еgfVisualize word dependency tree.фgfйPrepare lines obtained from a configuration file for labels for use with е. Format per line fun label*.еgfOutput format: "latex", "conll", "malt_tab", "malt_input" or "dot"gf!Include extra information (debug)gf)abstract label information obtained with фgfюconcrete label information obtained with ' ' (was: unused (was: Maybe String))gfThe language of analysisgf'Rendered output in the specified format╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмKrasimir AngelovstableportableNoneщлнgf+A type for tries of plain applicative treesяgf"A type for plain applicative treesтgf4Reads file in Portable Grammar Format and produces к. structure. The file is usually produced with:$ gf -make у gfLike readPGF' but you have the manage file-handling.жgfЕTries to parse the given string in the specified language and to produce abstract syntax expression.вgfThe same as ь# but does not return the language.ьgf≤Tries to parse the given string with all available languages. The returned list contains pairs of language and list of abstract syntax expressions (this is a list, since grammars can be ambiguous). Only those languages for which at least one parsing is possible are listed.ыgfThe same as ж& but returns more detailed informationзgf9This is an experimental function. Use it on your own riskщgfхThe abstract language name is the name of the top-level abstract moduleчgf5List of all languages available in the given grammar.ъgfіGets the RFC 4646 language tag of the language which the given concrete syntax implements, if this is listed in the source grammar. Example language tags include "en" for English, and "en-UK" for British English.Юgf─List of all categories defined in the given grammar. The categories are defined in the abstract syntax with the 'cat' keyword.Бgf░The start category is defined in the grammar with the 'startcat' flag. This is usually the sentence category but it is not necessary. Despite that there is a start category defined you can parse with any category. The start category definition is just for convenience.Цgf4List of all functions defined in the abstract syntaxДgf2List of all functions defined for a given categoryЕgfThe type of a given functionФgf%Converts an expression to normal formЙgf Convert a ╟ to an яКgf#Combine a list of trees into a trie╙|}~─│┌┐┤ї╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабдхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌ёєі╔ї╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнпоясртужвьызшэщчъЮАБЦДЕФГХИЙК╙кту|~}│─┐┌дмлчщъ╗ї╙╘╚╛ґў╞ЮАБЦДЕш╟┤╡╠ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабГХГИХЙКЛээьызихйщчжьвызшФнЬЫЗМНОПЯРСТУЖВёґ╟╠╡╘╙╚╛ў╞єі╔ї╗ЁЄШЭЩЧЪ─│┌япосружвтдгхеикйЇ╦╧╨╩╪ҐЎ©юабцлІф╣мъБЦЮАЕДФИясрнпоЙКnNoneЮіУgfthe main functionУoAR(stable) (portable)NoneЮщЖВЬpNoneИЫgf*an abstract syntax function with argumentsЗgf1A lambda abstraction. The Int is the variable id.ШgfApplicationЭgf-The result of the n:th (0-based) non-terminalЩgfA lambda-bound variableЧgfA metavariableЪgf÷Removes all directly and indirectly cyclic productions. FIXME: this may be too aggressive, only one production needs to be removed to break a given cycle. But which one should we pick? FIXME: Does not (yet) remove productions which are cyclic because of empty productions.─gfжBetter bottom-up filter that also removes categories which contain no finite strings.│gfфRemoves categories which are not reachable from any external category.┌gfоMerges categories with identical right-hand-sides. FIXME: handle probabilities┐gf6Keeps only the start category as an external category.└gf?Get the sets of mutually recursive non-terminals for a grammar.┘gfGets all rules in a CFG.├gf9Gets all rules in a CFG, grouped by their LHS categories.┤gf%Gets all categories which have rules.┬gf7Gets all categories which have rules or occur in a RHS.┴gf&Gets all rules for the given category.┼gf/Gets all rules for categories in the given set.▀gf+Clean up CFG after rules have been removed.▄gfCombine two CFGs.█gfБCheck if any of the categories used on the right-hand side are in the given list of categories.▌gfОCheck if all the rules are right-linear, or all the rules are left-linear, with respect to given categories.▐gf.Checks if a context-free rule is right-linear.░gf-Checks if a context-free rule is left-linear.▒gfдChecks if a symbol is a non-terminal of one of the given categories.└gfЕIf true, all categories will be in some set. If false, only recursive categories will be included.▐gfThe categories to considergf%The rule to check for right-linearity░gfThe categories to considergf$The rule to check for left-linearityф▓⌠■∙√≈≤≥ЧЩЭШЗЫ ⌡°²·÷═║╒ёє╔іїЪ─│┌┐╗└╘╙╚╛ґ┘├┤┬┴┼ў╞▀▄╟╠╡ЁЄ╣ІЇ█╦╧▌▐░╨╩╪Ґ▒ЎqNoneИк©gfConcrete syntax nameю©rNoneЙ#аgf,Build a DFA by building and expanding an MFA╘бцдеаsNoneК╣фgfаAn SRG non-terminal. Category name and its number in the profile.гgfюгИН ч╠╡┴┼▀▄█▌▐░9 ▒9 ~NoneНR▓⌠Peter LjunglЖfNone?Н┘■─Peter LjunglЖfNoneНІ∙│NoneО √gfthe main function√gfModule name.√┌NoneО+≈┐NoneОL≤└Aarne Ranta(stable) (portable)NoneОю≥gfthe main function≥gfModule name.≥┘NoneОА ├NoneЯ1НgfExport a PGF to the given М'. For many output formats, additional ·# can be used to control the output.⌡gfНGet the name of the concrete syntax to generate output from. FIXME: there should be an option to change this.Нgf,List of recommended file names and contents.Н⌡┤NoneЯT°²┬NoneЯw·÷═┴NoneЯ°┤╡╠║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪┼NoneЯЫҐЎ▀NoneР!©юабцдефгхийклмнопярстужвьызшэщчъ▄NoneР}ЮАБ█NoneР╒ЦДЕФГХИЙ▌NoneРяКЛМ▐ Safe-InferredСНОПЯРСТУ░AR(stable) (portable)NoneУ©ТgfWas: ,newtype IOE a = IOE { appIOE :: IO (Err a) }Щgf"extends the search path with the Ы and З5 environment variables. Returns only existing paths.┤gf$Catch exceptions caused by calls to or Ж in the В monad. To catch all В exceptions, use D instead.┬gfгPrint the error message and return a default value if the IO operation Жs▄gfрBecause GHC adds the confusing text "user error" for failures caused by calls to Ж.Ьgf:Make raise and handle mimic behaviour of the old IOE monadЖgf#the directory portion of a pathname%AОЯПСРТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░NoneЖ$Ъ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFHIGJKLmnorpqstuvwx·÷═дцбаю©ЎҐ╪╩╨╧╦ЇІ╣Є╠╟╞ўґ╛╚╙╘╗їі╔єё╒║е╡ЁфигхйрпмлкноястуэшзыьжвщДЦБАЮчъЕИХФГЙКЛМ└┐┌│─ЪЧЩЭШЗЫЬВЖУТСРЯПНО┘┴├┬┤┼█▄▌▀▐≈√∙■⌠▓░▒≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞ОЯПСРТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░─storqpmnuvwx·÷═╡Ёе║╒ёє╔ії╗╘╙╚╛ґў╞╟╠Є╣ІЇ╦╧╨╩╪ҐЎ©юабцд▐░▒▓⌠■∙√≈┘┬┤├┴┼▌▀▄█МНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└ЙКЛЕФГХИщчъЮАБЦДужвьызшэстйоянклмпрфгхи╔≥ ⌡°²÷║═╒≤·╙╚їґ╛іёєў╞╗╘ !BA$&%"#'()*+,-./0123456789:;<=@>?ОЯПСРТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░ACDJKEFIGHL▒Krasimir Angelov(stable) (portable)NoneЗ$√gf*Read just the module header, the returned ┬ will have an empty body▒▓⌠■∙√≈▓NoneЗQЫЗ⌠AR(stable) (portable)NoneЭШgfтReturns a list of all files to be compiled in topological order i.e. the low level (leaf) modules are first. getAllFiles :: (MonadIO m,ErrorMonad m) => Options -> [InitPath] -> ModEnv -> FileName -> m [FullPath]Эgf5options can be passed to the compiler by comments in --#з, in the main file getOptionsFromFile :: (MonadIO m,ErrorMonad m) => FilePath -> m Options▒▓⌠■ЩЧШЪ─│┌┐Э└■AR(stable) (portable)NoneЭб≤gfвRead a source file and parse it (after applying preprocessors specified in the options)≤≥ ∙Krasimir Angelov(stable) (portable)None>юабтыЩы┘├┤√NoneЧД²gfаCompile a given source file (or just load a .gfo file), given a ┴- containing everything it depends on. Calls · or ÷.·gfЮRead a compiled GF module. Also undo common subexp optimization, to enable normal computations.÷gfнCompile GF module from source. It both returns the result and stores it in a .gfo, file (or a tags file, if running with the -tags option)⌡°²·÷≈Nonej═gfеCompile the given grammar files and everything they depend on, like batchCompileл. This function compiles modules in parallel. It keeps modules compiled in present and alltenses mode apart, storing the .gfo⌠ files in separate subdirectories to avoid creating the broken PGF files that can result from mixing different modes in the same concrete syntax.╒The first argument controls the number of jobs to run in parallel. This works if GF was compiled with GHC>=7.6, otherwise you have to use the GHC run-time flag +RTS -N -RTS to enable parallelism.═≤None?█┬≥None?╞┴ None┘║gf/Compiles a number of source files and builds a к/ structure for them. This is a composition of ╒ and є.╒gfLink a grammar into a к that can be used to ⌡ and ° with the PGF run-time system.ёgfрReturns the name of the abstract syntax corresponding to the named concrete syntaxєgfъCompile the given grammar files and everything they depend on. Compiled modules are stored in .gfo files (unless the -tagsл option is used, in which case tags files are produced instead). Existing .gfo= files are reused if they are up-to-date (unless the option -src aka -force-recomp is used).║╒ёє²NoneҐ╔gf>Compile the given GF grammar files. The result is a number of .gfo) files and, depending on the options, a .pgf file. ( gf═-batch, gf═-make)іgf Create a .pgfа file (and possibly files in other formats, if specified in the ·) from the output of ═. If a .pgfЙ file by the same name already exists and it is newer than the source grammar files (as indicated by the UTCTime( argument), it is not recreated. Calls ╗ and ї.їgfExport the PGF to the Мs specified in the · . Calls Н.╗gf3Write the result of compiling a grammar (e.g. with compileToPGF or ╒) to a .pgf* file. A split PGF file is output if the -split-pgf option is used.╔ії╗·NoneД╪┼▀▄█▌▐░÷None▒▓═None>?ю #⌠gf│If the Monad m superclass is included, then the generic instance for monad transformers below would require UndecidableInstances■gfRun normally∙gf Redirect √ to the given handle≈gfCapture √⌠≤≥■∙≈ ⌡°²·÷═║╒ёє╔ії║None j╗╘╙╒None ▐ ╚╛ґў╞╟╠╡ЁёNone>ю е япЄ╣ІЇ╦╧╨є Safe-Inferred Ъ╩╪ҐЎ╔None &©юабцдефі Safe-Inferred ^/гхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУї Safe-Inferred ДЖВЬЬ1╗NoneЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓╘ Safe-Inferredб⌠gfDecode hexadecimal escapes■gf(Decode application/x-www-form-urlencoded⌠■╙NoneЕ∙√≈≤≥ ╚None т⌡°²·÷═║╒ёє2╔2╛None}іgf Combined FastCGI and HTTP serverії1ґNone>юы ~╘gf Run the GF Shell in quiet mode (gf═-run).╙gfRun the interactive GF Shell╚gfRun the GF Server ( gf═-server). The ╗2 argument is the port number for the HTTP service.╘╙╚ўNone░╛gfлRun the GF main program, taking arguments from the command line. (It calls setConsoleEncoding and ґ, then ў.) Run gf --help for usage info.ґgfдGet and parse GF command line arguments. Fix relative paths. Calls ╘ and ≥.ўgfъRun the GF main program with the given options and files. Depending on the options it invokes ╔, mainGFI, mainRunGFI, mainServerGFI(, or it just prints version/usage info.╛ґўNoneЄХmnorpquvwx└┘├цефгхи┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²┬┴┼▀▄█▌▐░▒▓⌠■∙√ ≥≈≤⌡╟╞ўґ╛╚╙╘╗єё╒║═÷·°їі²╔╠тряпонмкигдаю©ЎҐ╦Ї╣Ё╡уІ╩цфже╧╨Є╪йхлсбвьызшДАЮъчщэБЦЕФГХИЙКЛМНОРПЯСЬВЖТУЫЗШЭЩ┤├┘└┐┌│─ЧЪ┬┴▀┼▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛╞ў╟ґ╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒Н▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґўИ╛ґў╙╘╚╔і╗ї║╒єё═Н°⌡²·÷≤≥ ┴┘┬ЭЩЧЪ─│┌┐└┘├┤ШЫЗСТУЖВЬ√≈▀∙┼ОПЯРЛМН▄█▌▐▒▓░⌠■≥ ⌡°²·÷═║╒ёє╔≤ИЙКшБЦэщчъЮАД╠сблхй╪Є╨╧ежфц╩Іу╡Ё╣Ї╦ҐЎ©юадгикмнопяртзыьв└┘├⌡²╔ії°·÷═║╒ёє╗╘╙╚╛ґў╞╟√≈≤≥ ⌠■∙▓▒░▐▌█▄▀┼┴┬ії╗╘╙╚opqrmnuvwxЕФГХифехг╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦЕДФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²╛╟ґў╞╠╡╦ЁЄ╣ІЇц╧┘├┤└█▐▒░▓√⌠■∙≈≤≥ ⌡°²┐┬┴▌▀▄┼▒▓⌠■√∙≈·÷═║╒╙╞╟╠╞╟╡ЁЄ╣ЁЄІЁЄЇЁЄ╦ЁЄ╧ЁЄ╨ЁЄ╩ЁЄ╪ЁЄҐЁЄҐЁЄЎЁ©юЁ©аЁ©бцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУ%Ж%В'Ь'Ь'Ы'З'Ш'Э'Щ'ЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·...÷.═.║.╒.ё.є.╔.і.ї.╗╘╙╚0╛0ґ0ў0╞0╟0╠0╡0Ё4Є4╣4І4Ї╦╦╧╨╩╪ҐЎ©юабцдефгхишйклмнопярст3у3ж3в3ь3ы3з3ш3э3щ4ч4ъ4Ю4А4Б4Ц4Д4Е4Ф4Г4Х4И4Й4К4Л4М4Н4О4П4Я6Р6С6Т6У6Ж6В6Ь66Ы6З9Ш:Э:Щ:Ч:Ъ:─:│:┌:┐:└;┘;├;┤;┬;┴;┼;▀<▄<█<▌<▐<░<▒<▓<⌠?⌡?■?∙?√?≈?≤A≥A A⌡A°A²A·A÷A═A║A╒AёAєA╔AіDїD╗D╘D╙D╚D╛DґDўI╞I╟I╠I╡IЁIЄI╣IІIЇI╦I╧I╨I╩I╪IҐIЎI©IюIаIбIцIдIеIфIгIхIиLйLкLкLлLмLнLоLпLяLрLсLтLуLжLвLьLыLзLшLэLщLчLъLЮLАLБLЦLДLЕLФLГLХLИLЙLКLЛLМLНLОLПLЯLРLСLТLУLЖLВLЬLЫLЗLШLЭLЩLЧLЧLЪL─L│L┌L┐L└L┘L├L┤L┬L┴L┼L▀L▄L█L▌L▐L░L▒L▓L⌠L■L∙L√L≈L≤L≥L L⌡L°L²L·L÷L═L║L╒LёLєL╔LіLїL╗L╘L╙L╚L╛LґLўL╞L╟L╠L╡LЁLЄL╣LІLЇL╦L╧L╧L╨L╩L╪LҐLЎL©LюLаLбLцLдLеLфLгLхLиLйLкLлLмLнLоLпLяLрLсLтLуLжLвLьызшэщчъЮАдБЦДккЕФЕТТГГХХИИЙЙККЛЛММННОПЯРРСТУЖТВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒█▓⌠■∙√√≈≈≤≤≥ ⌡⌡°°жж²²··÷÷══║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠P■P∙PРP√P≈P≤P≥P P⌡PуP°P²P·P÷P═P║P╒PёPєP╔PіPїP╗P╘P╙P╚P╛PґPўP╞P╟P╠P╡PЁPЄP╣PІPЇP╦P╧P╨P╩P╪PҐPЎP©PюPаPбPцPдPеPфPгPхPиPйPкPлPмPнPоPпPяPрPсPтPуPжPвPьPыPзPшPэPщPчPъPЮPАPБPЦPжPДPЕPФPГPХPИPЙPКPЛPМPНPНPОPОPПPЯPРPСPТPУPЖPВPЬPЫPЗPШPЭPЩPЧPЪP─P│P┌P┐P└P┘P├P┤P┬P┴P┼P▀P▄P█P▌P▐P═P░P▒P▓P⌠P■P∙P√P≈P≤P≥P P⌡P°P²P·P÷P═P║P╒PёPєP╔PіPїP╗P╘P╙P╚P╛PґPўP╞P╟P╠S╡SЁSЄS╣SІSЇS╦S╧S╨S╩S╪SҐSЎS©TюTаTбTцTдTеTфTгTхTиTйTкTлTмTнTоTпTЦTАTяTрTсTтTуTжTвTьTыTзTшTэTщTчTъTЮTАTБTЦTДTЕTФTГTХTИTЙTКTЛTМTНTОTПTЯTРTСTзTТTУTЖTВTЬTЫTЗTШTЭTЩTЧTЪT─T│T┌T┐T└T┘T├T┤T┬T┴T┼T▀T▄T█T▌T▐T░T▒T▓T⌠T■T∙T√T≈T≤T≥T T⌡T°T²T·T÷T═h║h╒hёhєh╔lіlїl╗l╘l╙l╚l╛l╛lґlўl╞l╟l╠l╡lЁlЄl╣lІmЇm╦m╧m╧m╨m╩m╪mҐmЎm©mюmаmбmцmдmеmфmгmхmиmйmкmлmмmнопярсдту°жвьызшэщчъЮАБЦДЕФГХИЙКЛ├М░Н░О░П░Я░Р░С░Т░У░Ж░В░Ь░Ы░З░Ш░Э░Щ░Ч░Ъ░─ ░│ ░┌ ░┐ ░└ ░┘ ░├ ░┤ ░┬ ░┴ ░┼ ░▀ ░▄ ░█ ░▌ ░▐ ▒░ ▒▒ ▒▓ ▒⌠ ▒■ ▒∙ ▒√ ■≈ ■≤ ■≥ √ √⌡ √° √² √· ≈÷ ═ ║ ╒ ё ²є ²╔ ²і ²ї ґ╗ ґ╘ ґ╙ ў╚ ў╛ ўґ ў ╞ ╟ ў ╞ ╠ ў ╞ ╡ ў ╞ Ё ў ╞ Є ў ╞ ╣ ў ╞ І ў ╞ Ї ў ╞ ╦ ў ╧ ╨ ў ╧ ў ╩ ╪ ў ╩ ╪ ў ╩ Ґ ў ╩ Ў ў ╩ © ў ╩ ю ў ╩ ю ў ╩ а ў ╩ б ў ╩ ц ў ╩ д ў ╩ е ў ╩ ф ў г х ў г и ў г Рў г Рй к л й к л й к м й к н й к о й к п й к п й к я р с т у ж в ь ы з ш э щ ч ъ Ю А Б Ц Д Е Ф Г Х аЕ И аЙ Е И Й К Е И К Л Е М Г Е И Н О П Я Р С Т У Ж В Ь Ы З Ш Э Щ Ч Ъ ─ │ ┌ ┐ └ ┘ ├ б┤ ┬ ┴ ┼ ▀ ▄ █ ▌ ▐ ░ ▒ ▓ ⌠ ■ ∙ √ ≈ ≤ ≥ ⌡ П ° ² · Я Р С Т У Ж В Ь Ы З ≈ ÷ ═ ║ ╒ ё є ╔ і ї ╗ ╘ ╙ ╚ Щ ╛ ґ ў ╞╞ ╟ ╞╞ ╠ ╞╞ ╡ ╞╞ Ё ╞╞ Є ╞╞ ╣ ╞╞ І ╞╞ Ї ╞╞ ╦ ╞╞ ╧ ╞╞ ╨ ╩ ╪ Ґ Ў © ю Ў © а Ў © б Ў © ц Ў © д Ў © Щ Ў © ╚ е ф г х и й к л м ╞н о ╞п я р с т у ж в ь ы з ш э щ ч ъ Ю А Б Б Ц Д Е Ф Г Х И Й К Л М Н О П ╪дЯ Р С Т У Ж В ╞Ь Ы З Ш Э ╞Ь Щ Ч ╞Ъ ─│┌┐└╞┘├┤┬┴┼▀╞▄G█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╞╡Ё╞╡Є╣ІЇ╦╧╨╩╪ҐЎ©юБ аЮ Ю А А бцдБ ефгхийклмнаопцярстужвьыз╞шэ╞щч╞щъ╞ЮА╞БЦДДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩ!Ч!Ъ!─!│!┌!┐!Ї!└!┘!├!┤!┬!┴!┼!▀!▄!ю!█!▌!▐!░!▒!▓!⌠!■!∙!√!≈!≤!≥! !⌡!°!²!·!÷!═!²!║!║!╟!╟"╒"ё"є"ю"╔#і#ї#╗#╘#╙#╚#╛#ґ#ў#╞#╟#і#╠#╡#к #Ё#Є#╣#І#Ї#╦#╧#╨#╩#╪#Ґ#Ў#©#ю#а#б#ц#д#е#ф#г#х$и$й$к$л$м$н$о$п$я$р$с$т$у$ж$в$ь$ы$з$ш$э&щ╛ ґ ч&ъЮАБЮАЦЮАДЮАЕЮАФЮАГЮАХЮАИЮАЙЮАКЮАЛЮАМЮАНЮАОЮАПЮАЯЮАРЮАСЮАТЮАУЮАЖЮАВЮАЬЮАЫЮАЗЮАШЮАЭЮАЩЮАЧЮАЪЮА─ ЮА│ ЮА┌ ЮА┐ ЮА└ ЮА┘ ЮА├ ЮА┤ ЮА┬ ЮА┴ ЮА┼ ЮА▀ ЮА▄ ЮА█ ЮА▌ Ю▐ ░ Ю▐ ▒ Ю▐ ▓ Ю▐ ⌠ Ю▐ ■ Ю▐ ∙ Ю▐ √ Ю▐ ≈ Ю▐ ≤ Ю▐ ≥ Ю▐ Ю▐ ⌡ (° (² (· (÷ (═ (║ (╒ (ё (є (╔ )і *ї *╗ *╘ *╙ *╚ *╛ ,ґ ,ў -╞ -╟ -╠ -╡ -Ё /Є /╣ /І /Ї /╦ ╞┘╧ ╞н ╨ 0╛0╩ 1╪ 1Ґ 1Ў 1© 1ю 1а 1б 1ц 1д 1е 1ф 1г 1х 1и 1й 1к 1л 1м 1н 1о 1п 1я 1р 1с 1т 1у 1ж 1в 1ь 1ы 1з 1ш 1э 1щ 1ч 1ъ 1Ю 1А 2Б 2а2Й 2Щ 2Ц 2Д 2Е 2Ф 2Г 2Х 2И 2Й 2К 2Л 2М 2Н 2О 2П 3Я 3Р 3С 3Т 4 4╔4У 4Ж 4В 4╞4Ь 4╟4Ы 4З 4Ш 4Э 4⌠4█4Щ 4Ч 4Ъ 4─4│4┌4┐4└4┘4├4┤4┬4┴4┼4▀4▄4█4▌4▐4░4╠4°4▒4▓4╨4⌠4■4∙4√4≈5ч5е5≤5Б5≥5ф5 5⌡5°6²6·6÷6Л6Л6К6К6═6═6О6║6╒6ё6є6╔6і6ї6╗6╘6╙6╚6╛6ґ6ў6╞6╟6╠6╠6╡6Ё6Є6╣6І6Ї6╦6╧6╨6╩6╪6Ґ6Ў6Ў66©6ю6а6б6ц6д6е6ф6г6х6и6й6к6л7м8н8о8п8я8р8с8т9у:ж:в;ь;ы;з;ш;э;щ;ч;ъ;Ю;А;Б;Ц;Д;Е;Ф;Г;Х;И;Й;К;Л;М;Н;О;П;Я;Р;ф;е;б;С;Т;У;Ж;В;Ь;Ы;З;Ш;Э;Щ;Ч;Ъ<─<│<┌<┐<└=┘=├>┤>┬>┴@┼A▀A∙A▄A█A█A▌A▐A░A▒A▓A⌠A■A∙A√A≈A≤A≥A A⌡A°A²A·A÷A═A║A╒AёAєA╔AіAїA╗A╘A╙A∙D╚D╛DґE▀E█JшJўJ╞J╟J╠J╡JэJ≥JЁJЄJ╣JІJЇJ╦J╧J╨J╩JЇJяJ≤J╪JҐJЎJ©JБJюJаJбJ╠JцJдJтJеJпJжJфJгJхJиJйJкJлJмJнJоJпKяKрKсKтKуKжKвKьKыKзKшKэKщKчKъKЮKАKБKЦKДKЕKФKГKХKИKЙKКKЛKМKНKОKПKЯKРKСKТKУKЖKВKЬKЫKЗKШKЭKЩKЧKЪK─K│K┌K┐K└K┘K├K┤K┬K┴M┼M▀M▄M█M▌M▐M░M▒M▓M⌠M■M∙M√M≈M≤M≥M NмN⌡N°NЬN²N·N÷N═N║N╒NёNєN╔NіNїN╗N╘N╙N╚N╛NґNўN╞N╟N╠N╡NЁNЄN╣NІNЇN╦N╧N╨N╩N╪NҐNЎN©NюNаNбNцNдNеNфNгNхNиNйNкNлNмNнNоNпNяNрNсNтNуNжNвNьNыNзNшNэNщNчNъNЮNАNБNЦNДNЕNФNГNХNИNЙNКNЛNМNНNОNПNЯOР╛ ґ СQТRУRЖRВR┘RЬR┬R┴RЫRЗRШRЭRЩRЧRЪR─R│U┌U┐U└U┘V├V┤V┬V┴W┼W°W▀W▄W█W▌W▐W░W▒W▓W⌠W■W∙W√W≈W≤X≥X X⌡X°X²X·X÷X═Y║Y╒YёYєY╔YіYї[╗\╘\╙\╚\╛\ґ\ў\╞\╟\╠\╡\Ё\Є\╣\І\Ї\╦\╧\╨\╩\╪\Ґ\Ў\©]ю]а^б^ц^д^С _е_ф_г_х`и`й`кaлaмbнbоcпcЮc┤cяcрcсcтcуcжcвcьcыcзcшcэcщcчcъcЮcАcБcЦcцcбcаcюc©cДcЕcБc┘cФcФcГcХcИcЙcКcЛcМcНcОcПcЯcРcСcТcУcЖcВcЬcЫcЗcШcЭc▐c┼cЫc┴c┬dЩdЧdЪe─e│e┌e┐eЪ e∙e└e┘e├e┤e┬fдfцg┴i┼i▀j▄k█k▌k▌k▐k░k▒k▓k⌠l■l°lыn∙o√o≈o≤p≥p p⌡p°p²p·p÷p═p║p╒pёpєp╔pіpїp╗p╘p╙p╚p╛pґpўp╞p╟p╠p╡pЁpЄpРp╣pІpЇp╦p═p═p╧p╨p╩p╪p╪pҐpЎp©pєpюpаpЦpбpцpдpеpфpгpхpиpйpкpлpмpнpоpпpяpрpсpтpуpжpвpьqыqзrшrэrэrщrчsъsЮsАsБsЦsДsЕsФsГsЮsХsХsИsИsЙsКsЛsМsНtОtПtЯtРtСtТuУuЖvВvЬwЫxЗyШyЭyЩyЧzЪz─{│{└{┌{┐{└{┘{├{┤{┬{┴{┼{▀|▄|▄|█|▌|▐|Ў|Ґ|░|▒|▓|⌠|■|∙|√|≈|≤|≥| }⌡}°}²}·}÷}═}║}╒}╒~ё~є╔─і│ї┌╗┐╘└╙┘╚├╛┤ґ┤ў┬╞┬╟┬╠┴╡┴Ё┴Є┴╣┴І┴┤┴Ї┴Ы┴╦┴Ж┴╧┴╨┴╩┴╩┴╪┴Ґ┴╟┴Ў┴©┴ю┴а┴б┴ц┴д┴е┴ф┴г┴х┼и┼й▀к▀л▀м▀н▀о▀╩▀п▀я▀р▀р▀с▀т▀у▀ж▀в▀ь▀ы▀з▀ш▀э▀щ▀ч▀ъ▀Ю▀А▀Б▀Ц▀Д▀Е▀Ф▀Г▀Х▀И▄Й▄К▄Л█М█Н█О█П█Я█Р█С█Т▌У▌Ж▌В▐┤▐Ь▐Ы▐З▐Ш▐Э▐Щ▐Ч╞Ъ─╛ ґ │░┌▓┐▓└⌠┘⌠├⌠┤⌠┬⌠З⌠┴⌠┼⌠▀⌠▄⌠█∙▌∙▐∙░≤▒≥▓·⌠·⌠·■·∙·√·≈·≤÷≥÷ ═⌡═°═²╞·÷═══║═╒═ё═є═╔═і═ї═╗═╘═╒ ═З═╙═ї ═╚═≥═ ║╛║ґ║ў╒╞╒╟╒╠╒╡╒Ё╒Є╒╣╒І╒Їё╦ё╧ё╨ё╩ё╪ёҐёЎє©єюєаєб╔ц╔д╔е╔ф╔г╔х╔и╔йі╩іюікікілімініоіоіпіяірірісі▀іРіРітіуі і іжівіьіыізішіБіБіэіщі÷і÷ічі÷і·і═і═іъі▓ібіаіжіТіЦіХіЮїЮїАїБ╗Ц╗Д╗Е╗Ф╗Г╗╩╗Х╗И╗Й╗К╗Л╗М╗Н╗О╗П╗Я╗Р╗С╗Т╗У╗Ж╗В╗Ь╗Ы╗З╗Ш╘Э╘Щ╙й╙й╙Ч╙Ъ╙─╙│╚┌╚┐╚└╚У╚┘╚├╚┤╚Ж╚В╚┤╚┬╛┴╛Б╛ ґ Б╞ ┼gf-3.11-4nYtOuqtcAu6rlNC96VMj9 GF.SupportGF.Text.PrettyGF.Text.LexingPGFGFPGF.HaskellGF.Grammar.CanonicalCGICGIUtilsCacheData.Binary.BuilderL BytestringData.Binary.GetData.Binary.PutData.Binary.IEEE754Data.BinaryGF.Compile.MultiGF.Data.BacktrackMGF.Data.ErrM GF.Data.GraphGF.Data.StrGF.Data.UtilitiesGF.Data.RelationGF.Data.OperationsGF.Data.GraphvizGF.Data.XMLGF.Infra.BuildInfoGF.Infra.ConcurrencyGF.Infra.GetOptSystem.EnvironmentgetArgsGF.JavaScript.AbsJSGF.JavaScript.PrintJSGF.Speech.FiniteStateGF.Speech.RegExpGF.System.CatchGF.System.ConcurrencyGF.System.ConsoleGF.System.DirectoryGF.System.ProcessGF.System.UseSignalGF.System.SignalGF.Text.CliticsGF.Text.CodingGF.Infra.LocationGF.Text.TransliterationsPGF.CIdPGF.ByteCodePGF.TrieMapPGF.TypePGF.ExprPGF.TreePGF.DataPGF.SortTopPGF.PrinterPGF.ParaphrasePGF.Morphology PGF.MacrosPGF.ProbabilisticPGF.Optimize PGF.OldBinary PGF.Linearize PGF.Binary PGF.TypeCheckTextPrettyPrintPGF.Generate PGF.Utilities Data.ListnubPGF.InternalGF.Infra.Ident GF.HaskellGF.Grammar.PredefGF.Infra.OptionGF.Infra.CheckMGF.Grammar.LexerGF.Grammar.CanonicalJSONGF.Grammar.GrammarGF.Infra.DependenciesGF.Grammar.ValuesGF.Grammar.PrinterGF.Grammar.MacrosGF.Grammar.PatternMatchGF.Grammar.LockfieldGF.Grammar.LookupGF.Grammar.ShowTermGF.Grammar.Analyse GF.GrammarGF.Grammar.UnifyGF.Compile.TypeCheck.TCGF.Compile.TypeCheck.PrimitivesGF.Compile.TypeCheck.ConcreteGF.Compile.TypeCheck.AbstractGF.Compile.UpdateGF.Compile.SubExOptGF.Compile.RenameGF.Compile.Compute.ValueGF.Compile.Compute.PredefGF.Compile.Compute.Concrete GF.Compile.TypeCheck.ConcreteNewGF.Compile.OptimizeGF.Compile.GrammarToCanonicalGF.Compile.ConcreteToHaskellGF.Compile.CheckGrammar PGF.Forest PGF.ParsePGF.VisualizeTreeGF.Speech.VoiceXMLGF.QuizGF.Grammar.CFGGF.Speech.PGFToCFGGF.Speech.CFGToFA GF.Speech.SRGGF.Speech.SISRGF.Speech.SRGS_XMLGF.Speech.SRGS_ABNFGF.Speech.JSGF GF.Speech.GSL GF.Speech.SLFGF.Speech.PrRegExpGF.Grammar.EBNFGF.Grammar.BNFCGF.Grammar.ParserGF.Compile.ToAPIGF.Compile.PGFtoPythonGF.Compile.PGFtoPrologGF.Compile.PGFtoJavaGF.Compile.PGFtoJSONGF.Compile.PGFtoJSGF.Compile.PGFtoHaskellGF.Compile.GenerateBCGF.Compile.ExportGF.Compile.ExampleBasedGF.Command.TreeOperationsGF.Command.AbstractGF.Command.ParseGF.Command.CommandInfoFoldExampleDemoExampleServicePaths_gfGF.Infra.UseIOGF.Grammar.BinaryGF.Compile.TagsGF.Compile.ReadFilesGF.Compile.GetGrammarGF.Compile.GeneratePMCFG GF.CompileOneGF.CompileInParallelGF.Compile.GrammarToPGFGF.Compile.CFGtoPGF GF.Compile linearizeparseGF.CompilerGF.Command.InterpreterGF.Command.ImportingGF.Infra.SIOGF.Command.SourceCommandsGF.Command.CommonCommandsGF.Command.CommandsGF.Command.MessagesGF.Command.HelpSimpleEditor.SyntaxSimpleEditor.JSONSimpleEditor.ConvertURLEncodingRunHTTP PGFService GF.ServerGF.InteractiveGF.MainbaseControl.Monad.IO.ClassliftIOMonadIOpretty-1.1.3.6#Text.PrettyPrint.Annotated.HughesPJ ZigZagModePageModeLeftModeOneLineModeMode lineLengthmoderibbonsPerLineStylestyleText.PrettyPrint.HughesPJDocemptyisEmptyBinaryencodedecode encodeFile decodeFileErrOkBaderrfromErr ErrorMonadraisehandlehandle_maybeErrtestErrerrIn lookupErr mapPairsMpairMcheckUnique unifyMaybeunifyMaybeByindent+++++-+++++++-+++++prUpperprReplicateprTListprQuotedString prParenthprCurly prBracket prArgListprSemicListprCurlyListrestoreEscapesnumberedParagraphs prConjList prIfEmpty wrapLinestopoTest topoTest2iterFixchunks readIntArgliftErrcheckscatchtry TermColorsredFgblueFgrestoresetConsoleEncodingchangeConsoleEncoding getTermColorsPrettyppppListrenderrender80renderStyle$$$+$<+><>bracesbracketscatdoubleQuotesfcatfsephanghcathsepnestparens punctuatequotessepvcat $fPretty[]$fPrettyChar$fPrettyDouble $fPrettyFloat$fPrettyInteger$fPrettyInt$fPrettyDocLocationNoLocLocalExternal HasSourcePath sourcePathunLocnoLoc ppLocationppLstringOpopInEnvbindTokCIdwildCIdmkCIdutf8CIdreadCIdshowCIdpIdentppCIdBindTypeExplicitImplicitExprR_sHas_sproj_sPrefixTokTKTPBIND SOFT_BIND SOFT_SPACECAPIT ALL_CAPITStrEnumAllenumAlltablefromStrto_R_s!!$!*$fHas_sR_st$fEnumAllR_s$fEqR_s$fOrdR_s $fShowR_s$fEqTok$fOrdTok $fShowTokHypoTypereadTypeshowTypemkTypemkHypo mkDepHypo mkImplHypounTypeTreereadExprshowExprmkAbsunAbsmkAppunAppunapplymkStrunStrmkIntunIntmkDoubleunDoublemkFloatunFloatmkMetaunMetapExprppMetaLanguageSeqIdFunIdSequenceLIndexFIdTokenreadLanguageshowLanguage paraphraseMorphoAnalysisLemmabuildMorpholookupMorpho isInMorphofullFormLexicon morphoMissingmorphoKnownBracketedStringLeafBracketmissingLins showPrintNameshowBracketedStringflattenBracketedString ProbabilitiesshowProbabilitiesreadProbabilitiesFromFilemkProbabilitiesdefaultProbabilitiessetProbabilitiesprobTreerankTreesByProbslinearizeAlllinearizeAllLangbracketedLinearizebracketedLinearizeAlltabularLinearizesTcError UnknownCat UnknownFunWrongCatArgsTypeMismatch NotFunTypeCannotInferTypeUnresolvedMetaVarsUnexpectedImplArgUnsolvableGoal ppTcError checkType checkExpr inferExprgenerateAllgenerateAllDepthgenerateFromgenerateFromDepthgenerateRandomgenerateRandomDepthgenerateRandomFromgenerateRandomFromDepthRawIdentIdent ModuleNameMNmoduleNameS rawIdentS rawIdentCshowRawIdentprefixRawIdent isPrefixOf ident2utf8 ident2raw showIdentidentSprefixIdentidentCidentVidentAidentAVidentWargIdent isArgIdentgetArgIndexvarStrvarXisWildIdentvarIndexOptionsFlagsoptModeoptStopAfterPhaseoptVerbosityoptShowCPUTimeoptOutputFormatsoptSISRoptHaskellOptionsoptLexicalCatsoptLiteralCats optGFODiroptOutputDiroptGFLibPathoptDocumentRoot optRecompoptProbsFileoptRetainResourceoptNameoptPreprocessorsoptEncodingoptPMCFGoptOptimizationsoptOptimizePGFoptSplitPGFoptCFGTransformsoptLibraryPathoptStartCatoptSpeechLanguageoptLexer optUnlexeroptWarningsoptDumpoptTagsOnlyoptHeuristicFactoroptCaseSensitive optPlusAsBindoptJobsoptTraceRecompAlwaysRecomp RecompIfNewerNeverRecompPassSourceRebuildExtendRename TypeCheckRefreshOptimizeCanonDump HaskellOptionHaskellNoPrefixHaskellGADTHaskellLexicalHaskellConcreteHaskellVariantsHaskellDataHaskellPGF2CFGTransformCFGNoLR CFGRegularCFGTopDownFilterCFGBottomUpFilterCFGStartCatOnlyCFGMergeIdenticalCFGRemoveCyclesOptimizationOptStemOptCSE OptExpandOptParametrize SISRFormatSISR_WD20030401SISR_1_0OutputFormatFmtPGFPrettyFmtCanonicalGFFmtCanonicalJson FmtJavaScriptFmtJSON FmtPython FmtHaskellFmtJava FmtPrologFmtBNFFmtEBNF FmtRegularFmtNoLRFmtSRGS_XMLFmtSRGS_XML_NonRecFmtSRGS_ABNFFmtSRGS_ABNF_NonRecFmtJSGFFmtGSLFmtVoiceXMLFmtSLF FmtRegExpFmtFAPhasePreprocConvertCompileLink VerbosityQuietNormalVerboseDebugModeVersionModeHelpModeInteractiveModeRunModeInteractive2ModeRun2ModeCompiler ModeServerhelpMessageparseOptionsparseModuleOptionsfixRelativeLibPaths optionsGFO optionsPGFflag addOptions noOptions concatOptionsmodifyFlagsgetEncodingdefaultEncodingoutputFormatsExplrenameEncodingreadOutputFormatverbAtLeastdumpcfgTransform haskellOptionisLiteralCatisLexicalCatsetOptimizationsetCFGTransformRhsSeparatorrhsSepPPAppAQualIdQualUnqualId FlagValueIntFltFlagNameVarId AnonymousCatIdModIdParamId VarValueIdLabelIdPredefIdTableRow RecordRow TableRowValueRecordRowValue RecordRowTypeParam ParamValueDefParamPattern ParamValue LinPattern RecordPatternTuplePatternWildPattern LinLiteral FloatConstantIntConstantStrConstantLinValueConcatValueLiteralValue ErrorValue ParamConstantPredefValueRecordValue TableValue TupleValueVariantValueVarValuePreValue Projection SelectionCommentedValue ParamTypeParamTypeIdLinType FloatTypeIntType RecordTypeStrType TableType TupleTypeLinDef LincatDefParamDef ParamAliasDefConcreteTypeBindingTypeAppFunDefCatDefAbstractGrammar abstrNameconcNamesemiSepblock$fPrettyFlagValue $fPrettyFlags $fPrettyVarId $fPrettyFunId $fPrettyCatId$fPrettyTypeBinding$fPrettyType$fPrettyFunDef$fPrettyCatDef $fPrettyModId$fPrettyAbstract$fPrettyLabelId$fPrettyTableRow$fPrettyParamType$fPrettyLinType$fPrettyLincatDef$fPrettyParamDef$fPrettyVarValueId$fPrettyLinDef$fPrettyConcrete$fPrettyGrammar$fPPAQualId$fPrettyQualId$fPPAParamId$fPrettyParamId $fPPAPredefId$fPrettyPredefId$fPPALinPattern$fPrettyLinPattern$fPPALinLiteral$fPrettyLinLiteral $fPPALinValue$fPrettyLinValue $fPPAParam $fPrettyParam$fPrettyTypeApp $fPPAType$fPrettyRecordRow$fRhsSeparatorLinPattern$fRhsSeparatorLinValue$fRhsSeparatorLinType $fShowGrammar$fShowConcrete$fShowLinDef$fEqLinValue $fOrdLinValue$fShowLinValue$fEqVarValueId$fOrdVarValueId$fShowVarValueId$fShowParamDef$fShowLincatDef$fEqLinType$fOrdLinType $fShowLinType $fEqParamType$fOrdParamType$fShowParamType$fEqTableRow $fOrdTableRow$fShowTableRow$fFunctorTableRow$fFoldableTableRow$fTraversableTableRow$fEqLinPattern$fOrdLinPattern$fShowLinPattern $fEqParam $fOrdParam$fShowParam$fFunctorParam$fFoldableParam$fTraversableParam$fEqParamId$fOrdParamId $fShowParamId $fEqQualId$fOrdQualId$fShowQualId$fEqPredefId $fOrdPredefId$fShowPredefId $fEqRecordRow$fOrdRecordRow$fShowRecordRow$fFunctorRecordRow$fFoldableRecordRow$fTraversableRecordRow$fEqLabelId$fOrdLabelId $fShowLabelId$fShowAbstract $fEqModId $fOrdModId$fShowModId$fShowCatDef$fShowFunDef $fShowTypeApp $fShowType$fShowTypeBinding $fEqCatId $fOrdCatId$fShowCatId $fEqFunId$fShowFunId$fShowVarId$fShowFlags$fShowFlagValue$fEqLinLiteral$fOrdLinLiteral$fShowLinLiteralSubstitutionAlternLocalDefCaseAssign LabellingEquationContextMetaIdLabelLIdentLVarTInfoTRawTTypedTCompTWildPattPCPPPVPWPRPStringPIntPFloatPTPAsPImplArgPTildePNegPAltPSeqPMSeqPRepPCharPCharsPMacroPMTermVrCnConSortEIntEFloatKEmptyAppAbsMetaImplArgProdTypedExampleRecTypeRPExtRTableTVSLetQQCCGlueEPatt EPattTypeELincatELin AdHocOverloadFVAltsStrsErrorQIdentFunCatInfoAbsCatAbsFunResParamResValueResOperResOverloadCncCatCncFunAnyIndPMCFG ProductionModuleStatus MSCompleteMSIncompleteOpenSpecOSimpleOQualifMIncludeMIAllMIOnlyMIExcept ModuleType MTAbstract MTResource MTConcreteMTInterface MTInstance SourceModInfoSourceModule SourceGrammar ModuleInfoModInfomtypemstatusmflagsmextendmwithmopensmexdepsmsrcmseqsjmentsModule moduleMapmodulesextendsisInherited inheritAllopenedModule depPathModule allDepsModule partOfGrammar allExtendsallExtendsPlus prependModuleemptyGrammarmGrammarabstractOfConcretelookupModuleisModAbsisModResisModCnc sameMTypeisCompilableModuleisCompleteModuleallAbstractsgreatestAbstractallResourcesgreatestResourceallConcretesallConcreteModulesvarLabel tupleLabellinLabeltheLinLabelident2labellabel2ident TermPrintQualTerseUnqualified QualifiedInternalppModuleppJudgementppTermppPattppValue ppConstrsppQIdentppParamsgetAbstypeFormtypeFormCncvalCatvalType valTypeCnctypeSkeletoncatSkeleton funsToAndFromisRecursiveTypeisHigherOrderType contextOfTypetermFormtermFormCncappFormmkProdSimplemkProdmkTermappConsmkLetmkLetUntyped isVariableuTypeassignassignTunzipRmkAssign projectRec zipAssign mapAssignM mkRecordNmkRecord mkRecTypeN mkRecTyperecord2substtypeType typePTypetypeStrtypeToktypeStrs typeStringtypeInt typeFloattypeInts typePBool typeError isTypeIntsisPredefConstantcheckPredefErrorcnPredef mkSelectsmkTablemkCTable eqStrIdenttuple2recordtuple2recordTypetuple2recordPattmkCasesmkWildCases mkFunTypeplusRecType plusRecord defLinType mkFreshVarmkFreshVarXmaxVarIndexmkFreshVarsfreshAsTermstring2termint2term float2termident2terminal symbolOfIdentsymidjustIdentOf linTypeStrlinAsStr term2patt patt2termcomposSafeOpcomposOpcomposSafePattOpcomposPattOp collectOp mconcatMap collectPattOpredirectTerm allCaseValuesstrsFromTermgetTableTypechangeTableTypewordsInTermnoExistdefaultLinTypesortRecallDependenciestopoSortJmentstopoSortJments2grammar2canonicalabstract2canonicalconcretes2canonical projection selection ParseStateParseOutputParseFailed TypeErrorParseOkParseIncomplete ParseInputpiToken piLiteral initStatesimpleParseInputmkParseInput nextStategetCompletionsrecoveryStatesgetParseOutputgetContinuationInfo CncLabelsLabelsGraphvizOptionsnoLeavesnoFunnoCatnoDepnodeFontleafFont nodeColor leafColor nodeEdgeStyle leafEdgeStylegraphvizDefaultsgraphvizAbstractTreegraphvizDependencyTreegetDepLabelsgraphvizParseTreegraphvizParseTreeDepgraphvizBracketedString gizaAlignmentgraphvizAlignmentconlls2latexDocgetCncDepLabelsTrieOthApATreeOtherreadPGFparsePGFparseAllparseAllLangparse_parseWithRecoverycompletegroupResultsabstractName languageslanguageCode categoriescategoryContextstartCat functionsfunctionsByCatfunctionTypecomputeexprSize exprFunctionsbrowsetoATreetoTrie $fShowTrie$fShowATree exportPGFOutputePutStr ePutStrLnputStrE putStrLnEIOEFullPathInitPathFileName putIfVerb gfLibraryPathgfGrammarPathVargetLibraryDirectorygetGrammarPath extendPathEnv getSubdirsjustModuleNameisGFisGFOgfFilegfoFilegf2gfogf2gfo'splitInModuleSearchPathtryIOEuseIOEmaybeIOdie putPointEioErrorTexttimeIt writeUTF8FilereadBinaryFilewriteBinaryFile VersionTaggedTaggedWrongVersionunVdecodeModuledecodeModuleHeaderencodeModulegetSourceModulegetBNFCRulesgetEBNFRulesCompiledModule OneOutput compileOnereuseGFOuseTheSourceparallelBatchCompilecompileToPGFlink srcAbsNamebatchCompilemainGFClinkGrammarswriteOutputswritePGF mainRunGFImainGFI mainServerGFImain getOptionsmainOpts%cgi-3001.5.0.0-8Hb15ctrym8K6fSeuEVDxxNetwork.CGI setHeader readInputgetInputrequestAcceptLanguagegetVarWithDefaultoutputErrorhandleErrors outputFPSoutputNetwork.CGI.MonadrunCGITNetwork.CGI.Protocol CGIRequestcgiRequestBodycgiVars cgiInputsInputinputContentType inputValue inputFilename CGIResult CGIOutput CGINothingNetwork.CGI.Accept negotiateAccept&multipart-0.2.1-FRr2yMUX3oIJRxteV2JoHTNetwork.Multipart.HeaderContentTypectTypectParameters ctSubtype HeaderNameHeaderslogErrorstderrToFile throwCGIErrorhandleCGIErrorsoutputJSONPoutputEncodedJSONP outputPNGoutputBinary outputBinary' outputHTMLoutputPlain outputTextnewCache flushCacheexpireCache listCache readCache readCache'Builderbytestring-0.10.10.0Data.ByteString.Lazy.Internal ByteStringtoLazyByteStringData.ByteString.Lazy singletonappendfromByteStringData.ByteString.Internal fromChunksfromLazyByteStringflushputWord16beputWord16leputWord32beputWord32leputWord64beputWord64leputWordhost putWord16host putWord32host putWord64hostGetrunGetgetrunGetStateskip uncheckedSkip lookAhead lookAheadM lookAheadEuncheckedLookAhead bytesRead remaining getByteStringgetLazyByteStringgetLazyByteStringNulgetRemainingLazyByteStringgetBytesgetWord8getWord16begetWord16legetWord32begetWord32legetWord64begetWord64legetWordhost getWord16host getWord32host getWord64hostPutPutMexecPutrunPutrunPutMputWord8 putByteStringputLazyByteStringunPut putBuildergetFloat16begetFloat16legetFloat32begetFloat32legetFloat64begetFloat64leputFloat32beputFloat32leputFloat64beputFloat64leputghc-prim GHC.TypesWordGHC.WordWord8Word16Word32Word64bitReverse64bitReverse32bitReverse16bitReverse8 byteSwap64 byteSwap32 byteSwap16encodeFile_decodeFile_ readMulti mtl-2.2.2Control.Monad.State.Classgetsmodify'modify MonadStatestate BacktrackMrunBMfoldBM foldSolutions solutionsfoldFinalStatesfinalStatesmembercut GHC.MaybeMaybe Data.Maybemaybe$fMonadPlusErr$fFunctorErrnewGraphnodesedgesnmapemapnewNode removeNoderemoveNodesnodeInfomergeGraphsrenameNodesNodeInfoEdgeNodeGraphnewNodesnewEdgenewEdgesinsertEdgeWithgetIncominggetOutgoinginDegree outDegreegetNodeLabel nodeLabeledgeFromedgeTo edgeLabelreverseGraphstr2stringssstrstrstrTokplusStrglueStrsafeInitGHC.ListinitsortGroupByunionAlllookup'lookupfind' Data.FoldablefindtableSet buildMultiMap compareEqwhenMPGHC.Basemzero nothingOrNullfoldFunsfixjoinnub'Data.OldListreplace sameLength notLongerThan longerThan lookupListsplitsplitBy foldMergeselect updateNth updateNthM compareBybothapFstapSndapBothmapFstmapSndmapBothwhenMrepeatMnlspwrapconcatSunwordsSunlinesSjoinSmkRelmkRel'isRelatedTo allRelatedreflexiveClosuredomainreflexiveElementsequivalenceClassestopologicalSortData.EitherLeftRightreflexiveClosure_ReltransitiveClosuresymmetricClosuresymmetricSubrelationreflexiveSubrelationisTransitiveisReflexiveisSymmetric isEquivalenceisSubRelationOf findCyclesAttr GraphTypeDirected UndirectedgTypegIdgAttrsgNodesgEdges gSubgraphsaddSubGraphssetNamesetAttr prGraphvizXMLDataCDataTagETagCommentcomments showXMLDocshowsXMLDocshowsXMLbottomUpXML buildInfoControl.Concurrent.ChanChanControl.Concurrent.MVar modifyMVarmodifyMVar_ GHC.Conc.SyncforkIOGHC.MVarMVarFuturenowspawnparMapMnewLognewMVarreadMVarputMVarnewEmptyMVarnewChangetChanContents writeChanlazyIOArgDescrNoArgReqArgOptArgOptDescrOptionArgOrderRequireOrderPermute ReturnInOrder usageInfogetOptgetOpt'PropertyNameIntPropNameStringPropName IdentPropNamePropertyPropESeqEObjEArrayEThisENullEFalseETrueEStrEDblEVarECallEIndexEMemberENewEAssignEFunDeclVarDInitDVar DeclOrExprDExprDeclStmtSDeclOrExprSReturnSReturnVoid SCompoundElementElStmtProgramPrintprtprtList printTreeFAnewFA_nonLoopTransitionsTorenameStates insertNFA oneFinalStatemoveLabelsToNodesremoveTrivialEmptyNodesnewFADFANFAState startStatestatestransitions addFinalStatenewState newStates newTransitionnewTransitionsinsertTransitionWithinsertTransitionsWith mapStatesmapTransitionsmodifyTransitionsremoveStateminimizeunusedNamesnonLoopTransitionsFromloopsonGraph isInternaldfa2nfaprFAGraphvizfaToGraphvizREUnionREConcatRERERepeatRESymboldfa2re epsilonREnullREisNull isEpsilonunionREconcatREseqRErepeatRE minimizeREmapREmapRE'joinRE symbolsREprREsetNumCapabilitiesFalsegetNumberOfProcessorsdirectory-1.3.6.0System.DirectorygetTemporaryDirectorygetUserDocumentsDirectorygetAppUserDataDirectorygetXdgDirectoryListgetXdgDirectorygetHomeDirectorysetModificationTime setAccessTime getAccessTimegetSymbolicLinkTargetisSymbolicLinkpathIsSymbolicLinkremoveDirectoryLinkcreateDirectoryLinkcreateFileLink doesPathExistgetFileSizewithCurrentDirectorysetCurrentDirectory listDirectoryexeExtension findFilesWithfindFileWith findFilesfindFilefindExecutablesInDirectoriesfindExecutablesfindExecutablemakeRelativeToCurrentDirectorymakeAbsolutecopyFileWithMetadatacopyFile renamePathrenameDirectoryremovePathForciblyremoveDirectoryRecursiveremoveDirectorycreateDirectorycopyPermissionssetPermissionssetOwnerSearchablesetOwnerExecutablesetOwnerWritablesetOwnerReadableemptyPermissions System.Directory.Internal.CommonPermissions searchable executablereadablewritableXdgDirectoryXdgCacheXdgData XdgConfigXdgDirectoryListXdgDataDirs XdgConfigDirscanonicalizePathcreateDirectoryIfMissingdoesDirectoryExist doesFileExistgetModificationTimegetDirectoryContentsgetCurrentDirectorygetPermissions removeFile renameFilereadShellProcessrunInterruptiblyrunInterruptibly_blockInterruptmyInstallHandlermyCatchmyIgnore getCliticsgetCliticsText encodeUnicode decodeUnicodedecodeUnicodeIOioe_invalidCharacter1ioe_invalidCharacter2 transliteratetransliterateWithFiletransliterationtransliterationPrintNamescharacterTableStringNothingpCIdLStrLIntLFltTailInfoRecCallTailCall UpdateCallIValHEAPARG_VARFREE_VARGLOBALInstr CHECK_ARGSCASECASE_LITSAVEALLOC PUT_CONSTRPUT_CLOSUREPUT_LITSETSET_PAD PUSH_FRAMEPUSHTUCKEVALDROPJUMPFAIL PUSH_ACCUM POP_ACCUMADD CodeLabelLiteralppLitppCodeppInstrTrieMapnullcompose decompose insertWithunion unionWithunions unionsWithelemstoListfromListWithfromListmap mapWithKeyDTyppTypeppTypeppHypoPAppPLitPVarPWildEAbsEAppELitEMetaETypedEImplArg normalFormppParens freshNameppExprpBindspArgEnvSigValueVGenVAppVMetaVSuspVConstVLitVClosureVImplArgEqupMetapLit pattScope value2exprevalapply applyValueVarLit tree2expr expr2treeprTreeaflagsfunscatsPArgPConstPApplyPCoerceSymbolSymALL_CAPITSymCAPIT SymSOFT_SPACESymSOFT_BINDSymNESymBINDSymKPSymKSSymVarSymCatSymLitDotPosConcrlexiconlproductionspproductionslinrefslindefs printnames totalCats sequencesproductionscncfunscflagscnccatsAbstrgflagsabsname concretesabstractunionPGFmsgUnionPGFemptyPGFhaveSameFunsPGF fidStringfidIntfidFloatfidVarfidStartisPredefFId forExampleppPGFppCatppFunppSeqppFIdppFunIdppSeqIdparaphraseNmorphoClassifymissingWordMsglengthBracketedStringCncTypeLinTable BracketedToknLeafKP LeafCAPIT LeafSOFT_BINDLeafBINDLeafNELeafKSBracket_mapConcreteslookTypeisData lookValCatlookStartCatlookGlobalFlaglookAbsFlag lookConcrlookConcrComplete lookConcrFlagfunctionsToCathasLinrestrictPGFdepthcftype typeOfHypo contextLengthlookMapcombinations cidStringcidIntcidFloatcidVarppBracketedStringuntokn mkLinTable computeSeq sortNubBycompareCaseInsensitveProbsfunProbscatProbsgetProbabilities mkProbDefsoptimizePGFupdateProductionIndicesversiongetPGFgetPGF'putSplitAbsSelector splitSelectorTcMunTcM MetaValueMUnboundMBoundMGuarded MetaStoreScopeTTypeTTyp emptyScopeaddScopedVarscopeEnv scopeSizerunTcM lookupFunTypetypeGeneratorsemptyMetaStorenewMetanewGuardedMetagetMetasetMeta lookupMetatcExprinfExpreqTypeeqValuecheckResolvedMetaStoregenerateForMetasgenerateForForestgenerateOntologygenerateOntologyDepthprovePatExpTyConApDecWildPAsPConPVarPConstLetsList LambdaCaseOpPairTApTIdListTLhsFunDepsDerivingEqnInstanceTypeSigClassconap0tsyn0lhs0tvartcon0tconletslet1singlepluspluscTypecPTypecTokcStrcStrs cPredefAbs cPredefCnccPredefcIntcFloatcStringcVarcIntscPBool cErrorType cOverloadcUndefinedType cNonExistcBIND cSOFT_BINDcSOFT_SPACEcCAPIT cALL_CAPITisPredefCatcPTruecPFalsecLengthcDropcTakecTkcDpcToUppercToLowercIsUppercEqStrcEqValcOccurcOccurscEqIntcLessIntcPluscShowcReadcToStrcMapStrcErrorcTracecMetacAscCharcCharscSeqcAltcRepcNegcCNC cConflict checkError checkWarncheckAccumErroraccumulateErrorcommitCheckrunCheck runCheck' checkInModuleCheckCheckResultMessage checkCond checkWarnings parallelCheckcheckMapcheckMapRecovercheckInPosnPnT_Ident T_exclmarkT_pattT_int_labelT_oparenT_cparenT_tildeT_star T_starstarT_plus T_plusplusT_commaT_minusT_rarrowT_dotT_altT_colonT_semicolonT_lessT_equalT_big_rarrowT_greatT_questmarkT_obrackT_lamT_lamlamT_cbrackT_ocurlyT_barT_ccurlyT_underscoreT_at T_cfarrowT_PTypeT_StrT_StrsT_TokT_Type T_abstractT_caseT_cat T_concreteT_dataT_defT_flagsT_fnT_funT_inT_incomplete T_instanceT_interfaceT_letT_linT_lincatT_lindefT_linrefT_ofT_openT_operT_param T_patternT_preT_printname T_resourceT_strsT_table T_transfer T_variantsT_whereT_withT_coercionsT_terminatorT_separator T_nonemptyT_String T_IntegerT_DoubleT_EOFisReservedWordrunP runPartialfailLoclexertokengetPosn encodeJSONBooldepGraph MetaSubstConstraintsBindsValVRecTypeVCnVTypeVClos valAbsIntvalAbsFloatvalAbsStringvTypeeTypematchPatterntestOvershadow findMatchmeasurePattlockRecTypeunlockRecord lockLabelisLockLabellookupOrigInfolookupCatContextlookupIdentlookupResDeflookupResDefLoc lookupResTypelookupOverloadTypeslookupOverloadallOrigInfoslookupParamValuesallParamValueslookupAbsDeflookupLincatallOpers allOpersToTermPrintStyleTermPrintDefaultTermPrintOne TermPrintListTermPrintAllTermPrintTableshowTerm ppTermTabularstripSourceGrammarconstantDepsTermsizeConstantsizeTermsizesModulesizesGrammarprintSizesGrammarunifyValTheoryAExpAVrACnATypeAIntAFloatAStrAMetaALetAAppAAbsAProdARecTypeARAPAGlueADatawhnfeqValcheckExpinferExpcheckBranch typPredefined primitivescomputeLType inferLType checkLTypecheckContextcheckTypcheckDefcheckConstrsbuildAnyTree rebuildModuleextendModulesubexpModuleunsubexpModulerenameSourceTermrenameModule PredefinedNonExistLessIntEqIntPlusLengthIsUpperToLowerToUpperOccursOccurEqStrDpTkTakeDropIntsPBoolPTruePFalseTraceFloatBindBindingWildVErrorVStrsVAltsVFV VPattTypeVPattVPVSVCVTVVVRecVTblTypeVSortVStringVFloatVIntVProdVAbsVCApppredef predefNamedeltaresourceValues value2term GLocation GlobalEnvgeLoc geGrammarvapply#<#optimizeModuleconcretes2haskellconcrete2haskellcheckModulegetAbsTreesForestabstrrootconcrforestlinearizeWithBrackets ErrorStategrammar2vxmlmkQuiztranslationListmorphologyListCFObjCFAbsCFAppCFResCFVarCFMetaremoveCyclesbottomUpFilter topDownFiltermergeIdenticalpurgeExternalCats mutRecCatsallRulesallRulesGroupedallCatsallCats'catRulescatSetRulescleanCFGunionCFG anyUsedBy allXLinear isRightLinearisLeftLinearcatElemParamCFGParamCFRule ParamCFSymbolCFGCFRuleCFSymbolCFTermcfgRulescfgExternalCatscfgStartCatRuleruleNameruleRhsruleLhsNonTerminalTerminalremoveLeftRecursionmakeSimpleRegularmakeRegularmkCFG groupProds uniqueFuns mapCFGCatsonRules filterCFG filterCFGCats countCats countRulesprCFG prProductionsprCFTermruleFunmkCFTermruleIsNonRecursivesymbol mapSymbol filterCats filterToksnoCatsInSetpgfToCFG bnfPrintercfgToFA'MFAcfgToFAcfgToMFASRGNTSRGAltsrgNamesrgStartCatsrgLanguagemakeNonLeftRecursiveSRGmakeNonRecursiveSRG SRGSymbolSRGItemSRGRuleSRGsrgExternalCatssrgRulesebnfPrinter isExternalCat lookupFM_SISRTagprSISR topCatSISRprofileInitSISRcatSISRprofileFinalSISRsrgsXmlPrintersrgsXmlNonRecursivePrintersrgsAbnfPrintersrgsAbnfNonRecursivePrinterjsgfPrinter gslPrinter slfSubPrinterslfGraphvizPrinterslfSubGraphvizPrinter slfPrinter regexpPrintermultiRegexpPrinterERHSETermENonTermEAltEStarEPlusEOptEEmptyERuleEBNFebnf2cfBNFCRule BNFCCoercionsBNFCTerminator BNFCSeparatorlhsCatcoerCatcoerNumtermNonEmptytermCattermSepsepNonEmptysepCatsepSep BNFCSymbolbnfc2cfpModDefpTopDef pModHeaderpTermpExp pBNFCRules pEBNFRulesHappyStk exprToAPIstringToAPI pgf2pythongrammar2prologgrammar2javapgf2jsonpgf2jsgrammar2haskellgenerateByteCodeoutputConcrparseExamplesInGrammarconfigureExBasedtreeOp allTreeOps treeChunksArgumentAMacroANoArgAExprATermVStrVIdOOptOFlagCommandPipeCommandLine valCIdOpts valIntOpts valStrOpts listFlagsvalueStringisOptisFlagoptsAndFlagsprOptmkOptgetCommandOpreadCommandLinepCommand CommandOutputPipedCommandArgumentsStringsExprsTypeCheckArgtypeCheckArgCommandInfoneedsTypeCheckexampleslongnameexplanationsyntaxsynopsisexecflagsoptionsmapCommandExecemptyCommandInfofromStrings fromExprs fromStringpipeWithMessagepipeMessage pipeExprsvoidstringAsExpr toStringstoExprstoTermmkExfoldablefoldappFoldEnvirongetNextprovideExampletestThissearchGoodTreeisMeta mkFuncWithArginitialnewPGFCachecgiMaincgiMain' getBinDir getLibDirgetDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameControl.Monad.FailfailIO$fErrorMonadIO writeTags gf2gftagsgetAllFilesgetOptionsFromFileModEnvModName gfImports gfoImportsimportsOfModuleparseSource getPragmas generatePMCFGaddPMCFG pgfCncCatmkCanon2pgfcf2pgf CommandEnvcommands commandmacros expmacrosmkCommandEnvinterpretCommandLine importGrammarimportSourceMonadSIOrunSIOhRunSIOGHC.IO.Handle.FDstdout captureSIOliftSIOSIO restrictedrestrictedSystemputStrputStrLn putStrLnFlushprint getCPUTime newStdGenlazySIO HasGrammar getGrammarsourceCommandsextendcommonCommands stringOpsenvFlagstringOpOptionstrietoStringtoLinestoParagraphs HasPGFEnv getPGFEnvPGFEnvpgfmospgfEnvpgfCommandswelcome licenseMsg codingMsg changesMsgcommandHelpAll'commandHelp'commandHelpcommandHelpTagssection optionallycompacthelpCommandLinargslinfunOperorhsonameLincatlintypeprhspnamelangcodeopersopenslincatsparamslinsftypefnamestartcatbasename signature definition.=CncJmentIgnoredLiLCPaparseModule convModuleconvAbstractconvExtends convExtend convAbsJmentsconvAbsJmentconvTypeconvSimpleTypeconvId convModIdconvConcrete convOpensconvOpen convCncJmentsconvCncJmentconvBind jmentList jmentLocationlocurlDecodeUnicodedecodeQueryportdocumentRootrunHTTP cgiHandlerCachespgfCachelogFile flushPGFCachelistPGFCachegetPath%server