2 -----------------------------------------------------------------------------
3 $Id: Parser.y,v 1.128 2003/11/04 13:14:06 simonpj Exp $
7 Author(s): Simon Marlow, Sven Panne 1997, 1998, 1999
8 -----------------------------------------------------------------------------
12 module Parser ( parseModule, parseStmt, parseIdentifier, parseIface ) where
14 #include "HsVersions.h"
18 import HscTypes ( ModIface, IsBootInterface, DeprecTxt )
21 import TysWiredIn ( unitTyCon, unitDataCon, tupleTyCon, tupleCon, nilDataCon,
22 listTyCon_RDR, parrTyCon_RDR, consDataCon_RDR )
23 import Type ( funTyCon )
24 import ForeignCall ( Safety(..), CExportSpec(..),
25 CCallConv(..), CCallTarget(..), defaultCCallConv
27 import OccName ( UserFS, varName, dataName, tcClsName, tvName )
28 import DataCon ( DataCon, dataConName )
29 import SrcLoc ( SrcLoc, noSrcLoc )
31 import CmdLineOpts ( opt_SccProfilingOn )
32 import Type ( Kind, mkArrowKind, liftedTypeKind )
33 import BasicTypes ( Boxity(..), Fixity(..), FixityDirection(..), IPName(..),
34 NewOrData(..), Activation(..) )
38 import CStrings ( CLabelString )
40 import Maybes ( orElse )
47 -----------------------------------------------------------------------------
48 Conflicts: 29 shift/reduce, [SDM 19/9/2002]
50 10 for abiguity in 'if x then y else z + 1' [State 136]
51 (shift parses as 'if x then y else (z + 1)', as per longest-parse rule)
52 10 because op might be: : - ! * . `x` VARSYM CONSYM QVARSYM QCONSYM
54 1 for ambiguity in 'if x then y else z with ?x=3' [State 136]
55 (shift parses as 'if x then y else (z with ?x=3)'
57 1 for ambiguity in 'if x then y else z :: T' [State 136]
58 (shift parses as 'if x then y else (z :: T)', as per longest-parse rule)
60 8 for ambiguity in 'e :: a `b` c'. Does this mean [States 160,246]
64 1 for ambiguity in 'let ?x ...' [State 268]
65 the parser can't tell whether the ?x is the lhs of a normal binding or
66 an implicit binding. Fortunately resolving as shift gives it the only
67 sensible meaning, namely the lhs of an implicit binding.
69 1 for ambiguity in '{-# RULES "name" [ ... #-} [State 332]
70 we don't know whether the '[' starts the activation or not: it
71 might be the start of the declaration with the activation being
74 1 for ambiguity in '{-# RULES "name" forall = ... #-}' [State 394]
75 since 'forall' is a valid variable name, we don't know whether
76 to treat a forall on the input as the beginning of a quantifier
77 or the beginning of the rule itself. Resolving to shift means
78 it's always treated as a quantifier, hence the above is disallowed.
79 This saves explicitly defining a grammar for the rule lhs that
80 doesn't include 'forall'.
82 6 for conflicts between `fdecl' and `fdeclDEPRECATED', [States 384,385]
83 which are resolved correctly, and moreover,
84 should go away when `fdeclDEPRECATED' is removed.
86 -----------------------------------------------------------------------------
90 '_' { T _ _ ITunderscore } -- Haskell keywords
92 'case' { T _ _ ITcase }
93 'class' { T _ _ ITclass }
94 'data' { T _ _ ITdata }
95 'default' { T _ _ ITdefault }
96 'deriving' { T _ _ ITderiving }
98 'else' { T _ _ ITelse }
99 'hiding' { T _ _ IThiding }
101 'import' { T _ _ ITimport }
103 'infix' { T _ _ ITinfix }
104 'infixl' { T _ _ ITinfixl }
105 'infixr' { T _ _ ITinfixr }
106 'instance' { T _ _ ITinstance }
107 'let' { T _ _ ITlet }
108 'module' { T _ _ ITmodule }
109 'newtype' { T _ _ ITnewtype }
111 'qualified' { T _ _ ITqualified }
112 'then' { T _ _ ITthen }
113 'type' { T _ _ ITtype }
114 'where' { T _ _ ITwhere }
115 '_scc_' { T _ _ ITscc } -- ToDo: remove
117 'forall' { T _ _ ITforall } -- GHC extension keywords
118 'foreign' { T _ _ ITforeign }
119 'export' { T _ _ ITexport }
120 'label' { T _ _ ITlabel }
121 'dynamic' { T _ _ ITdynamic }
122 'safe' { T _ _ ITsafe }
123 'threadsafe' { T _ _ ITthreadsafe }
124 'unsafe' { T _ _ ITunsafe }
125 'mdo' { T _ _ ITmdo }
126 'stdcall' { T _ _ ITstdcallconv }
127 'ccall' { T _ _ ITccallconv }
128 'dotnet' { T _ _ ITdotnet }
129 'proc' { T _ _ ITproc } -- for arrow notation extension
130 'rec' { T _ _ ITrec } -- for arrow notation extension
132 '{-# SPECIALISE' { T _ _ ITspecialise_prag }
133 '{-# SOURCE' { T _ _ ITsource_prag }
134 '{-# INLINE' { T _ _ ITinline_prag }
135 '{-# NOINLINE' { T _ _ ITnoinline_prag }
136 '{-# RULES' { T _ _ ITrules_prag }
137 '{-# CORE' { T _ _ ITcore_prag } -- hdaume: annotated core
138 '{-# SCC' { T _ _ ITscc_prag }
139 '{-# DEPRECATED' { T _ _ ITdeprecated_prag }
140 '#-}' { T _ _ ITclose_prag }
142 '..' { T _ _ ITdotdot } -- reserved symbols
143 ':' { T _ _ ITcolon }
144 '::' { T _ _ ITdcolon }
145 '=' { T _ _ ITequal }
148 '<-' { T _ _ ITlarrow }
149 '->' { T _ _ ITrarrow }
151 '~' { T _ _ ITtilde }
152 '=>' { T _ _ ITdarrow }
153 '-' { T _ _ ITminus }
156 '-<' { T _ _ ITlarrowtail } -- for arrow notation
157 '>-' { T _ _ ITrarrowtail } -- for arrow notation
158 '-<<' { T _ _ ITLarrowtail } -- for arrow notation
159 '>>-' { T _ _ ITRarrowtail } -- for arrow notation
162 '{' { T _ _ ITocurly } -- special symbols
163 '}' { T _ _ ITccurly }
164 '{|' { T _ _ ITocurlybar }
165 '|}' { T _ _ ITccurlybar }
166 vocurly { T _ _ ITvocurly } -- virtual open curly (from layout)
167 vccurly { T _ _ ITvccurly } -- virtual close curly (from layout)
168 '[' { T _ _ ITobrack }
169 ']' { T _ _ ITcbrack }
170 '[:' { T _ _ ITopabrack }
171 ':]' { T _ _ ITcpabrack }
172 '(' { T _ _ IToparen }
173 ')' { T _ _ ITcparen }
174 '(#' { T _ _ IToubxparen }
175 '#)' { T _ _ ITcubxparen }
176 '(|' { T _ _ IToparenbar }
177 '|)' { T _ _ ITcparenbar }
179 ',' { T _ _ ITcomma }
180 '`' { T _ _ ITbackquote }
182 VARID { T _ _ (ITvarid $$) } -- identifiers
183 CONID { T _ _ (ITconid $$) }
184 VARSYM { T _ _ (ITvarsym $$) }
185 CONSYM { T _ _ (ITconsym $$) }
186 QVARID { T _ _ (ITqvarid $$) }
187 QCONID { T _ _ (ITqconid $$) }
188 QVARSYM { T _ _ (ITqvarsym $$) }
189 QCONSYM { T _ _ (ITqconsym $$) }
191 IPDUPVARID { T _ _ (ITdupipvarid $$) } -- GHC extension
192 IPSPLITVARID { T _ _ (ITsplitipvarid $$) } -- GHC extension
194 CHAR { T _ _ (ITchar $$) }
195 STRING { T _ _ (ITstring $$) }
196 INTEGER { T _ _ (ITinteger $$) }
197 RATIONAL { T _ _ (ITrational $$) }
199 PRIMCHAR { T _ _ (ITprimchar $$) }
200 PRIMSTRING { T _ _ (ITprimstring $$) }
201 PRIMINTEGER { T _ _ (ITprimint $$) }
202 PRIMFLOAT { T _ _ (ITprimfloat $$) }
203 PRIMDOUBLE { T _ _ (ITprimdouble $$) }
206 '[|' { T _ _ ITopenExpQuote }
207 '[p|' { T _ _ ITopenPatQuote }
208 '[t|' { T _ _ ITopenTypQuote }
209 '[d|' { T _ _ ITopenDecQuote }
210 '|]' { T _ _ ITcloseQuote }
211 ID_SPLICE { T _ _ (ITidEscape $$) } -- $x
212 '$(' { T _ _ ITparenEscape } -- $( exp )
213 REIFY_TYPE { T _ _ ITreifyType }
214 REIFY_DECL { T _ _ ITreifyDecl }
215 REIFY_FIXITY { T _ _ ITreifyFixity }
217 %monad { P } { >>= } { return }
218 %lexer { lexer } { T _ _ ITeof }
219 %name parseModule module
220 %name parseStmt maybe_stmt
221 %name parseIdentifier identifier
222 %name parseIface iface
226 -----------------------------------------------------------------------------
229 -- The place for module deprecation is really too restrictive, but if it
230 -- was allowed at its natural place just before 'module', we get an ugly
231 -- s/r conflict with the second alternative. Another solution would be the
232 -- introduction of a new pragma DEPRECATED_MODULE, but this is not very nice,
233 -- either, and DEPRECATED is only expected to be used by people who really
234 -- know what they are doing. :-)
236 module :: { RdrNameHsModule }
237 : srcloc 'module' modid maybemoddeprec maybeexports 'where' body
238 { HsModule (Just (mkHomeModule $3)) $5 (fst $7) (snd $7) $4 $1 }
239 | srcloc missing_module_keyword top close
240 { HsModule Nothing Nothing (fst $3) (snd $3) Nothing $1 }
242 missing_module_keyword :: { () }
243 : {- empty -} {% pushCurrentContext }
245 maybemoddeprec :: { Maybe DeprecTxt }
246 : '{-# DEPRECATED' STRING '#-}' { Just $2 }
247 | {- empty -} { Nothing }
249 body :: { ([RdrNameImportDecl], [RdrNameHsDecl]) }
251 | vocurly top close { $2 }
253 top :: { ([RdrNameImportDecl], [RdrNameHsDecl]) }
254 : importdecls { (reverse $1,[]) }
255 | importdecls ';' cvtopdecls { (reverse $1,$3) }
256 | cvtopdecls { ([],$1) }
258 cvtopdecls :: { [RdrNameHsDecl] }
259 : topdecls { cvTopDecls $1 }
261 -----------------------------------------------------------------------------
262 -- Interfaces (.hi-boot files)
264 iface :: { ModIface }
265 : 'module' modid 'where' ifacebody { mkBootIface $2 $4 }
267 ifacebody :: { [HsDecl RdrName] }
268 : '{' ifacedecls '}' { $2 }
269 | vocurly ifacedecls close { $2 }
271 ifacedecls :: { [HsDecl RdrName] }
272 : ifacedecl ';' ifacedecls { $1 : $3 }
273 | ';' ifacedecls { $2 }
277 ifacedecl :: { HsDecl RdrName }
279 { SigD (Sig $1 $3 noSrcLoc) }
280 | 'type' syn_hdr '=' ctype
281 { let (tc,tvs) = $2 in TyClD (TySynonym tc tvs $4 noSrcLoc) }
282 | new_or_data tycl_hdr
283 { TyClD (mkTyData $1 $2 [] Nothing noSrcLoc) }
284 | 'class' tycl_hdr fds
285 { TyClD (mkClassDecl $2 $3 [] EmptyMonoBinds noSrcLoc) }
287 new_or_data :: { NewOrData }
288 : 'data' { DataType }
289 | 'newtype' { NewType }
291 -----------------------------------------------------------------------------
294 maybeexports :: { Maybe [RdrNameIE] }
295 : '(' exportlist ')' { Just $2 }
296 | {- empty -} { Nothing }
298 exportlist :: { [RdrNameIE] }
299 : exportlist ',' export { $3 : $1 }
300 | exportlist ',' { $1 }
304 -- No longer allow things like [] and (,,,) to be exported
305 -- They are built in syntax, always available
306 export :: { RdrNameIE }
308 | oqtycon { IEThingAbs $1 }
309 | oqtycon '(' '..' ')' { IEThingAll $1 }
310 | oqtycon '(' ')' { IEThingWith $1 [] }
311 | oqtycon '(' qcnames ')' { IEThingWith $1 (reverse $3) }
312 | 'module' modid { IEModuleContents $2 }
314 qcnames :: { [RdrName] }
315 : qcnames ',' qcname { $3 : $1 }
318 qcname :: { RdrName } -- Variable or data constructor
322 -----------------------------------------------------------------------------
323 -- Import Declarations
325 -- import decls can be *empty*, or even just a string of semicolons
326 -- whereas topdecls must contain at least one topdecl.
328 importdecls :: { [RdrNameImportDecl] }
329 : importdecls ';' importdecl { $3 : $1 }
330 | importdecls ';' { $1 }
331 | importdecl { [ $1 ] }
334 importdecl :: { RdrNameImportDecl }
335 : 'import' srcloc maybe_src optqualified modid maybeas maybeimpspec
336 { ImportDecl $5 $3 $4 $6 $7 $2 }
338 maybe_src :: { IsBootInterface }
339 : '{-# SOURCE' '#-}' { True }
340 | {- empty -} { False }
342 optqualified :: { Bool }
343 : 'qualified' { True }
344 | {- empty -} { False }
346 maybeas :: { Maybe ModuleName }
347 : 'as' modid { Just $2 }
348 | {- empty -} { Nothing }
350 maybeimpspec :: { Maybe (Bool, [RdrNameIE]) }
351 : impspec { Just $1 }
352 | {- empty -} { Nothing }
354 impspec :: { (Bool, [RdrNameIE]) }
355 : '(' exportlist ')' { (False, reverse $2) }
356 | 'hiding' '(' exportlist ')' { (True, reverse $3) }
358 -----------------------------------------------------------------------------
359 -- Fixity Declarations
363 | INTEGER {% checkPrecP (fromInteger $1) }
365 infix :: { FixityDirection }
367 | 'infixl' { InfixL }
368 | 'infixr' { InfixR }
371 : ops ',' op { $3 : $1 }
374 -----------------------------------------------------------------------------
375 -- Top-Level Declarations
377 topdecls :: { [RdrBinding] } -- Reversed
378 : topdecls ';' topdecl { $3 : $1 }
379 | topdecls ';' { $1 }
382 topdecl :: { RdrBinding }
383 : tycl_decl { RdrHsDecl (TyClD $1) }
384 | srcloc 'instance' inst_type where
385 { let (binds,sigs) = cvMonoBindsAndSigs $4
386 in RdrHsDecl (InstD (InstDecl $3 binds sigs $1)) }
387 | srcloc 'default' '(' comma_types0 ')' { RdrHsDecl (DefD (DefaultDecl $4 $1)) }
388 | 'foreign' fdecl { RdrHsDecl $2 }
389 | '{-# DEPRECATED' deprecations '#-}' { RdrBindings (reverse $2) }
390 | '{-# RULES' rules '#-}' { RdrBindings (reverse $2) }
391 | srcloc '$(' exp ')' { RdrHsDecl (SpliceD (SpliceDecl $3 $1)) }
394 tycl_decl :: { RdrNameTyClDecl }
395 : srcloc 'type' syn_hdr '=' ctype
396 -- Note ctype, not sigtype.
397 -- We allow an explicit for-all but we don't insert one
398 -- in type Foo a = (b,b)
399 -- Instead we just say b is out of scope
400 { let (tc,tvs) = $3 in TySynonym tc tvs $5 $1 }
402 | srcloc 'data' tycl_hdr constrs deriving
403 { mkTyData DataType $3 (reverse $4) $5 $1 }
405 | srcloc 'newtype' tycl_hdr '=' newconstr deriving
406 { mkTyData NewType $3 [$5] $6 $1 }
408 | srcloc 'class' tycl_hdr fds where
410 (binds,sigs) = cvMonoBindsAndSigs $5
412 mkClassDecl $3 $4 sigs binds $1 }
414 syn_hdr :: { (RdrName, [RdrNameHsTyVar]) } -- We don't retain the syntax of an infix
415 -- type synonym declaration. Oh well.
416 : tycon tv_bndrs { ($1, $2) }
417 | tv_bndr tyconop tv_bndr { ($2, [$1,$3]) }
419 -- tycl_hdr parses the header of a type or class decl,
420 -- which takes the form
423 -- (Eq a, Ord b) => T a b
424 -- Rather a lot of inlining here, else we get reduce/reduce errors
425 tycl_hdr :: { (RdrNameContext, RdrName, [RdrNameHsTyVar]) }
426 : context '=>' type {% checkTyClHdr $1 $3 }
427 | type {% checkTyClHdr [] $1 }
429 -----------------------------------------------------------------------------
430 -- Nested declarations
432 decls :: { [RdrBinding] } -- Reversed
433 : decls ';' decl { $3 : $1 }
439 decllist :: { [RdrBinding] } -- Reversed
440 : '{' decls '}' { $2 }
441 | vocurly decls close { $2 }
443 where :: { [RdrBinding] } -- Reversed
444 -- No implicit parameters
445 : 'where' decllist { $2 }
448 binds :: { RdrNameHsBinds } -- May have implicit parameters
449 : decllist { cvBinds $1 }
450 | '{' dbinds '}' { IPBinds $2 }
451 | vocurly dbinds close { IPBinds $2 }
453 wherebinds :: { RdrNameHsBinds } -- May have implicit parameters
454 : 'where' binds { $2 }
455 | {- empty -} { EmptyBinds }
459 -----------------------------------------------------------------------------
460 -- Transformation Rules
462 rules :: { [RdrBinding] } -- Reversed
463 : rules ';' rule { $3 : $1 }
468 rule :: { RdrBinding }
469 : STRING activation rule_forall infixexp '=' srcloc exp
470 { RdrHsDecl (RuleD (HsRule $1 $2 $3 $4 $7 $6)) }
472 activation :: { Activation } -- Omitted means AlwaysActive
473 : {- empty -} { AlwaysActive }
474 | explicit_activation { $1 }
476 inverse_activation :: { Activation } -- Omitted means NeverActive
477 : {- empty -} { NeverActive }
478 | explicit_activation { $1 }
480 explicit_activation :: { Activation } -- In brackets
481 : '[' INTEGER ']' { ActiveAfter (fromInteger $2) }
482 | '[' '~' INTEGER ']' { ActiveBefore (fromInteger $3) }
484 rule_forall :: { [RdrNameRuleBndr] }
485 : 'forall' rule_var_list '.' { $2 }
488 rule_var_list :: { [RdrNameRuleBndr] }
490 | rule_var rule_var_list { $1 : $2 }
492 rule_var :: { RdrNameRuleBndr }
493 : varid { RuleBndr $1 }
494 | '(' varid '::' ctype ')' { RuleBndrSig $2 $4 }
496 -----------------------------------------------------------------------------
497 -- Deprecations (c.f. rules)
499 deprecations :: { [RdrBinding] } -- Reversed
500 : deprecations ';' deprecation { $3 : $1 }
501 | deprecations ';' { $1 }
502 | deprecation { [$1] }
505 -- SUP: TEMPORARY HACK, not checking for `module Foo'
506 deprecation :: { RdrBinding }
507 : srcloc depreclist STRING
509 [ RdrHsDecl (DeprecD (Deprecation n $3 $1)) | n <- $2 ] }
512 -----------------------------------------------------------------------------
513 -- Foreign import and export declarations
515 -- for the time being, the following accepts foreign declarations conforming
516 -- to the FFI Addendum, Version 1.0 as well as pre-standard declarations
518 -- * a flag indicates whether pre-standard declarations have been used and
519 -- triggers a deprecation warning further down the road
521 -- NB: The first two rules could be combined into one by replacing `safety1'
522 -- with `safety'. However, the combined rule conflicts with the
525 fdecl :: { RdrNameHsDecl }
526 fdecl : srcloc 'import' callconv safety1 fspec {% mkImport $3 $4 $5 $1 }
527 | srcloc 'import' callconv fspec {% mkImport $3 (PlaySafe False) $4 $1 }
528 | srcloc 'export' callconv fspec {% mkExport $3 $4 $1 }
529 -- the following syntax is DEPRECATED
530 | srcloc fdecl1DEPRECATED { ForD ($2 True $1) }
531 | srcloc fdecl2DEPRECATED { $2 $1 }
533 fdecl1DEPRECATED :: { Bool -> SrcLoc -> ForeignDecl RdrName }
535 ----------- DEPRECATED label decls ------------
536 : 'label' ext_name varid '::' sigtype
537 { ForeignImport $3 $5 (CImport defaultCCallConv (PlaySafe False) nilFS nilFS
538 (CLabel ($2 `orElse` mkExtName $3))) }
540 ----------- DEPRECATED ccall/stdcall decls ------------
542 -- NB: This business with the case expression below may seem overly
543 -- complicated, but it is necessary to avoid some conflicts.
545 -- DEPRECATED variant #1: lack of a calling convention specification
547 | 'import' {-no callconv-} ext_name safety varid_no_unsafe '::' sigtype
549 target = StaticTarget ($2 `orElse` mkExtName $4)
551 ForeignImport $4 $6 (CImport defaultCCallConv $3 nilFS nilFS
552 (CFunction target)) }
554 -- DEPRECATED variant #2: external name consists of two separate strings
555 -- (module name and function name) (import)
556 | 'import' callconv STRING STRING safety varid_no_unsafe '::' sigtype
558 DNCall -> parseError "Illegal format of .NET foreign import"
559 CCall cconv -> return $
561 imp = CFunction (StaticTarget $4)
563 ForeignImport $6 $8 (CImport cconv $5 nilFS nilFS imp) }
565 -- DEPRECATED variant #3: `unsafe' after entity
566 | 'import' callconv STRING 'unsafe' varid_no_unsafe '::' sigtype
568 DNCall -> parseError "Illegal format of .NET foreign import"
569 CCall cconv -> return $
571 imp = CFunction (StaticTarget $3)
573 ForeignImport $5 $7 (CImport cconv PlayRisky nilFS nilFS imp) }
575 -- DEPRECATED variant #4: use of the special identifier `dynamic' without
576 -- an explicit calling convention (import)
577 | 'import' {-no callconv-} 'dynamic' safety varid_no_unsafe '::' sigtype
578 { ForeignImport $4 $6 (CImport defaultCCallConv $3 nilFS nilFS
579 (CFunction DynamicTarget)) }
581 -- DEPRECATED variant #5: use of the special identifier `dynamic' (import)
582 | 'import' callconv 'dynamic' safety varid_no_unsafe '::' sigtype
584 DNCall -> parseError "Illegal format of .NET foreign import"
585 CCall cconv -> return $
586 ForeignImport $5 $7 (CImport cconv $4 nilFS nilFS
587 (CFunction DynamicTarget)) }
589 -- DEPRECATED variant #6: lack of a calling convention specification
591 | 'export' {-no callconv-} ext_name varid '::' sigtype
592 { ForeignExport $3 $5 (CExport (CExportStatic ($2 `orElse` mkExtName $3)
595 -- DEPRECATED variant #7: external name consists of two separate strings
596 -- (module name and function name) (export)
597 | 'export' callconv STRING STRING varid '::' sigtype
599 DNCall -> parseError "Illegal format of .NET foreign import"
600 CCall cconv -> return $
602 (CExport (CExportStatic $4 cconv)) }
604 -- DEPRECATED variant #8: use of the special identifier `dynamic' without
605 -- an explicit calling convention (export)
606 | 'export' {-no callconv-} 'dynamic' varid '::' sigtype
607 { ForeignImport $3 $5 (CImport defaultCCallConv (PlaySafe False) nilFS nilFS
610 -- DEPRECATED variant #9: use of the special identifier `dynamic' (export)
611 | 'export' callconv 'dynamic' varid '::' sigtype
613 DNCall -> parseError "Illegal format of .NET foreign import"
614 CCall cconv -> return $
615 ForeignImport $4 $6 (CImport cconv (PlaySafe False) nilFS nilFS CWrapper) }
617 ----------- DEPRECATED .NET decls ------------
618 -- NB: removed the .NET call declaration, as it is entirely subsumed
619 -- by the new standard FFI declarations
621 fdecl2DEPRECATED :: { SrcLoc -> RdrNameHsDecl }
623 : 'import' 'dotnet' 'type' ext_name tycon
624 { \loc -> TyClD (ForeignType $5 $4 DNType loc) }
625 -- left this one unchanged for the moment as type imports are not
626 -- covered currently by the FFI standard -=chak
629 callconv :: { CallConv }
630 : 'stdcall' { CCall StdCallConv }
631 | 'ccall' { CCall CCallConv }
632 | 'dotnet' { DNCall }
635 : 'unsafe' { PlayRisky }
636 | 'safe' { PlaySafe False }
637 | 'threadsafe' { PlaySafe True }
638 | {- empty -} { PlaySafe False }
640 safety1 :: { Safety }
641 : 'unsafe' { PlayRisky }
642 | 'safe' { PlaySafe False }
643 | 'threadsafe' { PlaySafe True }
644 -- only needed to avoid conflicts with the DEPRECATED rules
646 fspec :: { (FastString, RdrName, RdrNameHsType) }
647 : STRING var '::' sigtype { ($1 , $2, $4) }
648 | var '::' sigtype { (nilFS, $1, $3) }
649 -- if the entity string is missing, it defaults to the empty string;
650 -- the meaning of an empty entity string depends on the calling
654 ext_name :: { Maybe CLabelString }
656 | STRING STRING { Just $2 } -- Ignore "module name" for now
657 | {- empty -} { Nothing }
660 -----------------------------------------------------------------------------
663 opt_sig :: { Maybe RdrNameHsType }
664 : {- empty -} { Nothing }
665 | '::' sigtype { Just $2 }
667 opt_asig :: { Maybe RdrNameHsType }
668 : {- empty -} { Nothing }
669 | '::' atype { Just $2 }
671 sigtypes :: { [RdrNameHsType] }
673 | sigtypes ',' sigtype { $3 : $1 }
675 sigtype :: { RdrNameHsType }
676 : ctype { mkImplicitHsForAllTy [] $1 }
677 -- Wrap an Implicit forall if there isn't one there already
679 sig_vars :: { [RdrName] }
680 : sig_vars ',' var { $3 : $1 }
683 -----------------------------------------------------------------------------
686 -- A ctype is a for-all type
687 ctype :: { RdrNameHsType }
688 : 'forall' tv_bndrs '.' ctype { mkExplicitHsForAllTy $2 [] $4 }
689 | context '=>' type { mkImplicitHsForAllTy $1 $3 }
690 -- A type of form (context => type) is an *implicit* HsForAllTy
693 -- We parse a context as a btype so that we don't get reduce/reduce
694 -- errors in ctype. The basic problem is that
696 -- looks so much like a tuple type. We can't tell until we find the =>
697 context :: { RdrNameContext }
698 : btype {% checkContext $1 }
700 type :: { RdrNameHsType }
701 : ipvar '::' gentype { mkHsIParamTy $1 $3 }
704 gentype :: { RdrNameHsType }
706 | btype qtyconop gentype { HsOpTy $1 $2 $3 }
707 | btype '`' tyvar '`' gentype { HsOpTy $1 $3 $5 }
708 | btype '->' gentype { HsFunTy $1 $3 }
710 btype :: { RdrNameHsType }
711 : btype atype { HsAppTy $1 $2 }
714 atype :: { RdrNameHsType }
715 : gtycon { HsTyVar $1 }
716 | tyvar { HsTyVar $1 }
717 | '(' type ',' comma_types1 ')' { HsTupleTy Boxed ($2:$4) }
718 | '(#' comma_types1 '#)' { HsTupleTy Unboxed $2 }
719 | '[' type ']' { HsListTy $2 }
720 | '[:' type ':]' { HsPArrTy $2 }
721 | '(' ctype ')' { HsParTy $2 }
722 | '(' ctype '::' kind ')' { HsKindSig $2 $4 }
724 | INTEGER { HsNumTy $1 }
726 -- An inst_type is what occurs in the head of an instance decl
727 -- e.g. (Foo a, Gaz b) => Wibble a b
728 -- It's kept as a single type, with a MonoDictTy at the right
729 -- hand corner, for convenience.
730 inst_type :: { RdrNameHsType }
731 : ctype {% checkInstType $1 }
733 comma_types0 :: { [RdrNameHsType] }
734 : comma_types1 { $1 }
737 comma_types1 :: { [RdrNameHsType] }
739 | type ',' comma_types1 { $1 : $3 }
741 tv_bndrs :: { [RdrNameHsTyVar] }
742 : tv_bndr tv_bndrs { $1 : $2 }
745 tv_bndr :: { RdrNameHsTyVar }
746 : tyvar { UserTyVar $1 }
747 | '(' tyvar '::' kind ')' { KindedTyVar $2 $4 }
749 fds :: { [([RdrName], [RdrName])] }
751 | '|' fds1 { reverse $2 }
753 fds1 :: { [([RdrName], [RdrName])] }
754 : fds1 ',' fd { $3 : $1 }
757 fd :: { ([RdrName], [RdrName]) }
758 : varids0 '->' varids0 { (reverse $1, reverse $3) }
760 varids0 :: { [RdrName] }
762 | varids0 tyvar { $2 : $1 }
764 -----------------------------------------------------------------------------
769 | akind '->' kind { mkArrowKind $1 $3 }
772 : '*' { liftedTypeKind }
773 | '(' kind ')' { $2 }
776 -----------------------------------------------------------------------------
777 -- Datatype declarations
779 newconstr :: { RdrNameConDecl }
780 : srcloc conid atype { ConDecl $2 [] [] (PrefixCon [unbangedType $3]) $1 }
781 | srcloc conid '{' var '::' ctype '}'
782 { ConDecl $2 [] [] (RecCon [($4, unbangedType $6)]) $1 }
784 constrs :: { [RdrNameConDecl] }
785 : {- empty; a GHC extension -} { [] }
786 | '=' constrs1 { $2 }
788 constrs1 :: { [RdrNameConDecl] }
789 : constrs1 '|' constr { $3 : $1 }
792 constr :: { RdrNameConDecl }
793 : srcloc forall context '=>' constr_stuff
794 { ConDecl (fst $5) $2 $3 (snd $5) $1 }
795 | srcloc forall constr_stuff
796 { ConDecl (fst $3) $2 [] (snd $3) $1 }
798 forall :: { [RdrNameHsTyVar] }
799 : 'forall' tv_bndrs '.' { $2 }
802 constr_stuff :: { (RdrName, RdrNameConDetails) }
803 : btype {% mkPrefixCon $1 [] }
804 | btype strict_mark atype satypes {% mkPrefixCon $1 (BangType $2 $3 : $4) }
805 | oqtycon '{' '}' {% mkRecCon $1 [] }
806 | oqtycon '{' fielddecls '}' {% mkRecCon $1 $3 }
807 | sbtype conop sbtype { ($2, InfixCon $1 $3) }
809 satypes :: { [RdrNameBangType] }
810 : atype satypes { unbangedType $1 : $2 }
811 | strict_mark atype satypes { BangType $1 $2 : $3 }
814 sbtype :: { RdrNameBangType }
815 : btype { unbangedType $1 }
816 | strict_mark atype { BangType $1 $2 }
818 fielddecls :: { [([RdrName],RdrNameBangType)] }
819 : fielddecl ',' fielddecls { $1 : $3 }
822 fielddecl :: { ([RdrName],RdrNameBangType) }
823 : sig_vars '::' stype { (reverse $1, $3) }
825 stype :: { RdrNameBangType }
826 : ctype { unbangedType $1 }
827 | strict_mark atype { BangType $1 $2 }
829 strict_mark :: { HsBang }
831 | '!' '!' { HsUnbox }
833 deriving :: { Maybe RdrNameContext }
834 : {- empty -} { Nothing }
835 | 'deriving' context { Just $2 }
836 -- Glasgow extension: allow partial
837 -- applications in derivings
839 -----------------------------------------------------------------------------
842 {- There's an awkward overlap with a type signature. Consider
843 f :: Int -> Int = ...rhs...
844 Then we can't tell whether it's a type signature or a value
845 definition with a result signature until we see the '='.
846 So we have to inline enough to postpone reductions until we know.
850 ATTENTION: Dirty Hackery Ahead! If the second alternative of vars is var
851 instead of qvar, we get another shift/reduce-conflict. Consider the
854 { (^^) :: Int->Int ; } Type signature; only var allowed
856 { (^^) :: Int->Int = ... ; } Value defn with result signature;
857 qvar allowed (because of instance decls)
859 We can't tell whether to reduce var to qvar until after we've read the signatures.
862 decl :: { RdrBinding }
864 | infixexp srcloc opt_sig rhs {% checkValDef $1 $3 $4 $2 }
866 rhs :: { RdrNameGRHSs }
867 : '=' srcloc exp wherebinds { GRHSs (unguardedRHS $3 $2) $4 placeHolderType }
868 | gdrhs wherebinds { GRHSs (reverse $1) $2 placeHolderType }
870 gdrhs :: { [RdrNameGRHS] }
871 : gdrhs gdrh { $2 : $1 }
874 gdrh :: { RdrNameGRHS }
875 : '|' srcloc quals '=' exp { GRHS (reverse (ResultStmt $5 $2 : $3)) $2 }
877 sigdecl :: { RdrBinding }
878 : infixexp srcloc '::' sigtype
879 {% checkValSig $1 $4 $2 }
880 -- See the above notes for why we need infixexp here
881 | var ',' sig_vars srcloc '::' sigtype
882 { mkSigDecls [ Sig n $6 $4 | n <- $1:$3 ] }
883 | srcloc infix prec ops { mkSigDecls [ FixSig (FixitySig n (Fixity $3 $2) $1)
885 | '{-# INLINE' srcloc activation qvar '#-}'
886 { RdrHsDecl (SigD (InlineSig True $4 $3 $2)) }
887 | '{-# NOINLINE' srcloc inverse_activation qvar '#-}'
888 { RdrHsDecl (SigD (InlineSig False $4 $3 $2)) }
889 | '{-# SPECIALISE' srcloc qvar '::' sigtypes '#-}'
890 { mkSigDecls [ SpecSig $3 t $2 | t <- $5] }
891 | '{-# SPECIALISE' srcloc 'instance' inst_type '#-}'
892 { RdrHsDecl (SigD (SpecInstSig $4 $2)) }
894 -----------------------------------------------------------------------------
897 exp :: { RdrNameHsExpr }
898 : infixexp '::' sigtype { ExprWithTySig $1 $3 }
899 | fexp srcloc '-<' exp { HsArrApp $1 $4 placeHolderType HsFirstOrderApp True $2 }
900 | fexp srcloc '>-' exp { HsArrApp $4 $1 placeHolderType HsFirstOrderApp False $2 }
901 | fexp srcloc '-<<' exp { HsArrApp $1 $4 placeHolderType HsHigherOrderApp True $2 }
902 | fexp srcloc '>>-' exp { HsArrApp $4 $1 placeHolderType HsHigherOrderApp False $2 }
905 infixexp :: { RdrNameHsExpr }
907 | infixexp qop exp10 { (OpApp $1 (HsVar $2)
908 (panic "fixity") $3 )}
910 exp10 :: { RdrNameHsExpr }
911 : '\\' srcloc aexp aexps opt_asig '->' srcloc exp
912 {% checkPatterns $2 ($3 : reverse $4) >>= \ ps ->
913 return (HsLam (Match ps $5
914 (GRHSs (unguardedRHS $8 $7)
915 EmptyBinds placeHolderType))) }
916 | 'let' binds 'in' exp { HsLet $2 $4 }
917 | 'if' srcloc exp 'then' exp 'else' exp { HsIf $3 $5 $7 $2 }
918 | 'case' srcloc exp 'of' altslist { HsCase $3 $5 $2 }
919 | '-' fexp { mkHsNegApp $2 }
920 | srcloc 'do' stmtlist {% checkDo $3 >>= \ stmts ->
921 return (mkHsDo DoExpr stmts $1) }
922 | srcloc 'mdo' stmtlist {% checkMDo $3 >>= \ stmts ->
923 return (mkHsDo MDoExpr stmts $1) }
925 | scc_annot exp { if opt_SccProfilingOn
929 | 'proc' srcloc aexp '->' srcloc exp
930 {% checkPattern $2 $3 >>= \ p ->
931 return (HsProc p (HsCmdTop $6 [] placeHolderType undefined) $5) }
933 | '{-# CORE' STRING '#-}' exp { HsCoreAnn $2 $4 } -- hdaume: core annotation
935 | reifyexp { HsReify $1 }
938 scc_annot :: { FastString }
939 : '_scc_' STRING { $2 }
940 | '{-# SCC' STRING '#-}' { $2 }
942 fexp :: { RdrNameHsExpr }
943 : fexp aexp { HsApp $1 $2 }
946 reifyexp :: { HsReify RdrName }
947 : REIFY_DECL gtycon { Reify ReifyDecl $2 }
948 | REIFY_DECL qvar { Reify ReifyDecl $2 }
949 | REIFY_TYPE qcname { Reify ReifyType $2 }
950 | REIFY_FIXITY qcname { Reify ReifyFixity $2 }
952 aexps :: { [RdrNameHsExpr] }
953 : aexps aexp { $2 : $1 }
956 aexp :: { RdrNameHsExpr }
957 : qvar '@' aexp { EAsPat $1 $3 }
958 | '~' aexp { ELazyPat $2 }
961 aexp1 :: { RdrNameHsExpr }
962 : aexp1 '{' fbinds '}' {% (mkRecConstrOrUpdate $1 (reverse $3)) }
965 -- Here was the syntax for type applications that I was planning
966 -- but there are difficulties (e.g. what order for type args)
967 -- so it's not enabled yet.
968 -- But this case *is* used for the left hand side of a generic definition,
969 -- which is parsed as an expression before being munged into a pattern
970 | qcname '{|' gentype '|}' { (HsApp (HsVar $1) (HsType $3)) }
972 aexp2 :: { RdrNameHsExpr }
973 : ipvar { HsIPVar $1 }
974 | qcname { HsVar $1 }
975 | literal { HsLit $1 }
976 | INTEGER { HsOverLit $! mkHsIntegral $1 }
977 | RATIONAL { HsOverLit $! mkHsFractional $1 }
978 | '(' exp ')' { HsPar $2 }
979 | '(' exp ',' texps ')' { ExplicitTuple ($2 : reverse $4) Boxed}
980 | '(#' texps '#)' { ExplicitTuple (reverse $2) Unboxed }
981 | '[' list ']' { $2 }
982 | '[:' parr ':]' { $2 }
983 | '(' infixexp qop ')' { (SectionL $2 (HsVar $3)) }
984 | '(' qopm infixexp ')' { (SectionR $2 $3) }
987 -- MetaHaskell Extension
988 | srcloc ID_SPLICE { mkHsSplice (HsVar (mkUnqual varName $2)) $1 } -- $x
989 | srcloc '$(' exp ')' { mkHsSplice $3 $1 } -- $( exp )
990 | srcloc '[|' exp '|]' { HsBracket (ExpBr $3) $1 }
991 | srcloc '[t|' ctype '|]' { HsBracket (TypBr $3) $1 }
992 | srcloc '[p|' infixexp '|]' {% checkPattern $1 $3 >>= \p ->
993 return (HsBracket (PatBr p) $1) }
994 | srcloc '[d|' cvtopbody '|]' { HsBracket (DecBr (mkGroup $3)) $1 }
996 -- arrow notation extension
997 | srcloc '(|' aexp2 cmdargs '|)'
998 { HsArrForm $3 Nothing (reverse $4) $1 }
1000 cmdargs :: { [RdrNameHsCmdTop] }
1001 : cmdargs acmd { $2 : $1 }
1002 | {- empty -} { [] }
1004 acmd :: { RdrNameHsCmdTop }
1005 : aexp2 { HsCmdTop $1 [] placeHolderType undefined }
1007 cvtopbody :: { [RdrNameHsDecl] }
1008 : '{' cvtopdecls '}' { $2 }
1009 | vocurly cvtopdecls close { $2 }
1011 texps :: { [RdrNameHsExpr] }
1012 : texps ',' exp { $3 : $1 }
1016 -----------------------------------------------------------------------------
1019 -- The rules below are little bit contorted to keep lexps left-recursive while
1020 -- avoiding another shift/reduce-conflict.
1022 list :: { RdrNameHsExpr }
1023 : exp { ExplicitList placeHolderType [$1] }
1024 | lexps { ExplicitList placeHolderType (reverse $1) }
1025 | exp '..' { ArithSeqIn (From $1) }
1026 | exp ',' exp '..' { ArithSeqIn (FromThen $1 $3) }
1027 | exp '..' exp { ArithSeqIn (FromTo $1 $3) }
1028 | exp ',' exp '..' exp { ArithSeqIn (FromThenTo $1 $3 $5) }
1029 | exp srcloc pquals { mkHsDo ListComp
1030 (reverse (ResultStmt $1 $2 : $3))
1034 lexps :: { [RdrNameHsExpr] }
1035 : lexps ',' exp { $3 : $1 }
1036 | exp ',' exp { [$3,$1] }
1038 -----------------------------------------------------------------------------
1039 -- List Comprehensions
1041 pquals :: { [RdrNameStmt] } -- Either a singleton ParStmt, or a reversed list of Stmts
1042 : pquals1 { case $1 of
1044 qss -> [ParStmt stmtss]
1046 stmtss = [ (reverse qs, undefined)
1050 pquals1 :: { [[RdrNameStmt]] }
1051 : pquals1 '|' quals { $3 : $1 }
1052 | '|' quals { [$2] }
1054 quals :: { [RdrNameStmt] }
1055 : quals ',' qual { $3 : $1 }
1058 -----------------------------------------------------------------------------
1059 -- Parallel array expressions
1061 -- The rules below are little bit contorted; see the list case for details.
1062 -- Note that, in contrast to lists, we only have finite arithmetic sequences.
1063 -- Moreover, we allow explicit arrays with no element (represented by the nil
1064 -- constructor in the list case).
1066 parr :: { RdrNameHsExpr }
1067 : { ExplicitPArr placeHolderType [] }
1068 | exp { ExplicitPArr placeHolderType [$1] }
1069 | lexps { ExplicitPArr placeHolderType
1071 | exp '..' exp { PArrSeqIn (FromTo $1 $3) }
1072 | exp ',' exp '..' exp { PArrSeqIn (FromThenTo $1 $3 $5) }
1073 | exp srcloc pquals { mkHsDo PArrComp
1074 (reverse (ResultStmt $1 $2 : $3))
1078 -- We are reusing `lexps' and `pquals' from the list case.
1080 -----------------------------------------------------------------------------
1081 -- Case alternatives
1083 altslist :: { [RdrNameMatch] }
1084 : '{' alts '}' { reverse $2 }
1085 | vocurly alts close { reverse $2 }
1087 alts :: { [RdrNameMatch] }
1091 alts1 :: { [RdrNameMatch] }
1092 : alts1 ';' alt { $3 : $1 }
1096 alt :: { RdrNameMatch }
1097 : srcloc infixexp opt_sig ralt wherebinds
1098 {% (checkPattern $1 $2 >>= \p ->
1099 return (Match [p] $3
1100 (GRHSs $4 $5 placeHolderType)) )}
1102 ralt :: { [RdrNameGRHS] }
1103 : '->' srcloc exp { [GRHS [ResultStmt $3 $2] $2] }
1104 | gdpats { reverse $1 }
1106 gdpats :: { [RdrNameGRHS] }
1107 : gdpats gdpat { $2 : $1 }
1110 gdpat :: { RdrNameGRHS }
1111 : srcloc '|' quals '->' exp { GRHS (reverse (ResultStmt $5 $1:$3)) $1}
1113 -----------------------------------------------------------------------------
1114 -- Statement sequences
1116 stmtlist :: { [RdrNameStmt] }
1117 : '{' stmts '}' { $2 }
1118 | vocurly stmts close { $2 }
1120 -- do { ;; s ; s ; ; s ;; }
1121 -- The last Stmt should be a ResultStmt, but that's hard to enforce
1122 -- here, because we need too much lookahead if we see do { e ; }
1123 -- So we use ExprStmts throughout, and switch the last one over
1124 -- in ParseUtils.checkDo instead
1125 stmts :: { [RdrNameStmt] }
1126 : stmt stmts_help { $1 : $2 }
1128 | {- empty -} { [] }
1130 stmts_help :: { [RdrNameStmt] }
1132 | {- empty -} { [] }
1134 -- For typing stmts at the GHCi prompt, where
1135 -- the input may consist of just comments.
1136 maybe_stmt :: { Maybe RdrNameStmt }
1138 | {- nothing -} { Nothing }
1140 stmt :: { RdrNameStmt }
1142 | srcloc infixexp '->' exp {% checkPattern $1 $4 >>= \p ->
1143 return (BindStmt p $2 $1) }
1144 | srcloc 'rec' stmtlist { RecStmt $3 undefined undefined undefined }
1146 qual :: { RdrNameStmt }
1147 : srcloc infixexp '<-' exp {% checkPattern $1 $2 >>= \p ->
1148 return (BindStmt p $4 $1) }
1149 | srcloc exp { ExprStmt $2 placeHolderType $1 }
1150 | srcloc 'let' binds { LetStmt $3 }
1152 -----------------------------------------------------------------------------
1153 -- Record Field Update/Construction
1155 fbinds :: { RdrNameHsRecordBinds }
1156 : fbinds ',' fbind { $3 : $1 }
1159 | {- empty -} { [] }
1161 fbind :: { (RdrName, RdrNameHsExpr) }
1162 : qvar '=' exp { ($1,$3) }
1164 -----------------------------------------------------------------------------
1165 -- Implicit Parameter Bindings
1167 dbinds :: { [(IPName RdrName, RdrNameHsExpr)] }
1168 : dbinds ';' dbind { $3 : $1 }
1171 -- | {- empty -} { [] }
1173 dbind :: { (IPName RdrName, RdrNameHsExpr) }
1174 dbind : ipvar '=' exp { ($1, $3) }
1176 -----------------------------------------------------------------------------
1177 -- Variables, Constructors and Operators.
1179 identifier :: { RdrName }
1184 depreclist :: { [RdrName] }
1185 depreclist : deprec_var { [$1] }
1186 | deprec_var ',' depreclist { $1 : $3 }
1188 deprec_var :: { RdrName }
1189 deprec_var : var { $1 }
1192 gcon :: { RdrName } -- Data constructor namespace
1193 : sysdcon { nameRdrName (dataConName $1) }
1195 -- the case of '[:' ':]' is part of the production `parr'
1197 sysdcon :: { DataCon } -- Wired in data constructors
1198 : '(' ')' { unitDataCon }
1199 | '(' commas ')' { tupleCon Boxed $2 }
1200 | '[' ']' { nilDataCon }
1204 | '(' varsym ')' { $2 }
1208 | '(' varsym ')' { $2 }
1209 | '(' qvarsym1 ')' { $2 }
1210 -- We've inlined qvarsym here so that the decision about
1211 -- whether it's a qvar or a var can be postponed until
1212 -- *after* we see the close paren.
1214 ipvar :: { IPName RdrName }
1215 : IPDUPVARID { Dupable (mkUnqual varName $1) }
1216 | IPSPLITVARID { Linear (mkUnqual varName $1) }
1220 | '(' qconsym ')' { $2 }
1222 varop :: { RdrName }
1224 | '`' varid '`' { $2 }
1226 qvarop :: { RdrName }
1228 | '`' qvarid '`' { $2 }
1230 qvaropm :: { RdrName }
1231 : qvarsym_no_minus { $1 }
1232 | '`' qvarid '`' { $2 }
1234 conop :: { RdrName }
1236 | '`' conid '`' { $2 }
1238 qconop :: { RdrName }
1240 | '`' qconid '`' { $2 }
1242 -----------------------------------------------------------------------------
1243 -- Type constructors
1245 gtycon :: { RdrName } -- A "general" qualified tycon
1247 | '(' ')' { getRdrName unitTyCon }
1248 | '(' commas ')' { getRdrName (tupleTyCon Boxed $2) }
1249 | '(' '->' ')' { getRdrName funTyCon }
1250 | '[' ']' { listTyCon_RDR }
1251 | '[:' ':]' { parrTyCon_RDR }
1253 oqtycon :: { RdrName } -- An "ordinary" qualified tycon
1255 | '(' qtyconsym ')' { $2 }
1257 qtyconop :: { RdrName } -- Qualified or unqualified
1259 | '`' qtycon '`' { $2 }
1261 tyconop :: { RdrName } -- Unqualified
1263 | '`' tycon '`' { $2 }
1265 qtycon :: { RdrName } -- Qualified or unqualified
1266 : QCONID { mkQual tcClsName $1 }
1269 tycon :: { RdrName } -- Unqualified
1270 : CONID { mkUnqual tcClsName $1 }
1272 qtyconsym :: { RdrName }
1273 : QCONSYM { mkQual tcClsName $1 }
1276 tyconsym :: { RdrName }
1277 : CONSYM { mkUnqual tcClsName $1 }
1279 -----------------------------------------------------------------------------
1282 op :: { RdrName } -- used in infix decls
1286 qop :: { RdrName {-HsExpr-} } -- used in sections
1290 qopm :: { RdrNameHsExpr } -- used in sections
1291 : qvaropm { HsVar $1 }
1292 | qconop { HsVar $1 }
1294 -----------------------------------------------------------------------------
1297 qvarid :: { RdrName }
1299 | QVARID { mkQual varName $1 }
1301 varid :: { RdrName }
1302 : varid_no_unsafe { $1 }
1303 | 'unsafe' { mkUnqual varName FSLIT("unsafe") }
1304 | 'safe' { mkUnqual varName FSLIT("safe") }
1305 | 'threadsafe' { mkUnqual varName FSLIT("threadsafe") }
1307 varid_no_unsafe :: { RdrName }
1308 : VARID { mkUnqual varName $1 }
1309 | special_id { mkUnqual varName $1 }
1310 | 'forall' { mkUnqual varName FSLIT("forall") }
1312 tyvar :: { RdrName }
1313 : VARID { mkUnqual tvName $1 }
1314 | special_id { mkUnqual tvName $1 }
1315 | 'unsafe' { mkUnqual tvName FSLIT("unsafe") }
1316 | 'safe' { mkUnqual tvName FSLIT("safe") }
1317 | 'threadsafe' { mkUnqual tvName FSLIT("threadsafe") }
1319 -- These special_ids are treated as keywords in various places,
1320 -- but as ordinary ids elsewhere. 'special_id' collects all these
1321 -- except 'unsafe' and 'forall' whose treatment differs depending on context
1322 special_id :: { UserFS }
1324 : 'as' { FSLIT("as") }
1325 | 'qualified' { FSLIT("qualified") }
1326 | 'hiding' { FSLIT("hiding") }
1327 | 'export' { FSLIT("export") }
1328 | 'label' { FSLIT("label") }
1329 | 'dynamic' { FSLIT("dynamic") }
1330 | 'stdcall' { FSLIT("stdcall") }
1331 | 'ccall' { FSLIT("ccall") }
1333 -----------------------------------------------------------------------------
1336 qvarsym :: { RdrName }
1340 qvarsym_no_minus :: { RdrName }
1341 : varsym_no_minus { $1 }
1344 qvarsym1 :: { RdrName }
1345 qvarsym1 : QVARSYM { mkQual varName $1 }
1347 varsym :: { RdrName }
1348 : varsym_no_minus { $1 }
1349 | '-' { mkUnqual varName FSLIT("-") }
1351 varsym_no_minus :: { RdrName } -- varsym not including '-'
1352 : VARSYM { mkUnqual varName $1 }
1353 | special_sym { mkUnqual varName $1 }
1356 -- See comments with special_id
1357 special_sym :: { UserFS }
1358 special_sym : '!' { FSLIT("!") }
1359 | '.' { FSLIT(".") }
1360 | '*' { FSLIT("*") }
1362 -----------------------------------------------------------------------------
1363 -- Data constructors
1365 qconid :: { RdrName } -- Qualified or unqualifiedb
1367 | QCONID { mkQual dataName $1 }
1369 conid :: { RdrName }
1370 : CONID { mkUnqual dataName $1 }
1372 qconsym :: { RdrName } -- Qualified or unqualified
1374 | QCONSYM { mkQual dataName $1 }
1376 consym :: { RdrName }
1377 : CONSYM { mkUnqual dataName $1 }
1379 -- ':' means only list cons
1380 | ':' { consDataCon_RDR }
1383 -----------------------------------------------------------------------------
1386 literal :: { HsLit }
1387 : CHAR { HsChar (ord $1) } --TODO remove ord
1388 | STRING { HsString $1 }
1389 | PRIMINTEGER { HsIntPrim $1 }
1390 | PRIMCHAR { HsCharPrim (ord $1) } --TODO remove ord
1391 | PRIMSTRING { HsStringPrim $1 }
1392 | PRIMFLOAT { HsFloatPrim $1 }
1393 | PRIMDOUBLE { HsDoublePrim $1 }
1395 srcloc :: { SrcLoc } : {% getSrcLoc }
1397 -----------------------------------------------------------------------------
1401 : vccurly { () } -- context popped in lexer.
1402 | error {% popContext }
1404 -----------------------------------------------------------------------------
1405 -- Miscellaneous (mostly renamings)
1407 modid :: { ModuleName }
1408 : CONID { mkModuleNameFS $1 }
1409 | QCONID { mkModuleNameFS
1411 (unpackFS (fst $1) ++
1412 '.':unpackFS (snd $1)))
1416 : commas ',' { $1 + 1 }
1419 -----------------------------------------------------------------------------
1423 happyError = srcParseFail