Z6?      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+, - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                                                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                                  ! " # $ % & ' ( ) * + , - . / 0123456789:;<=>portablestable$Niklas Broberg, d00nibro@chalmers.se% `A portion of the source, extended with information on the position of entities within the span. ;Test if a given span starts and ends at the same location. !An entity located in the source. NA portion of the source, spanning one or more lines and zero or more columns.  !!A single position in the source. "#$%&6Combine two locations in the source to denote a span. 'FMerge two source spans into a single span from the start of the first I to the end of the second. Assumes that the two spans are given in the $ order they appear in the source. ()*+,-./&  !"#$%&'?()*+,-./%!"#$% &'()*+,-./ %     !"#$%"#$%&'()*+,-./portablestable$Niklas Broberg, d00nibro@chalmers.se}0123A guarded case alternative | stmts -> exp. 45The right-hand sides of a case alternative, . which may be a single right-hand side or a  set of guarded ones. 6gdpat 7-> exp 8An alt alternative in a case expression. 9:An fbind1 in a labeled construction or update expression. ;record field wildcard <record field pun =ordinary label-expresion pair > A general  transqual in a list comprehension, 6 which could potentially be a transform of the kind ! enabled by TransformListComp. ?then group by exp using exp @then group using exp Athen group by exp Bthen exp by exp Cthen exp Dan ordinary statement E!A statement, representing both a stmt in a do -expression,  an ordinary qual' in a list comprehension, as well as a stmt  in a pattern guard. F%a recursive binding group for arrows Glocal bindings Han exp by itself: in a do -expression, & an action whose result is discarded; , in a list comprehension and pattern guard,  a guard expression I a generator: pat <- exp JAn fpat in a labeled record pattern. Krecord field wildcard Lrecord field pun Mordinary label-pattern pair N An entity in a regular pattern. OPQRSTUVWA regular pattern operator. X?! = 0 or 1, greedy Y? = 0 or 1 Z+! = 1 or more, greedy [+ = 1 or more \*! = 0 or more, greedy ]* = 0 or more ^An XML attribute in a pattern. _`*A pattern, to be matched against a value. astrict (bang) pattern:  f !x = ... bquasi quote pattern: [$name| string |] c+Explicit generics style type argument e.g. f {| Int |} x = ... dXML regular list pattern eXML embedded pattern fXML PCDATA pattern gXML singleton element pattern hXML element pattern iregular list pattern jview patterns of the form (exp -> pat) kpattern with type signature lirrefutable pattern: ~pat mwildcard pattern: _ n@ -pattern olabelled pattern, record style pparenthesized pattern q list pattern rtuple pattern s'data constructor and argument patterns t'pattern with an infix data constructor u n+k pattern vnegated pattern wliteral constant x variable y<Warning text to optionally use in the module header of e.g.  a deprecated module. z{|BVariables used in a RULES pragma, optionally annotated with types }~The body of a RULES pragma. %Activation clause of a RULES pragma. &Recognised tools for OPTIONS pragmas. 9A top level options pragma, preceding the module header. AOPTIONS pragma, possibly qualified with a tool, e.g. OPTIONS_GHC CFILES pragma INCLUDE pragma LANGUAGE pragma 3The calling convention of a foreign function call. 'The safety of a foreign function call. safe (@) or threadsafe (A) unsafe %A template haskell splice expression !parenthesised expression splice: $(exp) variable splice: $var 'A template haskell bracket expression. declaration bracket:  [d| ... |] type bracket:  [t| ... |] pattern bracket:  [p| ... |] expression bracket: [| ... |] 3An xml attribute, which is a name-expression pair. )The name of an xml element or attribute, ( possibly qualified with a namespace. Haskell expressions. -higher-order arrow application (from right): exp >>- exp ,higher-order arrow application (from left): exp -<< exp  arrow application (from right): exp >- exp arrow application (from left): exp -< exp  arrows proc: proc pat -> exp GENERATED pragma  SCC pragma  CORE pragma &escaped haskell expression inside xml PCDATA child element #empty xml element, with attributes *xml element, with attributes and children quasi-quotaion: [$name| string |] #template haskell splice expression $template haskell bracket expression ''T( for template haskell reifying of types 'x. for template haskell reifying of expressions (expression with explicit type signature parallel list comprehension ordinary list comprehension bounded arithmetic sequence,  with first two elements given [from, then .. to] unbounded arithmetic sequence,  with first two elements given [from, then ..] bounded arithmetic sequence,  incrementing by 1  [from .. to] unbounded arithmetic sequence,  incrementing by 1: [from ..] record update expression record construction expression right section (qop exp)  left section (exp qop) parenthesised expression list expression tuple section expression, e.g. (,,3) tuple expression mdo -expression do -expression:  the last statement in the list  should be an expression. case exp of alts if exp then exp else exp local declarations with let ... in ... lambda expression negation expression -exp (unary minus) ordinary application infix application literal constant data constructor implicit parameter variable  variable literal E Values of this type hold the abstract value of the literal, not the 3 precise string representation used. For example, 10, 0o12 and 0xa  have the same representation. unboxed string literal unboxed character literal unboxed double literal unboxed float literal unboxed word literal unboxed integer literal floating point literal integer literal string literal character literal Class assertions. * In Haskell 98, the argument would be a tyvar, but this definition 5 allows multiple parameters, and allows them to be types. P Also extended with support for implicit parameters and equality constraints. type equality constraint implicit parameter assertion 4class assertion where the class name is given infix ordinary class assertion !A context is a set of assertions +A functional dependency, given on the form  l1 l2 ... ln -> r2 r3 .. rn An explicit kind annotation. 5a kind variable (as-of-yet unsupported by compilers) a parenthesised kind ->!, the kind of a type constructor !, the kind of unboxed types *, the kind of types JA type variable declaration, optionally with an explicit kind annotation. ordinary variable binding &variable binding with kind annotation 3Flag denoting whether a tuple is boxed or unboxed. !A type qualified with a context. - An unqualified type has an empty context. "type with explicit kind signature infix type constructor type surrounded by parentheses named type or type constructor type variable "application of a type constructor list syntax, e.g. [a], as opposed to [] a tuple type, possibly boxed function type qualified type A guarded right hand side | stmts = exp. B The guard is a series of statements when using pattern guards, 7 otherwise it will be a single qualifier expression. 6The right hand side of a function or pattern binding. guarded right hand side (gdrhs) unguarded right hand side (exp) BThe type of a constructor argument or field, optionally including  a strictness annotation. 0unboxed component, marked with an UNPACK pragma non-strict component strict component, marked with "!" -Declarations inside an instance declaration.  an INLINE pragma  5an associated data type implemented using GADT style  'an associated data type implementation  an associated type definition  ordinary declaration )Declarations inside a class declaration. .default choice for an associated type synonym *declaration of an associated type synonym 'declaration of an associated data type ordinary declaration BA single constructor declaration in a GADT data type declaration. +Declaration of a (list of) named field(s). -Declaration of an ordinary data constructor. record constructor infix data constructor ordinary data constructor AA single constructor declaration within a data type declaration, 9 which may have an existential quantification binding. Clauses of a function binding.  $A binding of an implicit parameter. !"A binding group inside a let or where clause. #(A binding group for implicit parameters $An ordinary binding group %5A deriving clause following a data type declaration. &'%The head of an instance declaration. ()*+)The head of a type or class declaration. ,-./GA flag stating whether a declaration is a data or newtype declaration. 012A top-level declaration. 3A SPECIALISE instance pragma 4A SPECIALISE INLINE pragma 5A SPECIALISE pragma 6An INLINE pragma 7A WARNING pragma 8A DEPRECATED pragma 9A RULES pragma :A foreign export declaration ;A foreign import declaration <A pattern binding ="A set of function binding clauses >A type signature declaration ?(A Template Haskell splicing declaration @A declaration of default types A!A declaration of operator fixity B"A standalone deriving declaration C(An declaration of a type class instance DA declaration of a type class E/A data family instance declaration, GADT style F#A data family instance declaration G#A type family instance declaration HA data family declaration I*A data OR newtype declaration, GADT style JA data OR newtype declaration KA type family declaration LA type declaration MAssociativity of an operator. N*right-associative operator (declared with infixr) O)left-associative operator (declared with infixl). P(non-associative operator (declared with infix) QFAn import specification, representing a single explicit item imported  (or hidden) from a module. RT(C_1,...,C_n): / a class imported with some of its methods, or 4 a datatype imported with some of its constructors. ST(..): . a class imported with all of its methods, or 3 a datatype imported with all of its constructors. TT: 0 the name of a class, datatype or type synonym. U variable V'An explicit import specification list. WXAn import declaration. YZ/annotation, used by parser for position of the import keyword. [name of the module imported. \ imported  qualified? ]imported with {-# SOURCE #-}? ^$imported with explicit package name _optional alias name in an as clause. `(optional list of import specifications. aAn item in a module's export specification. bmodule M:  re-export a module. cT(C_1,...,C_n): / a class exported with some of its methods, or 4 a datatype exported with some of its constructors. dT(..): . a class exported with all of its methods, or 3 a datatype exported with all of its constructors. eT: * a class or datatype exported abstractly,  or a type synonym. f variable g"An explicit export specification. hiCThe head of a module, including the name and export specification. jk"A complete Haskell source module. lBa hybrid module combining an XML document with an ordinary module mYa module consisting of a single XML document. The ModuleName never appears in the source N but is needed for semantic purposes, it will be the same as the file name. nan ordinary Haskell module oA name (cname/) of a component of a class or data type in an import  or export specification. pname of a data constructor qname of a method or field rOperators appearing in infix# declarations are never qualified. sconstructor operator (conop) tvariable operator (varop) u$Possibly qualified infix operators (qop), appearing in expressions. vconstructor operator (qconop) wvariable operator (qvarop) xAn implicit parameter name. y%ident, linear implicit parameter z?ident , non-linear implicit parameter {AThis type is used to represent variables, and also constructors. |varsym or consym }varid or conid. ~=This type is used to represent qualified variables, and also  qualified constructors. )built-in constructor with special syntax unqualified local name "name qualified with a module name "Constructors with special syntax. F These names are never qualified, and always refer to builtin type or  data constructors. $unboxed singleton tuple constructor (# #) list data constructor (:) n-ary tuple type and data  constructors (,) etc, possibly boxed (#,#) function type constructor -> list type constructor [] unit type and data constructor () The name of a Haskell module. }0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~}knmlijy{zghafedcbXYZ[\]^_`VWQUTSRMPON2LKJIHGFEDCBA@?>=<;:9876543+.-,'*)("$# !     %&/10EIHGF>DCBA@?:=<;8957634`xwvutsrqponmlkjihgfedcbaJMLK^_NVUTSRQPOW]\[ZYX~{}|uwvrtsoqpxzy|~}012}0121234457667899:=<;;<=>DCBA@??@ABCDEIHGFFGHIJMLKKLMNVUTSRQPOOPQRSTUVW]\[ZYXXYZ[\]^__`xwvutsrqponmlkjihgfedcbaabcdefghijklmnopqrstuvwxy{zz{|~}}~-             !!"$##$%&&'*)(()*+.-,,-./10012LKJIHGFEDCBA@?>=<;:98765433456789:;<=>?@ABCDEFGHIJKLMPONNOPQUTSRRSTUVWWXYZ[\]^_`YZ[\]^_`afedcbbcdefghhijjknmllmnoqppqrtsstuwvvwxzyyz{}||}~[BCDEFGH"type with explicit kind signature Iinfix type constructor J#assertion of an implicit parameter Ktype surrounded by parentheses Lnamed type or type constructor Mtype variable N"application of a type constructor Olist syntax, e.g. [a], as opposed to [] a Ptuple type, possibly boxed Qfunction type RSTUVWXYZ[\]^_`abcd f !a = ... ef {| Int |} x = ... fghijklmn $...|... opq''T r'x sregular patterns only tregular patterns only uregular patterns only vregular patterns only wpatterns only xpre-ops y post-ops zpatterns only {patterns only |patterns only }expression type signature ~parallel list comprehension bounded arithmetic sequence,  with first two elements given unbounded arithmetic sequence,  with first two elements given bounded arithmetic sequence,  incrementing by 1 unbounded arithmetic sequence,  incrementing by 1 record update expression record construction expression parenthesized expression 2 RightSection QOp PExp -- ^ right section (qop exp) list expression tuple section expression, e.g. (,,3) mdo -expression  | Tuple [PExp]$ -- ^ tuple expression do -expression:  the last statement in the list  should be an expression. case exp of alts if exp then exp else exp local declarations with let lambda expression negation expression - exp ordinary application infix application literal constant data constructor implicit parameter variable  variable [BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~[BFEDCCDEFG RQPONMLKJIHHIJKLMNOPQRSWVUTTUVWXYYZ]\[[\]^6~}|{zyxwvutsrqponmlkjihgfedcba`__`abcdefghijklmnopqrstuvwxyz{|}~portable experimental$Niklas Broberg, d00nibro@chalmers.se11An identifier with the given string as its name. 4 The string should be a valid Haskell identifier. 2A symbol identifier. The string should be a valid  Haskell symbol identifier.  A local variable as expression. )Use the given identifier as an operator. $A qualified variable as expression. A pattern variable. -Application of expressions by juxtaposition. Apply an operator infix. )Apply a function to a list of arguments. /A constructor pattern, with argument patterns. A tuple expression. A tuple pattern. 1A tuple expression consisting of variables only. .A tuple pattern consisting of variables only. A function with a given name. A literal string expression.  A literal character expression. A literal integer expression. A literal string pattern. A literal character pattern. A literal integer pattern. +A do block formed by the given statements. , The last statement in the list should be  a H expression. -Lambda abstraction, given a list of argument $ patterns and an expression body. A let ... in block. A case expression. An unguarded alternative in a case expression. (An alternative with a single guard in a case expression. !An unguarded righthand side of a case alternative. )An list of guarded righthand sides for a case alternative. &A single guarded righthand side for a case alternative. A list expression. The empty list expression. The empty list pattern. &Put parentheses around an expression. "Put parentheses around a pattern. "A qualifier expression statement. A generator statement: pat <- exp A let binding group as a statement. 0Hoist a set of declarations to a binding group. An empty binding group. The wildcard pattern: _ EGenerate k names by appending numbers 1 through k to a given string.  A function with a single clause >A function with a single clause, a single argument, no guards  and no where declarations :A pattern bind where the pattern is a variable, and where  there are no guards and no 'where' clause. :A pattern bind where the pattern is a variable, and where ! there are no guards, but with a 'where' clause. %Bind an identifier to an expression. 7Apply function of a given name to a list of arguments. 9Apply a constructor of a given name to a list of pattern - arguments, forming a constructor pattern. ... portable stable %Niklas Broberg, d00nibro@chalmers.se @All AST elements that may include expressions which in turn may 9 need fixity tweaking will be instances of this class. 8Tweak any expressions in the element to account for the = fixities given. Assumes that all operator expressions are 0 fully left associative chains to begin with. The fixities to account for. The element to tweak. 9The same element, but with operator expressions updated. 9Operator fixities are represented by their associativity 5 (left, right or none) and their precedence (0-9). %All fixities defined in the Prelude. *All fixities defined in the base package. Note that the +++- operator appears in both Control.Arrows and ; Text.ParserCombinators.ReadP. The listed precedence for +++ in ( this list is that of Control.Arrows.     portable stable %Niklas Broberg, d00nibro@chalmers.se , portable  transient %Niklas Broberg, d00nibro@chalmers.se E+This datatype is a copy of the one in Cabal'%s Language.Haskell.Extension module. P The intention is to eventually import it from Cabal, but we need to wait for K the next release of Cabal which includes XmlSyntax and RegularPatterns.       !"#$%&'()=Certain extensions imply other extensions, and this function @ makes the implication explicit. This also handles deprecated / extensions, which imply their replacements. < The returned valued is the transitive closure of implied  extensions. &List of all known extensions. Poor man's  instance  (we can't enum with the  constructor). *"The list of extensions enabled by  GHC'#s portmanteau -fglasgow-exts flag. +)A clever version of read that returns an  $ if the string is not recognised. D      !"#$%&'()*+D('&%$#"!      +)*D@('&%$#"!            !"#$%&'()*+ portable stable %Niklas Broberg, d00nibro@chalmers.se portablestable$Niklas Broberg, d00nibro@chalmers.seFMonad for parsing ,%Static parameters governing a parse. , Note that the various parse functions in Language.Haskell.Exts.Parser 1 never look at LANGUAGE pragmas, regardless of  what the ignoreLanguagePragmas flag is set to.  Only the various  parseFile functions in Language.Haskell.Exts will  act on it, when set to @. -.'original name of the file being parsed /'list of extensions enabled for parsing 0if A, the parser won' t care about further extensions ' in LANGUAGE pragmas in source files 1 list of fixities to be aware of 2The result of a parse. 3"The parse failed at the specified ) source location, with an error message. 4'The parse succeeded, yielding a value. 57Retrieve the result of a successful parse, throwing an 2 error if the parse is actually not successful. 6 Default parameters for a parse. ' The default is an unknown filename, $ no extensions (i.e. Haskell 98),  don't ignore LANGUAGE pragmas, % and be aware of fixities from the Prelude. IDiscard some input characters (these must not include tabs or newlines). 5Discard the next character, which must be a newline. 1Discard the next character, which must be a tab.      5,-./0123456     5,-./01-./012433456     portablestable$Niklas Broberg, d00nibro@chalmers.se !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS) TUVWXYZ] [\]^_`abcdefghijklmnopqrstuvwxyz{|}~ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~~}|{zyxwvutsrqponmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"!  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ portablestable$Niklas Broberg, d00nibro@chalmers.seX7A guarded case alternative | stmts -> exp. 89The right-hand sides of a case alternative, . which may be a single right-hand side or a  set of guarded ones. :gdpat ;-> exp <An alt alternative in a case expression. =>An fbind1 in a labeled construction or update expression. ?record field wildcard @record field pun Aordinary label-expresion pair B A general  transqual in a list comprehension, 6 which could potentially be a transform of the kind ! enabled by TransformListComp. Cthen group by exp using exp Dthen group using exp Ethen group by exp Fthen exp by exp Gthen exp Han ordinary statement I!A statement, representing both a stmt in a do -expression,  an ordinary qual' in a list comprehension, as well as a stmt  in a pattern guard. J%a recursive binding group for arrows Klocal bindings Lan exp by itself: in a do -expression, & an action whose result is discarded; , in a list comprehension and pattern guard,  a guard expression M a generator: pat <- exp NAn fpat in a labeled record pattern. Orecord field wildcard Precord field pun Qordinary label-pattern pair R An entity in a regular pattern. STUVWXYZ[A regular pattern operator. \?! = 0 or 1, greedy ]? = 0 or 1 ^+! = 1 or more, greedy _+ = 1 or more `*! = 0 or more, greedy a* = 0 or more bAn XML attribute in a pattern. cd*A pattern, to be matched against a value. estrict (bang) pattern:  f !x = ... fquasi quote patter: [$name| string |] g+Explicit generics style type argument e.g. f {| Int |} x = ... hXML regular list pattern iXML embedded pattern jXML PCDATA pattern kXML singleton element pattern lXML element pattern mregular list pattern nview patterns of the form (exp -> pat) opattern with type signature pirrefutable pattern: ~pat qwildcard pattern: _ r@ -pattern slabelled pattern, record style tparenthesized pattern u list pattern vtuple pattern w'data constructor and argument patterns x'pattern with an infix data constructor y n+k pattern znegated pattern {literal constant | variable }<Warning text to optionally use in the module header of e.g.  a deprecated module. ~BVariables used in a RULES pragma, optionally annotated with types The body of a RULES pragma. %Activation clause of a RULES pragma. 9A top level options pragma, preceding the module header. AOPTIONS pragma, possibly qualified with a tool, e.g. OPTIONS_GHC CFILES pragma INCLUDE pragma LANGUAGE pragma 3The calling convention of a foreign function call. 'The safety of a foreign function call. safe (@) or threadsafe (A) unsafe %A template haskell splice expression !parenthesised expression splice: $(exp) variable splice: $var 'A template haskell bracket expression. declaration bracket:  [d| ... |] type bracket:  [t| ... |] pattern bracket:  [p| ... |] expression bracket: [| ... |] 3An xml attribute, which is a name-expression pair. )The name of an xml element or attribute, ( possibly qualified with a namespace. Haskell expressions. -higher-order arrow application (from right): exp >>- exp ,higher-order arrow application (from left): exp -<< exp  arrow application (from right): exp >- exp arrow application (from left): exp -< exp  arrows proc: proc pat -> exp GENERATED pragma  SCC pragma  CORE pragma &escaped haskell expression inside xml PCDATA child element #empty xml element, with attributes *xml element, with attributes and children quasi-quotaion: [$name| string |] #template haskell splice expression $template haskell bracket expression ''T( for template haskell reifying of types 'x. for template haskell reifying of expressions (expression with explicit type signature parallel list comprehension ordinary list comprehension bounded arithmetic sequence,  with first two elements given [from, then .. to] unbounded arithmetic sequence,  with first two elements given [from, then ..] bounded arithmetic sequence,  incrementing by 1  [from .. to] unbounded arithmetic sequence,  incrementing by 1: [from ..] record update expression record construction expression right section (qop exp)  left section (exp qop) parenthesised expression list expression tuple section expression, e.g. (,,3) tuple expression mdo -expression do -expression:  the last statement in the list  should be an expression. case exp of alts if exp then exp else exp local declarations with let ... in ... lambda expression negation expression -exp (unary minus) ordinary application infix application literal constant data constructor implicit parameter variable  variable literal E Values of this type hold the abstract value of the literal, not the 3 precise string representation used. For example, 10, 0o12 and 0xa  have the same representation. unboxed string literal unboxed character literal unboxed double literal unboxed float literal unboxed word literal unboxed integer literal floating point literal integer literal string literal character literal Class assertions. * In Haskell 98, the argument would be a tyvar, but this definition 5 allows multiple parameters, and allows them to be types. P Also extended with support for implicit parameters and equality constraints. type equality constraint implicit parameter assertion 4class assertion where the class name is given infix ordinary class assertion !A context is a set of assertions +A functional dependency, given on the form  l1 l2 ... ln -> r2 r3 .. rn An explicit kind annotation. 5a kind variable (as of yet unsupported by compilers) !a kind surrounded by parentheses ->!, the kind of a type constructor !, the kind of unboxed types *, the kind of types JA type variable declaration, optionally with an explicit kind annotation. ordinary variable binding &variable binding with kind annotation !A type qualified with a context. - An unqualified type has an empty context. "type with explicit kind signature infix type constructor type surrounded by parentheses named type or type constructor type variable "application of a type constructor list syntax, e.g. [a], as opposed to [] a tuple type, possibly boxed function type qualified type A guarded right hand side | stmts = exp. B The guard is a series of statements when using pattern guards, 7 otherwise it will be a single qualifier expression. 6The right hand side of a function or pattern binding. guarded right hand side (gdrhs) unguarded right hand side (exp) BThe type of a constructor argument or field, optionally including  a strictness annotation. 0unboxed component, marked with an UNPACK pragma non-strict component strict component, marked with "!" -Declarations inside an instance declaration. an INLINE pragma 5an associated data type implemented using GADT style 'an associated data type implementation an associated type definition ordinary declaration )Declarations inside a class declaration. .default choice for an associated type synonym *declaration of an associated type synonym 'declaration of an associated data type  ordinary declaration  BA single constructor declaration in a GADT data type declaration.   -Declaration of an ordinary data constructor.  record constructor infix data constructor ordinary data constructor AA single constructor declaration within a data type declaration, 9 which may have an existential quantification binding. Clauses of a function binding. $A binding of an implicit parameter. A binding group inside a let or where clause. (A binding group for implicit parameters An ordinary binding group GA flag stating whether a declaration is a data or newtype declaration. A top-level declaration. A SPECIALISE instance pragma A SPECIALISE INLINE pragma A SPECIALISE pragma  An INLINE pragma !A WARNING pragma "A DEPRECATED pragma #A RULES pragma $A foreign export declaration %A foreign import declaration &A pattern binding '"A set of function binding clauses (A type signature declaration )(A Template Haskell splicing declaration *A declaration of default types +!A declaration of operator fixity ,"A standalone deriving declaration -(An declaration of a type class instance .A declaration of a type class //A data family instance declaration, GADT style 0#A data family instance declaration 1#A type family instance declaration 2A data family declaration 3*A data OR newtype declaration, GADT style 4A data OR newtype declaration 5A type family declaration 6A type declaration 7LA single derived instance, which may have arguments since it may be a MPTC. 8Associativity of an operator. 9*right-associative operator (declared with infixr) :)left-associative operator (declared with infixl). ;(non-associative operator (declared with infix) <FAn import specification, representing a single explicit item imported  (or hidden) from a module. =T(C_1,...,C_n): / a class imported with some of its methods, or 4 a datatype imported with some of its constructors. >T(..): . a class imported with all of its methods, or 3 a datatype imported with all of its constructors. ?T: 0 the name of a class, datatype or type synonym. @ variable AAn import declaration. BCposition of the import keyword. Dname of the module imported. E imported  qualified? Fimported with {-# SOURCE #-}? G$imported with explicit package name Hoptional alias name in an as clause. I(optional list of import specifications.  The  is A if the names are excluded  by hiding. JAn item in a module's export specification. Kmodule M:  re-export a module. LT(C_1,...,C_n): / a class exported with some of its methods, or 4 a datatype exported with some of its constructors. MT(..): . a class exported with all of its methods, or 3 a datatype exported with all of its constructors. NT: * a class or datatype exported abstractly,  or a type synonym. O variable P"A complete Haskell source module. QRA name (cname/) of a component of a class or data type in an import  or export specification. Sname of a data constructor Tname of a method or field UOperators appearing in infix# declarations are never qualified. Vconstructor operator (conop) Wvariable operator (varop) X$Possibly qualified infix operators (qop), appearing in expressions. Yconstructor operator (qconop) Zvariable operator (qvarop) [An implicit parameter name. \%ident, linear implicit parameter ]?ident , non-linear implicit parameter ^AThis type is used to represent variables, and also constructors. _varsym or consym `varid or conid. a=This type is used to represent qualified variables, and also  qualified constructors. b)built-in constructor with special syntax cunqualified local name d"name qualified with a module name e"Constructors with special syntax. F These names are never qualified, and always refer to builtin type or  data constructors. f$unboxed singleton tuple constructor (# #) glist data constructor (:) hn-ary tuple type and data  constructors (,) etc, possibly boxed (#,#) ifunction type constructor -> jlist type constructor [] kunit type and data constructor () lThe name of a Haskell module. mnopqrstuvwxyz{|}~g!"#$%789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~gPQ}~JONMLKABCDEFGHI<@?>=8;:96543210/.-,+*)('&%$#"!  7    IMLKJBHGFEDC>A@?<=9;:78d|{zyxwvutsrqponmlkjihgfeNQPObcRZYXWVUTS[a`_^]\lmadcb^`_XZYUWVekjihgfRTS[]\nopqrstuvwxyz{|}~!"#$%X7889;::;<==>A@??@ABHGFEDCCDEFGHIMLKJJKLMNQPOOPQRZYXWVUTSSTUVWXYZ[a`_^]\\]^_`abccd|{zyxwvutsrqponmlkjihgfeefghijklmnopqrstuvwxyz{|}~~-          6543210/.-,+*)('&%$#"!  !"#$%&'()*+,-./012345678;:99:;<@?>==>?@ABCDEFGHIBCDEFGHIJONMLKKLMNOPQQRTSSTUWVVWXZYYZ[]\\]^`__`adcbbcdekjihgffghijklmmnopqrstuvwxyz{|}~ portable experimental$Niklas Broberg, d00nibro@chalmers.se11An identifier with the given string as its name. 4 The string should be a valid Haskell identifier. 2A symbol identifier. The string should be a valid  Haskell symbol identifier.  A local variable as expression. )Use the given identifier as an operator. $A qualified variable as expression. A pattern variable. -Application of expressions by juxtaposition. Apply an operator infix. )Apply a function to a list of arguments. /A constructor pattern, with argument patterns. A tuple expression. A tuple pattern. 1A tuple expression consisting of variables only. .A tuple pattern consisting of variables only. A function with a given name. A literal string expression.  A literal character expression. A literal integer expression. A literal string pattern. A literal character pattern. A literal integer pattern. +A do block formed by the given statements. , The last statement in the list should be  a L expression. -Lambda abstraction, given a list of argument $ patterns and an expression body. A let ... in block. A case expression. An unguarded alternative in a case expression. (An alternative with a single guard in a case expression. !An unguarded righthand side of a case alternative. )An list of guarded righthand sides for a case alternative. &A single guarded righthand side for a case alternative. A list expression. The empty list expression. The empty list pattern. &Put parentheses around an expression. "Put parentheses around a pattern. "A qualifier expression statement. A generator statement: pat <- exp A let binding group as a statement. 0Hoist a set of declarations to a binding group. An empty binding group. The wildcard pattern: _ EGenerate k names by appending numbers 1 through k to a given string.  A function with a single clause >A function with a single clause, a single argument, no guards  and no where declarations :A pattern bind where the pattern is a variable, and where  there are no guards and no 'where' clause. :A pattern bind where the pattern is a variable, and where ! there are no guards, but with a 'where' clause. %Bind an identifier to an expression. 7Apply function of a given name to a list of arguments. 9Apply a constructor of a given name to a list of pattern - arguments, forming a constructor pattern. ...  portable stable %Niklas Broberg, d00nibro@chalmers.se @All AST elements that may include expressions which in turn may 9 need fixity tweaking will be instances of this class. 8Tweak any expressions in the element to account for the = fixities given. Assumes that all operator expressions are 0 fully left associative chains to begin with. The fixities to account for. The element to tweak. 9The same element, but with operator expressions updated. 9Operator fixities are represented by their associativity 5 (left, right or none) and their precedence (0-9). %All fixities defined in the Prelude. *All fixities defined in the base package. Note that the +++- operator appears in both Control.Arrows and ; Text.ParserCombinators.ReadP. The listed precedence for +++ in ( this list is that of Control.Arrows.      portable  experimental %Niklas Broberg, d00nibro@chalmers.se @DTranslate an annotated AST node representing a Haskell module, into F a simpler version that retains (almost) only abstract information. N In particular, XML and hybrid XML pages enabled by the XmlSyntax extension 7 are translated into standard Haskell modules with a page function. CTranslate an annotated AST node representing a Haskell declaration M into a simpler version. Note that in the simpler version, all declaration  nodes are still annotated by "!s. KTranslate an annotated AST node representing a Haskell type into a simpler  unannotated form. BTranslate an annotated AST node representing a Haskell expression $ into a simpler unannotated form. HTranslate an annotated AST node representing a top-level Options pragma $ into a simpler unannotated form. ?Translate an annotated AST node representing a Haskell pattern $ into a simpler unannotated form. @@@portablestable$Niklas Broberg, d00nibro@chalmers.seuGThings that can be pretty-printed, including all the syntactic objects  in Language.Haskell.Exts.Syntax. %Pretty-print something in isolation. 0Pretty-print something in a precedence context. ;The document type produced by these pretty printers uses a   environment. Pretty printing monad Pretty-printing parameters. Note: the 3 must be positive and less than all other indents.  #indentation of a class or instance  indentation of a do -expression  indentation of the body of a  case expression  %indentation of the declarations in a  let expression  %indentation of the declarations in a  where clause #indentation added for continuation ' lines that would otherwise be offside  blank lines between statements? Pretty-printing style to use add GHC-style LINE pragmas to output?  Varieties of layout we can use. everything on a single line )inline decls, with newlines between them classical layout made explicit classical layout CThe default mode: pretty-print using the offside rule and sensible  defaults. 1render the document with a given style and mode. 'render the document with a given mode. render the document with . *pretty-print with a given style and mode. 6pretty-print with the default style and a given mode. (pretty-print with the default style and .      !      !                  portablestable$Niklas Broberg, d00nibro@chalmers.seA !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`tBCDEFGHIJKLMNOPQRSXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"#$%&),-134:>EFHIKLMOPQRSTUVWX]^_`""#$%&),-134:>EFHIKLMOPQRSTUVWX]^_`portablestable$Niklas Broberg, d00nibro@chalmers.seabcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()CParse of a string, which should contain a complete Haskell module. *PParse of a string containing a complete Haskell module, using an explicit mode. +dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. ,3Parse of a string containing a Haskell expression. -KParse of a string containing a Haskell expression, using an explicit mode. .dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. /0Parse of a string containing a Haskell pattern. 0HParse of a string containing a Haskell pattern, using an explicit mode. 1dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. 2>Parse of a string containing a Haskell top-level declaration. 3VParse of a string containing a Haskell top-level declaration, using an explicit mode. 4dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. 5-Parse of a string containing a Haskell type. 6EParse of a string containing a Haskell type, using an explicit mode. 7dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. 89:;NPartial parse of a string starting with a series of top-level option pragmas. <=>?,-./0123456)*+,-./01234567;)*+,-./01234567; ;Class to reuse the parse function at many different types. "Parse a string with default mode. &Parse a string with an explicit mode. KParse a string with an explicit mode, returning all comments along the AST  !CParse of a string, which should contain a complete Haskell module. "PParse of a string containing a complete Haskell module, using an explicit mode. #dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. $3Parse of a string containing a Haskell expression. %KParse of a string containing a Haskell expression, using an explicit mode. &dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. '0Parse of a string containing a Haskell pattern. (HParse of a string containing a Haskell pattern, using an explicit mode. )dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. *>Parse of a string containing a Haskell top-level declaration. +VParse of a string containing a Haskell top-level declaration, using an explicit mode. ,dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. --Parse of a string containing a Haskell type. .EParse of a string containing a Haskell type, using an explicit mode. /dParse of a string containing a complete Haskell module, using an explicit mode, retaining comments. ,-./0123456 !"#$%&'()*+,-./,-./0162435!"#$%&'()*+,-./  !"#$%&'()*+,-./portablestable$Niklas Broberg, d00nibro@chalmers.se 0;Parse a source file on disk, using the default parse mode. 1KParse a source file on disk, with an extra set of extensions to know about , on top of what the file itself declares. 2<Parse a source file on disk, supplying a custom parse mode. 34@Parse a source file from a string using the default parse mode. 5QParse a source file from a string, with an extra set of extensions to know about , on top of what the file itself declares. 6=Parse a source file from a string using a custom parse mode. 783Gather the extensions declared in LANGUAGE pragmas # at the top of the file. Returns @ if the  parse of the pragmas fails. AB[  !"#$%&'?()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456     012345678 021346578 012345678portablestable$Niklas Broberg, d00nibro@chalmers.se 9;Parse a source file on disk, using the default parse mode. :KParse a source file on disk, with an extra set of extensions to know about , on top of what the file itself declares. ;<Parse a source file on disk, supplying a custom parse mode. <@Parse a source file from a string using the default parse mode. CQParse a source file from a string, with an extra set of extensions to know about , on top of what the file itself declares. ==Parse a source file from a string using a custom parse mode. >3Gather the extensions declared in LANGUAGE pragmas # at the top of the file. Returns @ if the  parse of the pragmas fails. DE* !"#$%      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./9:;<=>9;:<=>9:;<=>F !"#$%&'())*+,,-.//01234556789:;<=>?@ABCDEFFGGHIIJKLJMNOPQRMSTUVWXYZ[\]^_`abcdefghijkllmnopqrstuvwxyz{|}~      !!"#$%%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSSTTUVWXYZ[\]^_`abbccdefdghijklmnopqrstuvwxyz{|}~      !!"#$%&'()* F F G G H I I J K L J M N O P Q R M S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l l m n o p q r s t u v w x y z { | } ~                   +                                                                                                                                            ! ! " # $ . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A   B C D E F G H I % J K L M N O P Q R T T , V W X Y Z [ \ ] ^ _ ` a d d g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                             - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k lmnnopqrstuvwxyz{|}~                    KLJ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~            !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsttuv23wxxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?>?@haskell-src-exts-1.2.0Language.Haskell.Exts.PrettyLanguage.Haskell.Exts.SrcLoc&Language.Haskell.Exts.Annotated.Syntax%Language.Haskell.Exts.Annotated.Build&Language.Haskell.Exts.Annotated.FixityLanguage.Haskell.Exts.Comments*Language.Haskell.Exts.Annotated.ExactPrintLanguage.Haskell.Exts.ExtensionLanguage.Haskell.Exts.ParserLanguage.Haskell.Exts.SyntaxLanguage.Haskell.Exts.BuildLanguage.Haskell.Exts.Fixity(Language.Haskell.Exts.Annotated.SimplifyLanguage.Haskell.Exts.AnnotatedLanguage.Haskell.Exts!Language.Haskell.Exts.ParseSyntaxLanguage.Haskell.Exts.ExtScheme Language.Haskell.Exts.ParseMonadLanguage.Haskell.Exts.Lexer Language.Haskell.Exts.ParseUtils$Language.Haskell.Exts.InternalParserpretty-1.0.1.2Text.PrettyPrint.HughesPJstyleribbonsPerLine lineLengthmodeStylePageMode ZigZagModeLeftMode OneLineModeModeSrcInfo toSrcInfo fromSrcInfo getPointLocfileName startLine startColumn SrcSpanInfo srcInfoSpan srcInfoPointsLoclocunLocSrcSpansrcSpanFilenamesrcSpanStartLinesrcSpanStartColumnsrcSpanEndLinesrcSpanEndColumnSrcLoc srcFilenamesrcLine srcColumn mkSrcSpan mergeSrcSpan noInfoSpaninfoSpan combSpanInfo<++><+?><**<^^> Annotatedannamap GuardedAlt GuardedAlts UnGuardedAltAlt FieldUpdate FieldWildcardFieldPunQualStmt GroupByUsing GroupUsingGroupByThenBy ThenTransStmtRecStmtLetStmt Qualifier GeneratorPatFieldPFieldWildcard PFieldPun PFieldPatRPatRPPatRPParenRPAsRPCAsRPGuardRPSeqRPEitherRPOpRPatOpRPOptGRPOptRPPlusGRPPlusRPStarGRPStarPXAttrPatPBangPat PQuasiQuote PExplTypeArgPXRPatsPXPatTagPXPcdataPXETagPXTagPRPatPViewPat PatTypeSigPIrrPat PWildCardPAsPatPRecPParenPListPTuplePApp PInfixAppPNPlusKPNegPLitPVar WarningTextWarnTextDeprTextRuleVar TypedRuleVarRule Activation ActiveUntil ActiveFromTool UnknownToolHADDOCKYHCNHC98HUGSGHC OptionPragma OptionsPragma CFilesPragma IncludePragmaLanguagePragmaCallConvCCallStdCallSafetyPlaySafe PlayRiskySplice ParenSpliceIdSpliceBracket DeclBracket TypeBracket PatBracket ExpBracketXAttrXNameXDomNameExpRightArrHighAppLeftArrHighApp RightArrApp LeftArrAppProc GenPragma SCCPragma CorePragmaXExpTagXPcdataXETagXTag QuasiQuote SpliceExp BracketExpTypQuoteVarQuote ExpTypeSigParCompListCompEnumFromThenTo EnumFromThen EnumFromToEnumFrom RecUpdate RecConstr RightSection LeftSectionParenList TupleSectionTupleMDoDoCaseIfLetLambdaNegAppAppInfixAppLitConIPVarVarLiteral PrimStringPrimChar PrimDouble PrimFloatPrimWordPrimIntFracIntStringCharAsstEqualPIParamInfixAClassAContextCxEmptyCxParenCxTupleCxSingleFunDepKindKindVar KindParenKindFnKindBangKindStar TyVarBind UnkindedVar KindedVarBoxedUnboxedTypeTyKindTyInfixTyParenTyConTyVarTyAppTyListTyTupleTyFunTyForall GuardedRhsRhs GuardedRhss UnGuardedRhsBangType UnpackedTy UnBangedTyBangedTyInstDecl InsInlineInsGDataInsDataInsTypeInsDecl ClassDeclClsTyDefClsTyFam ClsDataFamClsDeclGadtDecl FieldDeclConDeclRecDecl InfixConDecl QualConDeclMatch InfixMatchIPBindBindsIPBindsBDeclsDerivingInstHeadIHParenIHInfixIHeadDeclHeadDHParenDHInfixDHead DataOrNewNewTypeDataTypeDeclInstSig SpecInlineSigSpecSig InlineSigWarnPragmaDeclDeprPragmaDeclRulePragmaDeclForExpForImpPatBindFunBindTypeSig SpliceDecl DefaultDecl InfixDecl DerivDecl GDataInsDecl DataInsDecl TypeInsDecl DataFamDecl GDataDeclDataDecl TypeFamDeclTypeDeclAssoc AssocRight AssocLeft AssocNone ImportSpec IThingWith IThingAllIAbsIVarImportSpecList ImportDecl importAnn importModuleimportQualified importSrc importPkgimportAs importSpecs ExportSpecEModuleContents EThingWith EThingAllEAbsEVarExportSpecList ModuleHeadModule XmlHybridXmlPageCNameConNameVarNameOpConOpVarOpQOpQConOpQVarOpIPNameIPLinIPDupNameSymbolIdentQNameSpecialUnQualQual SpecialConUnboxedSingleConConsTupleConFunConListConUnitCon ModuleName prelude_modmain_mod main_name unit_con_nametuple_con_namelist_cons_nameunboxed_singleton_con_nameunit_con tuple_conunboxed_singleton_conas_namequalified_name hiding_name minus_name bang_namedot_name star_name export_name safe_name unsafe_namethreadsafe_name stdcall_name ccall_nameunit_tycon_namefun_tycon_namelist_tycon_nameunboxed_singleton_tycon_nametuple_tycon_name unit_tycon fun_tycon list_tyconunboxed_singleton_tycon tuple_tycon=~=namesymvaropqvarpvarappinfixAppappFunpApptuplepTuplevarTuple pvarTuplefunctionstrEcharEintEstrPcharPintPdoElamEletEcaseEaltaltGWlistEeListpeListparenpParenqualStmtgenStmtletStmtbindsnoBindswildcardgenNamessfun simpleFunpatBind patBindWherenameBind metaFunction metaConPat AppFixity applyFixitiesFixitypreludeFixities baseFixitiesinfixr_infixl_infix_CommentExactP exactPrint ExtensionUnknownExtension TupleSectionsRegularPatterns XmlSyntax ViewPatternsTransformListComp QuasiQuotesPostfixOperatorsNewQualifiedOperatorsImpredicativeTypesPackageImportsConstrainedClassMethodsDeriveDataTypeable UnboxedTuplesExtendedDefaultRulesRelaxedPolyRecNoMonoPatBinds MonoPatBindsGADTsOverloadedStringsDisambiguateRecordFields RecordPunsRecordWildCards TypeOperatorsLiberalTypeSynonymsUnliftedFFITypesPatternSignatures UnicodeSyntaxStandaloneDeriving TypeFamilies MagicHash HereDocumentsRestrictedTypeSynonymsExtensibleRecordsGeneralizedNewtypeDeriving PatternGuardsNamedFieldPunsNoImplicitPreludeGenericsArrowsForeignFunctionInterfaceTemplateHaskellTypeSynonymInstances BangPatternsKindSignaturesCPPEmptyDataDeclsFlexibleInstancesFlexibleContextsImplicitParamsScopedTypeVariablesExistentialQuantificationPolymorphicComponents RankNTypes Rank2TypesExplicitForallFunctionalDependenciesNoMonomorphismRestrictionMultiParamTypeClassesParallelListComp RecursiveDoIncoherentInstancesUndecidableInstancesOverlappingInstances impliesExts glasgowExtsclassifyExtension ParseMode parseFilename extensionsignoreLanguagePragmasfixities ParseResult ParseFailedParseOkfromParseResultdefaultParseMode AlwaysActive importLoc sModuleName sSpecialConsQNamesNamesIPNamesQOpsOpsCName sModuleHeadsModulepageFunsExportSpecList sExportSpec sImportDeclsImportSpecList sImportSpecsAssoc sDeclHead sInstHeadsDecl sDataOrNew sDerivingsBindssIPBindsMatch sQualConDeclsConDecl sFieldDecl sGadtDecl sClassDecl sInstDecl sBangTypesRhs sGuardedRhssType sTyVarBindsKindsFunDepsContextsAsstsLiteralsExpsXNamesXAttrsBracketsSplicesSafety sCallConv sOptionPragma sActivationsRulesRuleVar sWarningTextsPatsPXAttrsRPatOpsRPat sPatFieldsStmt sQualStmt sFieldUpdatesAlt sGuardedAlts sGuardedAltPrettyPPHsMode classIndentdoIndent caseIndent letIndent whereIndent onsideIndentspacinglayout linePragmasIndentPPLayout PPNoLayoutPPInLine PPSemiColon PPOffsideRule defaultModeprettyPrintStyleModeprettyPrintWithMode prettyPrint Parseableparse parseWithModeparseWithComments getTopPragmas parseModuleparseModuleWithModeparseModuleWithCommentsparseExpparseExpWithModeparseExpWithCommentsparsePatparsePatWithModeparsePatWithComments parseDeclparseDeclWithModeparseDeclWithComments parseTypeparseTypeWithModeparseTypeWithComments parseFileparseFileWithExtsparseFileWithModeparseFileWithCommentsparseFileContentsparseFileContentsWithExtsparseFileContentsWithModeparseFileContentsWithCommentsreadExtensions isNullSpanghc-primGHC.BoolFalseTruePAsstPTypeTyPredPContext ParseXAttr PFieldUpdatePExpBangPat ExplTypeArgXRPatsCAsRPEitherRPGuardRPSeqRPViewPatPreOpPostOpIrrPatWildCardAsPat p_unit_con p_tuple_conp_unboxed_singleton_conunGAltgAltsgAlt askFixitynullAnnfixity appFixDeclsexactPEPPosposrunEPgetPossetPos printString getComment dropCommentnewLinepadUntilmPrintComments printCommentprintWhitespace printStringAtexactPCprintSeq printStrs printPointsprintInterleavedprintInterleaved' printStreams interleavemaybeEP bracketList parenList squareList curlyList layoutListisSymbolgetName specialNameepQName epInfixQNameepName epInfixNameprintWarndeprs sepFunBindssepClassFunBindssepInstFunBindsknownExtensionsbaseGHC.EnumEnumEnabled isEnabled MExtScheme ExtSchemeAllAnyLexrunLPrunP ParseStateCtxtFlag ExtContext CodeTagCtxt CloseTagCtxt ChildCtxtTagCtxtHarpCtxtCodeCtxt LexContextLayoutNoLayout ParseStatusFailedOkindentOfParseStaterunParserWithMode runParserrunParserWithModeCommentsatSrcLoc getSrcLoc getModuleNamepushCurrentContext currentIndent pushContext popContextpushExtContext popExtContext getExtensions pushCtxtFlag pullDoStatusgetInputdiscard lexNewlinelexTabnextTab tAB_LENGTHlexWhile alternativecheckBOLsetBOL startToken getOffside getSrcLocL pushContextL popContextL pullCtxtFlagflagDo getExtContextpushExtContextLpopExtContextLgetExtensionsL pushCommentTokenEOFKW_CCall KW_StdCall KW_Threadsafe KW_UnsafeKW_Safe KW_Export KW_Foreign KW_QualifiedKW_WhereKW_UsingKW_TypeKW_ThenKW_RecKW_ProcKW_Of KW_NewType KW_ModuleKW_Let KW_Instance KW_InfixR KW_InfixLKW_InfixKW_In KW_ImportKW_If KW_HidingKW_Group KW_Forall KW_FamilyKW_ElseKW_MDoKW_Do KW_Deriving KW_DefaultKW_DataKW_ClassKW_CaseKW_ByKW_AsINCLUDELANGUAGECFILESOPTIONSUNPACKCORE GENERATEDSCCWARNING DEPRECATEDSOURCESPECIALISE_INLINE SPECIALISEINLINERULES PragmaEnd XRPatClose XRPatOpenXPCDATAXEmptyTagClose XCloseTagOpen XStdTagClose XStdTagOpen XCodeTagClose XCodeTagOpenRPCAt RPGuardClose RPGuardOpen THQuasiQuote THTyQuote THVarQuote THParenEscape THIdEscape THCloseQuote THTypQuote THDecQuote THPatQuote THExpQuoteRightDblArrowTailLeftDblArrowTailRightArrowTail LeftArrowTailStar ExclamationMinus DoubleArrowTildeAt RightArrow LeftArrowBar BackslashEquals DoubleColonColonDotDotDot BackQuote UnderscoreComma RightSquare LeftSquare VRightCurly RightCurly LeftCurly SemiColon RightCurlyBar LeftCurlyBarRightHashParen LeftHashParen RightParen LeftParen StringHash CharacterHash DoubleTokHash FloatTokHash WordTokHash IntTokHash StringTok CharacterFloatTokIntTokQConSymQVarSymConSymVarSymDVarIdQConIdConId ILinVarId IDupVarIdQVarIdVarId reserved_opsspecial_varops reserved_idsspecial_varidspragmasisIdent isHSymbol matchCharlexertopLexer lexWhiteSpaceisRecognisedPragmalexNestedCommentlexBOLlexToken lexChildCtxt lexPCDATAlexCodeTagCtxtlexCloseTagCtxt lexTagCtxt lexHarpToken lexStdTokenlexPragmaStart lexRawPragmalexDecimalOrFloatlexHashlexConIdOrQual lexCharacter lexString lexEscapelexOctallexHexadecimal lexDecimal parseIntegerflagKWBoolpretty prettyPrecDocDocMthenDocM then_DocMretDocMunDocMgetPPEnvemptynesttextptextcharintintegerfloatdoublerationalparensbracketsbracesquotes doubleQuotesparensIfsemicommacolonspaceequalslparenrparenlbrackrbracklbracerbrace<><+>$$$+$hcathsepvcatsepcatfsepfcathang punctuaterenderStyleModerenderWithModerenderfullRenderWithMode fullRenderppModuleHeader ppWarnTxtppWhereppSig ppWarnDepr ppRuleVarsppField ppDerivingppBTypeppAType prec_btype prec_atypeppForall ppOptKind ppFunDeps ppQNameInfixppQName ppNameInfixppName isSymbolName ppContextmaybePP hashParenList braceList flatBlock prettyBlock blanklinetopLevelppBody$$$mySepmyVcat myFsepSimplemyFsep layoutChoicemarkLineSL splitTyConApp checkEnabledcheckPatternGuards checkPContextcheckAssertion checkSContext checkContext checkAsstcheckAsstParamcheckDataHeadercheckClassHeader checkSimple isTyVarBind toTyVarBindcheckInstHeader checkInsts checkDeriving checkPatterncheckPat splitBang checkPatField checkPAttrpatFail checkRPattern checkRPatOp fixRPOpPrec mkChildrenPat checkExpr checkAttr check1Expr check2Exprs check3ExprscheckManyExprs mCheckExpr checkRuleExprreadTool checkField getGConName checkValDefisFunLhs checkSigVarcheckClassBody checkInstBodycheckMethodDef checkUnQual checkEqNames checkPrecmkRecConstrOrUpdate checkRevDeclscheckRevClsDeclscheckRevInstDeclscheckDataOrNewcheckSimpleType checkTypecheckT check1Type check2Types checkTypescheckPageModulecheckHybridModulemkDVar mkTyForall HappyAddrHappyA#HappyStk Happy_IntList HappyConsHappyAny HappyAbsSynhappyIn9 happyOut9 happyIn10 happyOut10 happyIn11 happyOut11 happyIn12 happyOut12 happyIn13 happyOut13 happyIn14 happyOut14 happyIn15 happyOut15 happyIn16 happyOut16 happyIn17 happyOut17 happyIn18 happyOut18 happyIn19 happyOut19 happyIn20 happyOut20 happyIn21 happyOut21 happyIn22 happyOut22 happyIn23 happyOut23 happyIn24 happyOut24 happyIn25 happyOut25 happyIn26 happyOut26 happyIn27 happyOut27 happyIn28 happyOut28 happyIn29 happyOut29 happyIn30 happyOut30 happyIn31 happyOut31 happyIn32 happyOut32 happyIn33 happyOut33 happyIn34 happyOut34 happyIn35 happyOut35 happyIn36 happyOut36 happyIn37 happyOut37 happyIn38 happyOut38 happyIn39 happyOut39 happyIn40 happyOut40 happyIn41 happyOut41 happyIn42 happyOut42 happyIn43 happyOut43 happyIn44 happyOut44 happyIn45 happyOut45 happyIn46 happyOut46 happyIn47 happyOut47 happyIn48 happyOut48 happyIn49 happyOut49 happyIn50 happyOut50 happyIn51 happyOut51 happyIn52 happyOut52 happyIn53 happyOut53 happyIn54 happyOut54 happyIn55 happyOut55 happyIn56 happyOut56 happyIn57 happyOut57 happyIn58 happyOut58 happyIn59 happyOut59 happyIn60 happyOut60 happyIn61 happyOut61 happyIn62 happyOut62 happyIn63 happyOut63 happyIn64 happyOut64 happyIn65 happyOut65 happyIn66 happyOut66 happyIn67 happyOut67 happyIn68 happyOut68 happyIn69 happyOut69 happyIn70 happyOut70 happyIn71 happyOut71 happyIn72 happyOut72 happyIn73 happyOut73 happyIn74 happyOut74 happyIn75 happyOut75 happyIn76 happyOut76 happyIn77 happyOut77 happyIn78 happyOut78 happyIn79 happyOut79 happyIn80 happyOut80 happyIn81 happyOut81 happyIn82 happyOut82 happyIn83 happyOut83 happyIn84 happyOut84 happyIn85 happyOut85 happyIn86 happyOut86 happyIn87 happyOut87 happyIn88 happyOut88 happyIn89 happyOut89 happyIn90 happyOut90 happyIn91 happyOut91 happyIn92 happyOut92 happyIn93 happyOut93 happyIn94 happyOut94 happyIn95 happyOut95 happyIn96 happyOut96 happyIn97 happyOut97 happyIn98 happyOut98 happyIn99 happyOut99 happyIn100 happyOut100 happyIn101 happyOut101 happyIn102 happyOut102 happyIn103 happyOut103 happyIn104 happyOut104 happyIn105 happyOut105 happyIn106 happyOut106 happyIn107 happyOut107 happyIn108 happyOut108 happyIn109 happyOut109 happyIn110 happyOut110 happyIn111 happyOut111 happyIn112 happyOut112 happyIn113 happyOut113 happyIn114 happyOut114 happyIn115 happyOut115 happyIn116 happyOut116 happyIn117 happyOut117 happyIn118 happyOut118 happyIn119 happyOut119 happyIn120 happyOut120 happyIn121 happyOut121 happyIn122 happyOut122 happyIn123 happyOut123 happyIn124 happyOut124 happyIn125 happyOut125 happyIn126 happyOut126 happyIn127 happyOut127 happyIn128 happyOut128 happyIn129 happyOut129 happyIn130 happyOut130 happyIn131 happyOut131 happyIn132 happyOut132 happyIn133 happyOut133 happyIn134 happyOut134 happyIn135 happyOut135 happyIn136 happyOut136 happyIn137 happyOut137 happyIn138 happyOut138 happyIn139 happyOut139 happyIn140 happyOut140 happyIn141 happyOut141 happyIn142 happyOut142 happyIn143 happyOut143 happyIn144 happyOut144 happyIn145 happyOut145 happyIn146 happyOut146 happyIn147 happyOut147 happyIn148 happyOut148 happyIn149 happyOut149 happyIn150 happyOut150 happyIn151 happyOut151 happyIn152 happyOut152 happyIn153 happyOut153 happyIn154 happyOut154 happyIn155 happyOut155 happyIn156 happyOut156 happyIn157 happyOut157 happyIn158 happyOut158 happyIn159 happyOut159 happyIn160 happyOut160 happyIn161 happyOut161 happyIn162 happyOut162 happyIn163 happyOut163 happyIn164 happyOut164 happyIn165 happyOut165 happyIn166 happyOut166 happyIn167 happyOut167 happyIn168 happyOut168 happyIn169 happyOut169 happyIn170 happyOut170 happyIn171 happyOut171 happyIn172 happyOut172 happyIn173 happyOut173 happyIn174 happyOut174 happyIn175 happyOut175 happyIn176 happyOut176 happyIn177 happyOut177 happyIn178 happyOut178 happyIn179 happyOut179 happyIn180 happyOut180 happyIn181 happyOut181 happyIn182 happyOut182 happyIn183 happyOut183 happyIn184 happyOut184 happyIn185 happyOut185 happyIn186 happyOut186 happyIn187 happyOut187 happyIn188 happyOut188 happyIn189 happyOut189 happyIn190 happyOut190 happyIn191 happyOut191 happyIn192 happyOut192 happyIn193 happyOut193 happyIn194 happyOut194 happyIn195 happyOut195 happyIn196 happyOut196 happyIn197 happyOut197 happyIn198 happyOut198 happyIn199 happyOut199 happyIn200 happyOut200 happyIn201 happyOut201 happyIn202 happyOut202 happyIn203 happyOut203 happyIn204 happyOut204 happyIn205 happyOut205 happyIn206 happyOut206 happyIn207 happyOut207 happyIn208 happyOut208 happyIn209 happyOut209 happyIn210 happyOut210 happyIn211 happyOut211 happyIn212 happyOut212 happyIn213 happyOut213 happyIn214 happyOut214 happyIn215 happyOut215 happyIn216 happyOut216 happyIn217 happyOut217 happyIn218 happyOut218 happyIn219 happyOut219 happyIn220 happyOut220 happyIn221 happyOut221 happyIn222 happyOut222 happyIn223 happyOut223 happyIn224 happyOut224 happyInTok happyOutTokhappyActOffsetshappyGotoOffsetshappyDefActions happyCheck happyTable happyThen happyReturn happyReturn1 happyError' parseError simpleParse modeParse commentParse notHappyAtAll happyTcHack happyDoSeq happyDontSeq Data.MaybeNothing ppContentsdelit