X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Fparser%2FParser.y;h=18021175669ec129fb1e3bc0f8626000cfe67e81;hb=98232a6130f0661486899530fa3461e32499366f;hp=6c0fccb0f5227549c53c455910628b5a273f96ea;hpb=ef2b170c6298b4826d3b56465a3c1438b5be7307;p=ghc-hetmet.git diff --git a/ghc/compiler/parser/Parser.y b/ghc/compiler/parser/Parser.y index 6c0fccb..1802117 100644 --- a/ghc/compiler/parser/Parser.y +++ b/ghc/compiler/parser/Parser.y @@ -1,6 +1,6 @@ {- -*-haskell-*- ----------------------------------------------------------------------------- -$Id: Parser.y,v 1.98 2002/05/27 15:28:08 simonpj Exp $ +$Id: Parser.y,v 1.121 2003/07/16 08:49:05 ross Exp $ Haskell grammar. @@ -11,53 +11,70 @@ Author(s): Simon Marlow, Sven Panne 1997, 1998, 1999 { module Parser ( parseModule, parseStmt, parseIdentifier, parseIface ) where +#include "HsVersions.h" + import HsSyn import HsTypes ( mkHsTupCon ) import RdrHsSyn -import RnMonad ( ParsedIface(..) ) +import HscTypes ( ParsedIface(..), IsBootInterface, noDependencies ) import Lex -import ParseUtil import RdrName -import PrelNames ( mAIN_Name, unitTyCon_RDR, funTyCon_RDR, - listTyCon_RDR, parrTyCon_RDR, tupleTyCon_RDR, - unitCon_RDR, nilCon_RDR, tupleCon_RDR ) +import PrelNames ( mAIN_Name, funTyConName, listTyConName, + parrTyConName, consDataConName ) +import TysWiredIn ( unitTyCon, unitDataCon, tupleTyCon, tupleCon, nilDataCon ) import ForeignCall ( Safety(..), CExportSpec(..), CCallConv(..), CCallTarget(..), defaultCCallConv, ) import OccName ( UserFS, varName, tcName, dataName, tcClsName, tvName ) import TyCon ( DataConDetails(..) ) +import DataCon ( DataCon, dataConName ) import SrcLoc ( SrcLoc ) import Module import CmdLineOpts ( opt_SccProfilingOn, opt_InPackage ) import Type ( Kind, mkArrowKind, liftedTypeKind ) import BasicTypes ( Boxity(..), Fixity(..), FixityDirection(..), IPName(..), - NewOrData(..), StrictnessMark(..), Activation(..) ) + NewOrData(..), StrictnessMark(..), Activation(..), + FixitySig(..) ) import Panic -import GlaExts +import GLAEXTS import CStrings ( CLabelString ) import FastString import Maybes ( orElse ) import Outputable -#include "HsVersions.h" } {- ----------------------------------------------------------------------------- -Conflicts: 21 shift/reduce, -=chak[4Feb2] +Conflicts: 29 shift/reduce, [SDM 19/9/2002] -11 for abiguity in 'if x then y else z + 1' [State 128] +10 for abiguity in 'if x then y else z + 1' [State 136] (shift parses as 'if x then y else (z + 1)', as per longest-parse rule) - 8 because op might be: - ! * . `x` VARSYM CONSYM QVARSYM QCONSYM + 10 because op might be: : - ! * . `x` VARSYM CONSYM QVARSYM QCONSYM + +1 for ambiguity in 'if x then y else z with ?x=3' [State 136] + (shift parses as 'if x then y else (z with ?x=3)' + +1 for ambiguity in 'if x then y else z :: T' [State 136] + (shift parses as 'if x then y else (z :: T)', as per longest-parse rule) + +8 for ambiguity in 'e :: a `b` c'. Does this mean [States 160,246] + (e::a) `b` c, or + (e :: (a `b` c)) + +1 for ambiguity in 'let ?x ...' [State 268] + the parser can't tell whether the ?x is the lhs of a normal binding or + an implicit binding. Fortunately resolving as shift gives it the only + sensible meaning, namely the lhs of an implicit binding. -1 for ambiguity in '{-# RULES "name" [ ... #-} [State 210] +1 for ambiguity in '{-# RULES "name" [ ... #-} [State 332] we don't know whether the '[' starts the activation or not: it might be the start of the declaration with the activation being empty. --SDM 1/4/2002 -1 for ambiguity in '{-# RULES "name" forall = ... #-}' [State 412] +1 for ambiguity in '{-# RULES "name" forall = ... #-}' [State 394] since 'forall' is a valid variable name, we don't know whether to treat a forall on the input as the beginning of a quantifier or the beginning of the rule itself. Resolving to shift means @@ -65,28 +82,9 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] This saves explicitly defining a grammar for the rule lhs that doesn't include 'forall'. -1 for ambiguity in 'let ?x ...' [State 278] - the parser can't tell whether the ?x is the lhs of a normal binding or - an implicit binding. Fortunately resolving as shift gives it the only - sensible meaning, namely the lhs of an implicit binding. - - -8 for ambiguity in 'e :: a `b` c'. Does this mean [States 238,267] - (e::a) `b` c, or - (e :: (a `b` c)) - -6 for conflicts between `fdecl' and `fdeclDEPRECATED', [States 402,403] - which are resolved correctly, and moreover, - should go away when `fdeclDEPRECATED' is removed. - -1 for ambiguity in 'if x then y else z :: T' - (shift parses as 'if x then y else (z :: T)', as per longest-parse rule) -1 for ambiguity in 'if x then y else z with ?x=3' - (shift parses as 'if x then y else (z with ?x=3)' -3 for ambiguity in 'case x of y :: a -> b' - (don't know whether to reduce 'a' as a btype or shift the '->'. - conclusion: bogus expression anyway, doesn't matter) - +6 for conflicts between `fdecl' and `fdeclDEPRECATED', [States 384,385] + which are resolved correctly, and moreover, + should go away when `fdeclDEPRECATED' is removed. ----------------------------------------------------------------------------- -} @@ -128,9 +126,12 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] 'threadsafe' { ITthreadsafe } 'unsafe' { ITunsafe } 'with' { ITwith } + 'mdo' { ITmdo } 'stdcall' { ITstdcallconv } 'ccall' { ITccallconv } 'dotnet' { ITdotnet } + 'proc' { ITproc } -- for arrow notation extension + 'rec' { ITrec } -- for arrow notation extension '_ccall_' { ITccall (False, False, PlayRisky) } '_ccall_GC_' { ITccall (False, False, PlaySafe False) } '_casm_' { ITccall (False, True, PlayRisky) } @@ -141,6 +142,7 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] '{-# INLINE' { ITinline_prag } '{-# NOINLINE' { ITnoinline_prag } '{-# RULES' { ITrules_prag } + '{-# CORE' { ITcore_prag } -- hdaume: annotated core '{-# SCC' { ITscc_prag } '{-# DEPRECATED' { ITdeprecated_prag } '#-}' { ITclose_prag } @@ -176,6 +178,7 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] -} '..' { ITdotdot } -- reserved symbols + ':' { ITcolon } '::' { ITdcolon } '=' { ITequal } '\\' { ITlam } @@ -188,6 +191,10 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] '-' { ITminus } '!' { ITbang } '*' { ITstar } + '-<' { ITlarrowtail } -- for arrow notation + '>-' { ITrarrowtail } -- for arrow notation + '-<<' { ITLarrowtail } -- for arrow notation + '>>-' { ITRarrowtail } -- for arrow notation '.' { ITdot } '{' { ITocurly } -- special symbols @@ -203,6 +210,8 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] ')' { ITcparen } '(#' { IToubxparen } '#)' { ITcubxparen } + '(|' { IToparenbar } + '|)' { ITcparenbar } ';' { ITsemi } ',' { ITcomma } '`' { ITbackquote } @@ -230,6 +239,18 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] PRIMFLOAT { ITprimfloat $$ } PRIMDOUBLE { ITprimdouble $$ } CLITLIT { ITlitlit $$ } + +-- Template Haskell +'[|' { ITopenExpQuote } +'[p|' { ITopenPatQuote } +'[t|' { ITopenTypQuote } +'[d|' { ITopenDecQuote } +'|]' { ITcloseQuote } +ID_SPLICE { ITidEscape $$ } -- $x +'$(' { ITparenEscape } -- $( exp ) +REIFY_TYPE { ITreifyType } +REIFY_DECL { ITreifyDecl } +REIFY_FIXITY { ITreifyFixity } %monad { P } { thenP } { returnP } %lexer { lexer } { ITeof } @@ -252,9 +273,9 @@ Conflicts: 21 shift/reduce, -=chak[4Feb2] module :: { RdrNameHsModule } : srcloc 'module' modid maybemoddeprec maybeexports 'where' body - { HsModule $3 Nothing $5 (fst $7) (snd $7) $4 $1 } + { HsModule (Just (mkHomeModule $3)) $5 (fst $7) (snd $7) $4 $1 } | srcloc body - { HsModule mAIN_Name Nothing Nothing (fst $2) (snd $2) Nothing $1 } + { HsModule Nothing Nothing (fst $2) (snd $2) Nothing $1 } maybemoddeprec :: { Maybe DeprecTxt } : '{-# DEPRECATED' STRING '#-}' { Just $2 } @@ -270,7 +291,7 @@ top :: { ([RdrNameImportDecl], [RdrNameHsDecl]) } | cvtopdecls { ([],$1) } cvtopdecls :: { [RdrNameHsDecl] } - : topdecls { cvTopDecls (groupBindings $1)} + : topdecls { cvTopDecls $1 } ----------------------------------------------------------------------------- -- Interfaces (.hi-boot files) @@ -283,6 +304,7 @@ iface :: { ParsedIface } pi_vers = 1, -- Module version pi_orphan = False, pi_exports = (1,[($2,mkIfaceExports $4)]), + pi_deps = noDependencies, pi_usages = [], pi_fixity = [], pi_insts = [], @@ -297,30 +319,14 @@ ifacebody :: { [RdrNameTyClDecl] } | layout_on ifacedecls close { $2 } ifacedecls :: { [RdrNameTyClDecl] } - : ifacedecl ';' ifacedecls { $1 : $3 } - | ';' ifacedecls { $2 } - | ifacedecl { [$1] } - | {- empty -} { [] } + : ifacedecl ';' ifacedecls { $1 : $3 } + | ';' ifacedecls { $2 } + | ifacedecl { [$1] } + | {- empty -} { [] } ifacedecl :: { RdrNameTyClDecl } - : srcloc 'data' tycl_hdr constrs - { mkTyData DataType $3 (DataCons (reverse $4)) Nothing $1 } - - | srcloc 'newtype' tycl_hdr '=' newconstr - { mkTyData NewType $3 (DataCons [$5]) Nothing $1 } - - | srcloc 'class' tycl_hdr fds where - { let - (binds,sigs) = cvMonoBindsAndSigs cvClassOpSig - (groupBindings $5) - in - mkClassDecl $3 $4 sigs (Just binds) $1 } - - | srcloc 'type' tycon tv_bndrs '=' ctype - { TySynonym $3 $4 $6 $1 } - - | srcloc var '::' sigtype - { IfaceSig $2 $4 [] $1 } + : tycl_decl { $1 } + | srcloc var '::' sigtype { IfaceSig $2 $4 [] $1 } ----------------------------------------------------------------------------- -- The Export List @@ -335,20 +341,21 @@ exportlist :: { [RdrNameIE] } | export { [$1] } | {- empty -} { [] } - -- GHC extension: we allow things like [] and (,,,) to be exported + -- No longer allow things like [] and (,,,) to be exported + -- They are built in syntax, always available export :: { RdrNameIE } : qvar { IEVar $1 } - | gtycon { IEThingAbs $1 } - | gtycon '(' '..' ')' { IEThingAll $1 } - | gtycon '(' ')' { IEThingWith $1 [] } - | gtycon '(' qcnames ')' { IEThingWith $1 (reverse $3) } + | oqtycon { IEThingAbs $1 } + | oqtycon '(' '..' ')' { IEThingAll $1 } + | oqtycon '(' ')' { IEThingWith $1 [] } + | oqtycon '(' qcnames ')' { IEThingWith $1 (reverse $3) } | 'module' modid { IEModuleContents $2 } qcnames :: { [RdrName] } : qcnames ',' qcname { $3 : $1 } | qcname { [$1] } -qcname :: { RdrName } +qcname :: { RdrName } -- Variable or data constructor : qvar { $1 } | gcon { $1 } @@ -368,9 +375,9 @@ importdecl :: { RdrNameImportDecl } : 'import' srcloc maybe_src optqualified modid maybeas maybeimpspec { ImportDecl $5 $3 $4 $6 $7 $2 } -maybe_src :: { WhereFrom } - : '{-# SOURCE' '#-}' { ImportByUserSource } - | {- empty -} { ImportByUser } +maybe_src :: { IsBootInterface } + : '{-# SOURCE' '#-}' { True } + | {- empty -} { False } optqualified :: { Bool } : 'qualified' { True } @@ -393,8 +400,7 @@ impspec :: { (Bool, [RdrNameIE]) } prec :: { Int } : {- empty -} { 9 } - | INTEGER {% checkPrec $1 `thenP_` - returnP (fromInteger $1) } + | INTEGER {% checkPrecP (fromInteger $1) } infix :: { FixityDirection } : 'infix' { InfixN } @@ -408,47 +414,43 @@ ops :: { [RdrName] } ----------------------------------------------------------------------------- -- Top-Level Declarations -topdecls :: { [RdrBinding] } - : topdecls ';' topdecl { ($3 : $1) } +topdecls :: { [RdrBinding] } -- Reversed + : topdecls ';' topdecl { $3 : $1 } | topdecls ';' { $1 } | topdecl { [$1] } topdecl :: { RdrBinding } + : tycl_decl { RdrHsDecl (TyClD $1) } + | srcloc 'instance' inst_type where + { let (binds,sigs) = cvMonoBindsAndSigs $4 + in RdrHsDecl (InstD (InstDecl $3 binds sigs Nothing $1)) } + | srcloc 'default' '(' comma_types0 ')' { RdrHsDecl (DefD (DefaultDecl $4 $1)) } + | 'foreign' fdecl { RdrHsDecl $2 } + | '{-# DEPRECATED' deprecations '#-}' { RdrBindings (reverse $2) } + | '{-# RULES' rules '#-}' { RdrBindings (reverse $2) } + | srcloc '$(' exp ')' { RdrHsDecl (SpliceD (SpliceDecl $3 $1)) } + | decl { $1 } + +tycl_decl :: { RdrNameTyClDecl } : srcloc 'type' syn_hdr '=' ctype -- Note ctype, not sigtype. -- We allow an explicit for-all but we don't insert one -- in type Foo a = (b,b) -- Instead we just say b is out of scope - { let (tc,tvs) = $3 - in RdrHsDecl (TyClD (TySynonym tc tvs $5 $1)) } + { let (tc,tvs) = $3 in TySynonym tc tvs $5 $1 } | srcloc 'data' tycl_hdr constrs deriving - {% returnP (RdrHsDecl (TyClD - (mkTyData DataType $3 (DataCons (reverse $4)) $5 $1))) } + { mkTyData DataType $3 (DataCons (reverse $4)) $5 $1 } | srcloc 'newtype' tycl_hdr '=' newconstr deriving - {% returnP (RdrHsDecl (TyClD - (mkTyData NewType $3 (DataCons [$5]) $6 $1))) } + { mkTyData NewType $3 (DataCons [$5]) $6 $1 } | srcloc 'class' tycl_hdr fds where - {% let - (binds,sigs) = cvMonoBindsAndSigs cvClassOpSig (groupBindings $5) - in - returnP (RdrHsDecl (TyClD - (mkClassDecl $3 $4 sigs (Just binds) $1))) } - - | srcloc 'instance' inst_type where - { let (binds,sigs) - = cvMonoBindsAndSigs cvInstDeclSig - (groupBindings $4) - in RdrHsDecl (InstD (InstDecl $3 binds sigs Nothing $1)) } - - | srcloc 'default' '(' comma_types0 ')' { RdrHsDecl (DefD (DefaultDecl $4 $1)) } - | 'foreign' fdecl { RdrHsDecl $2 } - | '{-# DEPRECATED' deprecations '#-}' { $2 } - | '{-# RULES' rules '#-}' { $2 } - | decl { $1 } + { let + (binds,sigs) = cvMonoBindsAndSigs $5 + in + mkClassDecl $3 $4 sigs (Just binds) $1 } syn_hdr :: { (RdrName, [RdrNameHsTyVar]) } -- We don't retain the syntax of an infix -- type synonym declaration. Oh well. @@ -467,94 +469,44 @@ tycl_hdr :: { (RdrNameContext, RdrName, [RdrNameHsTyVar]) } | type {% checkTyClHdr $1 `thenP` \ (tc,tvs) -> returnP ([], tc, tvs) } -{- - : '(' comma_types1 ')' '=>' gtycon tv_bndrs - {% mapP checkPred $2 `thenP` \ cxt -> - returnP (cxt, $5, $6) } - - | '(' ')' '=>' gtycon tv_bndrs - { ([], $4, $5) } - - -- qtycon for the class below name would lead to many s/r conflicts - -- FIXME: does the renamer pick up all wrong forms and raise an - -- error - | gtycon atypes1 '=>' gtycon atypes0 - {% checkTyVars $5 `thenP` \ tvs -> - returnP ([HsClassP $1 $2], $4, tvs) } - - | gtycon atypes0 - {% checkTyVars $2 `thenP` \ tvs -> - returnP ([], $1, tvs) } - -- We have to have qtycon in this production to avoid s/r - -- conflicts with the previous one. The renamer will complain - -- if we use a qualified tycon. - -- - -- Using a `gtycon' throughout. This enables special syntax, - -- such as "[]" for tycons as well as tycon ops in - -- parentheses. This is beyond H98, but used repeatedly in - -- the Prelude modules. (So, it would be a good idea to raise - -- an error in the renamer if some non-H98 form is used and - -- -fglasgow-exts is not given.) -=chak - -atypes0 :: { [RdrNameHsType] } - : atypes1 { $1 } - | {- empty -} { [] } - -atypes1 :: { [RdrNameHsType] } - : atype { [$1] } - | atype atypes1 { $1 : $2 } --} +----------------------------------------------------------------------------- +-- Nested declarations -decls :: { [RdrBinding] } +decls :: { [RdrBinding] } -- Reversed : decls ';' decl { $3 : $1 } | decls ';' { $1 } | decl { [$1] } | {- empty -} { [] } -decl :: { RdrBinding } - : fixdecl { $1 } - | valdef { $1 } - | '{-# INLINE' srcloc activation qvar '#-}' { RdrSig (InlineSig True $4 $3 $2) } - | '{-# NOINLINE' srcloc inverse_activation qvar '#-}' { RdrSig (InlineSig False $4 $3 $2) } - | '{-# SPECIALISE' srcloc qvar '::' sigtypes '#-}' - { foldr1 RdrAndBindings - (map (\t -> RdrSig (SpecSig $3 t $2)) $5) } - | '{-# SPECIALISE' srcloc 'instance' inst_type '#-}' - { RdrSig (SpecInstSig $4 $2) } -wherebinds :: { RdrNameHsBinds } - : where { cvBinds cvValSig (groupBindings $1) } +decllist :: { [RdrBinding] } -- Reversed + : '{' decls '}' { $2 } + | layout_on decls close { $2 } -where :: { [RdrBinding] } +where :: { [RdrBinding] } -- Reversed + -- No implicit parameters : 'where' decllist { $2 } | {- empty -} { [] } -declbinds :: { RdrNameHsBinds } - : decllist { cvBinds cvValSig (groupBindings $1) } +binds :: { RdrNameHsBinds } -- May have implicit parameters + : decllist { cvBinds $1 } + | '{' dbinds '}' { IPBinds $2 False{-not with-} } + | layout_on dbinds close { IPBinds $2 False{-not with-} } -decllist :: { [RdrBinding] } - : '{' decls '}' { $2 } - | layout_on decls close { $2 } +wherebinds :: { RdrNameHsBinds } -- May have implicit parameters + : 'where' binds { $2 } + | {- empty -} { EmptyBinds } -letbinds :: { RdrNameHsExpr -> RdrNameHsExpr } - : decllist { HsLet (cvBinds cvValSig (groupBindings $1)) } - | '{' dbinds '}' { \e -> HsWith e $2 False{-not with-} } - | layout_on dbinds close { \e -> HsWith e $2 False{-not with-} } -fixdecl :: { RdrBinding } - : srcloc infix prec ops { foldr1 RdrAndBindings - [ RdrSig (FixSig (FixitySig n - (Fixity $3 $2) $1)) - | n <- $4 ] } ----------------------------------------------------------------------------- -- Transformation Rules -rules :: { RdrBinding } - : rules ';' rule { $1 `RdrAndBindings` $3 } +rules :: { [RdrBinding] } -- Reversed + : rules ';' rule { $3 : $1 } | rules ';' { $1 } - | rule { $1 } - | {- empty -} { RdrNullBind } + | rule { [$1] } + | {- empty -} { [] } rule :: { RdrBinding } : STRING activation rule_forall infixexp '=' srcloc exp @@ -585,18 +537,18 @@ rule_var :: { RdrNameRuleBndr } | '(' varid '::' ctype ')' { RuleBndrSig $2 $4 } ----------------------------------------------------------------------------- --- Deprecations +-- Deprecations (c.f. rules) -deprecations :: { RdrBinding } - : deprecations ';' deprecation { $1 `RdrAndBindings` $3 } - | deprecations ';' { $1 } - | deprecation { $1 } - | {- empty -} { RdrNullBind } +deprecations :: { [RdrBinding] } -- Reversed + : deprecations ';' deprecation { $3 : $1 } + | deprecations ';' { $1 } + | deprecation { [$1] } + | {- empty -} { [] } -- SUP: TEMPORARY HACK, not checking for `module Foo' deprecation :: { RdrBinding } : srcloc depreclist STRING - { foldr RdrAndBindings RdrNullBind + { RdrBindings [ RdrHsDecl (DeprecD (Deprecation n $3 $1)) | n <- $2 ] } @@ -735,8 +687,8 @@ safety1 :: { Safety } -- only needed to avoid conflicts with the DEPRECATED rules fspec :: { (FastString, RdrName, RdrNameHsType) } - : STRING varid '::' sigtype { ($1 , $2, $4) } - | varid '::' sigtype { (nilFS, $1, $3) } + : STRING var '::' sigtype { ($1 , $2, $4) } + | var '::' sigtype { (nilFS, $1, $3) } -- if the entity string is missing, it defaults to the empty string; -- the meaning of an empty entity string depends on the calling -- convention @@ -794,6 +746,7 @@ type :: { RdrNameHsType } gentype :: { RdrNameHsType } : btype { $1 } | btype qtyconop gentype { HsOpTy $1 (HsTyOp $2) $3 } + | btype '`' tyvar '`' gentype { HsOpTy $1 (HsTyOp $3) $5 } | btype '->' gentype { HsOpTy $1 HsArrow $3 } btype :: { RdrNameHsType } @@ -805,9 +758,9 @@ atype :: { RdrNameHsType } | tyvar { HsTyVar $1 } | '(' type ',' comma_types1 ')' { HsTupleTy (mkHsTupCon tcName Boxed ($2:$4)) ($2:$4) } | '(#' comma_types1 '#)' { HsTupleTy (mkHsTupCon tcName Unboxed $2) $2 } - | '[' type ']' { HsListTy $2 } - | '[:' type ':]' { HsPArrTy $2 } - | '(' ctype ')' { $2 } + | '[' type ']' { HsListTy $2 } + | '[:' type ':]' { HsPArrTy $2 } + | '(' ctype ')' { HsParTy $2 } | '(' ctype '::' kind ')' { HsKindSig $2 $4 } -- Generics | INTEGER { HsNumTy $1 } @@ -866,9 +819,9 @@ akind :: { Kind } -- Datatype declarations newconstr :: { RdrNameConDecl } - : srcloc conid atype { mkConDecl $2 [] [] (VanillaCon [unbangedType $3]) $1 } + : srcloc conid atype { ConDecl $2 [] [] (PrefixCon [unbangedType $3]) $1 } | srcloc conid '{' var '::' ctype '}' - { mkConDecl $2 [] [] (RecCon [([$4], unbangedType $6)]) $1 } + { ConDecl $2 [] [] (RecCon [($4, unbangedType $6)]) $1 } constrs :: { [RdrNameConDecl] } : {- empty; a GHC extension -} { [] } @@ -880,19 +833,19 @@ constrs1 :: { [RdrNameConDecl] } constr :: { RdrNameConDecl } : srcloc forall context '=>' constr_stuff - { mkConDecl (fst $5) $2 $3 (snd $5) $1 } + { ConDecl (fst $5) $2 $3 (snd $5) $1 } | srcloc forall constr_stuff - { mkConDecl (fst $3) $2 [] (snd $3) $1 } + { ConDecl (fst $3) $2 [] (snd $3) $1 } forall :: { [RdrNameHsTyVar] } : 'forall' tv_bndrs '.' { $2 } | {- empty -} { [] } constr_stuff :: { (RdrName, RdrNameConDetails) } - : btype {% mkVanillaCon $1 [] } - | btype '!' atype satypes {% mkVanillaCon $1 (BangType MarkedUserStrict $3 : $4) } - | gtycon '{' '}' {% mkRecCon $1 [] } - | gtycon '{' fielddecls '}' {% mkRecCon $1 $3 } + : btype {% mkPrefixCon $1 [] } + | btype '!' atype satypes {% mkPrefixCon $1 (BangType MarkedUserStrict $3 : $4) } + | oqtycon '{' '}' {% mkRecCon $1 [] } + | oqtycon '{' fielddecls '}' {% mkRecCon $1 $3 } | sbtype conop sbtype { ($2, InfixCon $1 $3) } satypes :: { [RdrNameBangType] } @@ -944,17 +897,13 @@ deriving :: { Maybe RdrNameContext } We can't tell whether to reduce var to qvar until after we've read the signatures. -} -valdef :: { RdrBinding } - : infixexp srcloc opt_sig rhs {% (checkValDef $1 $3 $4 $2) } - | infixexp srcloc '::' sigtype {% (checkValSig $1 $4 $2) } - | var ',' sig_vars srcloc '::' sigtype { foldr1 RdrAndBindings - [ RdrSig (Sig n $6 $4) | n <- $1:$3 ] - } - +decl :: { RdrBinding } + : sigdecl { $1 } + | infixexp srcloc opt_sig rhs {% checkValDef $1 $3 $4 $2 } rhs :: { RdrNameGRHSs } - : '=' srcloc exp wherebinds { (GRHSs (unguardedRHS $3 $2) $4 placeHolderType)} - | gdrhs wherebinds { GRHSs (reverse $1) $2 placeHolderType } + : '=' srcloc exp wherebinds { GRHSs (unguardedRHS $3 $2) $4 placeHolderType } + | gdrhs wherebinds { GRHSs (reverse $1) $2 placeHolderType } gdrhs :: { [RdrNameGRHS] } : gdrhs gdrh { $2 : $1 } @@ -963,12 +912,33 @@ gdrhs :: { [RdrNameGRHS] } gdrh :: { RdrNameGRHS } : '|' srcloc quals '=' exp { GRHS (reverse (ResultStmt $5 $2 : $3)) $2 } +sigdecl :: { RdrBinding } + : infixexp srcloc '::' sigtype + {% checkValSig $1 $4 $2 } + -- See the above notes for why we need infixexp here + | var ',' sig_vars srcloc '::' sigtype + { mkSigDecls [ Sig n $6 $4 | n <- $1:$3 ] } + | srcloc infix prec ops { mkSigDecls [ FixSig (FixitySig n (Fixity $3 $2) $1) + | n <- $4 ] } + | '{-# INLINE' srcloc activation qvar '#-}' + { RdrHsDecl (SigD (InlineSig True $4 $3 $2)) } + | '{-# NOINLINE' srcloc inverse_activation qvar '#-}' + { RdrHsDecl (SigD (InlineSig False $4 $3 $2)) } + | '{-# SPECIALISE' srcloc qvar '::' sigtypes '#-}' + { mkSigDecls [ SpecSig $3 t $2 | t <- $5] } + | '{-# SPECIALISE' srcloc 'instance' inst_type '#-}' + { RdrHsDecl (SigD (SpecInstSig $4 $2)) } + ----------------------------------------------------------------------------- -- Expressions exp :: { RdrNameHsExpr } - : infixexp '::' sigtype { (ExprWithTySig $1 $3) } - | infixexp 'with' dbinding { HsWith $1 $3 True{-not a let-} } + : infixexp '::' sigtype { ExprWithTySig $1 $3 } + | infixexp 'with' dbinding { HsLet (IPBinds $3 True{-not a let-}) $1 } + | fexp srcloc '-<' exp { HsArrApp $1 $4 placeHolderType HsFirstOrderApp True $2 } + | fexp srcloc '>-' exp { HsArrApp $4 $1 placeHolderType HsFirstOrderApp False $2 } + | fexp srcloc '-<<' exp { HsArrApp $1 $4 placeHolderType HsHigherOrderApp True $2 } + | fexp srcloc '>>-' exp { HsArrApp $4 $1 placeHolderType HsHigherOrderApp False $2 } | infixexp { $1 } infixexp :: { RdrNameHsExpr } @@ -982,12 +952,14 @@ exp10 :: { RdrNameHsExpr } returnP (HsLam (Match ps $5 (GRHSs (unguardedRHS $8 $7) EmptyBinds placeHolderType))) } - | 'let' letbinds 'in' exp { $2 $4 } + | 'let' binds 'in' exp { HsLet $2 $4 } | 'if' srcloc exp 'then' exp 'else' exp { HsIf $3 $5 $7 $2 } | 'case' srcloc exp 'of' altslist { HsCase $3 $5 $2 } | '-' fexp { mkHsNegApp $2 } | srcloc 'do' stmtlist {% checkDo $3 `thenP` \ stmts -> - returnP (HsDo DoExpr stmts $1) } + returnP (mkHsDo DoExpr stmts $1) } + | srcloc 'mdo' stmtlist {% checkMDo $3 `thenP` \ stmts -> + returnP (mkHsDo MDoExpr stmts $1) } | '_ccall_' ccallid aexps0 { HsCCall $2 $3 PlayRisky False placeHolderType } | '_ccall_GC_' ccallid aexps0 { HsCCall $2 $3 (PlaySafe False) False placeHolderType } @@ -998,6 +970,13 @@ exp10 :: { RdrNameHsExpr } then HsSCC $1 $2 else HsPar $2 } + | 'proc' srcloc aexp '->' srcloc exp + {% checkPattern $2 $3 `thenP` \ p -> + returnP (HsProc p (HsCmdTop $6 [] placeHolderType undefined) $5) } + + | '{-# CORE' STRING '#-}' exp { HsCoreAnn $2 $4 } -- hdaume: core annotation + + | reifyexp { HsReify $1 } | fexp { $1 } scc_annot :: { FastString } @@ -1012,6 +991,12 @@ fexp :: { RdrNameHsExpr } : fexp aexp { (HsApp $1 $2) } | aexp { $1 } +reifyexp :: { HsReify RdrName } + : REIFY_DECL gtycon { Reify ReifyDecl $2 } + | REIFY_DECL qvar { Reify ReifyDecl $2 } + | REIFY_TYPE qcname { Reify ReifyType $2 } + | REIFY_FIXITY qcname { Reify ReifyFixity $2 } + aexps0 :: { [RdrNameHsExpr] } : aexps { reverse $1 } @@ -1025,19 +1010,17 @@ aexp :: { RdrNameHsExpr } | aexp1 { $1 } aexp1 :: { RdrNameHsExpr } - : aexp1 '{' fbinds '}' {% (mkRecConstrOrUpdate $1 - (reverse $3)) } - | aexp2 { $1 } - | var_or_con '{|' gentype '|}' { HsApp $1 (HsType $3) } - + : aexp1 '{' fbinds '}' {% (mkRecConstrOrUpdate $1 (reverse $3)) } + | aexp2 { $1 } -var_or_con :: { RdrNameHsExpr } - : qvar { HsVar $1 } - | gcon { HsVar $1 } +-- Here was the syntax for type applications that I was planning +-- but there are difficulties (e.g. what order for type args) +-- so it's not enabled yet. + | qcname '{|' gentype '|}' { (HsApp (HsVar $1) (HsType $3)) } aexp2 :: { RdrNameHsExpr } : ipvar { HsIPVar $1 } - | var_or_con { $1 } + | qcname { HsVar $1 } | literal { HsLit $1 } | INTEGER { HsOverLit (mkHsIntegral $1) } | RATIONAL { HsOverLit (mkHsFractional $1) } @@ -1049,6 +1032,30 @@ aexp2 :: { RdrNameHsExpr } | '(' infixexp qop ')' { (SectionL $2 (HsVar $3)) } | '(' qopm infixexp ')' { (SectionR $2 $3) } | '_' { EWildPat } + + -- MetaHaskell Extension + | srcloc ID_SPLICE { mkHsSplice (HsVar (mkUnqual varName $2)) $1 } -- $x + | srcloc '$(' exp ')' { mkHsSplice $3 $1 } -- $( exp ) + | srcloc '[|' exp '|]' { HsBracket (ExpBr $3) $1 } + | srcloc '[t|' ctype '|]' { HsBracket (TypBr $3) $1 } + | srcloc '[p|' infixexp '|]' {% checkPattern $1 $3 `thenP` \p -> + returnP (HsBracket (PatBr p) $1) } + | srcloc '[d|' cvtopbody '|]' { HsBracket (DecBr (mkGroup $3)) $1 } + + -- arrow notation extension + | srcloc '(|' aexp2 cmdargs '|)' + { HsArrForm $3 Nothing (reverse $4) $1 } + +cmdargs :: { [RdrNameHsCmdTop] } + : cmdargs acmd { $2 : $1 } + | {- empty -} { [] } + +acmd :: { RdrNameHsCmdTop } + : aexp2 { HsCmdTop $1 [] placeHolderType undefined } + +cvtopbody :: { [RdrNameHsDecl] } + : '{' cvtopdecls '}' { $2 } + | layout_on cvtopdecls close { $2 } texps :: { [RdrNameHsExpr] } : texps ',' exp { $3 : $1 } @@ -1068,13 +1075,9 @@ list :: { RdrNameHsExpr } | exp ',' exp '..' { ArithSeqIn (FromThen $1 $3) } | exp '..' exp { ArithSeqIn (FromTo $1 $3) } | exp ',' exp '..' exp { ArithSeqIn (FromThenTo $1 $3 $5) } - | exp srcloc pquals {% let { body [qs] = qs; - body qss = [ParStmt (map reverse qss)] } - in - returnP ( HsDo ListComp - (reverse (ResultStmt $1 $2 : body $3)) - $2 - ) + | exp srcloc pquals { mkHsDo ListComp + (reverse (ResultStmt $1 $2 : $3)) + $2 } lexps :: { [RdrNameHsExpr] } @@ -1084,13 +1087,22 @@ lexps :: { [RdrNameHsExpr] } ----------------------------------------------------------------------------- -- List Comprehensions -pquals :: { [[RdrNameStmt]] } - : pquals '|' quals { $3 : $1 } +pquals :: { [RdrNameStmt] } -- Either a singleton ParStmt, or a reversed list of Stmts + : pquals1 { case $1 of + [qs] -> qs + qss -> [ParStmt stmtss] + where + stmtss = [ (reverse qs, undefined) + | qs <- qss ] + } + +pquals1 :: { [[RdrNameStmt]] } + : pquals1 '|' quals { $3 : $1 } | '|' quals { [$2] } quals :: { [RdrNameStmt] } - : quals ',' stmt { $3 : $1 } - | stmt { [$1] } + : quals ',' qual { $3 : $1 } + | qual { [$1] } ----------------------------------------------------------------------------- -- Parallel array expressions @@ -1107,15 +1119,8 @@ parr :: { RdrNameHsExpr } (reverse $1) } | exp '..' exp { PArrSeqIn (FromTo $1 $3) } | exp ',' exp '..' exp { PArrSeqIn (FromThenTo $1 $3 $5) } - | exp srcloc pquals {% let { - body [qs] = qs; - body qss = [ParStmt - (map reverse qss)]} - in - returnP $ - HsDo PArrComp - (reverse (ResultStmt $1 $2 - : body $3)) + | exp srcloc pquals { mkHsDo PArrComp + (reverse (ResultStmt $1 $2 : $3)) $2 } @@ -1182,10 +1187,16 @@ maybe_stmt :: { Maybe RdrNameStmt } | {- nothing -} { Nothing } stmt :: { RdrNameStmt } + : qual { $1 } + | srcloc infixexp '->' exp {% checkPattern $1 $4 `thenP` \p -> + returnP (BindStmt p $2 $1) } + | srcloc 'rec' stmtlist { RecStmt $3 undefined undefined undefined } + +qual :: { RdrNameStmt } : srcloc infixexp '<-' exp {% checkPattern $1 $2 `thenP` \p -> returnP (BindStmt p $4 $1) } | srcloc exp { ExprStmt $2 placeHolderType $1 } - | srcloc 'let' declbinds { LetStmt $3 } + | srcloc 'let' binds { LetStmt $3 } ----------------------------------------------------------------------------- -- Record Field Update/Construction @@ -1196,8 +1207,8 @@ fbinds :: { RdrNameHsRecordBinds } | fbind { [$1] } | {- empty -} { [] } -fbind :: { (RdrName, RdrNameHsExpr, Bool) } - : qvar '=' exp { ($1,$3,False) } +fbind :: { (RdrName, RdrNameHsExpr) } + : qvar '=' exp { ($1,$3) } ----------------------------------------------------------------------------- -- Implicit Parameter Bindings @@ -1231,22 +1242,16 @@ deprec_var :: { RdrName } deprec_var : var { $1 } | tycon { $1 } -gtycon :: { RdrName } - : qtycon { $1 } - | '(' qtyconop ')' { $2 } - | '(' ')' { unitTyCon_RDR } - | '(' '->' ')' { funTyCon_RDR } - | '[' ']' { listTyCon_RDR } - | '[:' ':]' { parrTyCon_RDR } - | '(' commas ')' { tupleTyCon_RDR $2 } - gcon :: { RdrName } -- Data constructor namespace - : '(' ')' { unitCon_RDR } - | '[' ']' { nilCon_RDR } - | '(' commas ')' { tupleCon_RDR $2 } + : sysdcon { nameRdrName (dataConName $1) } | qcon { $1 } -- the case of '[:' ':]' is part of the production `parr' +sysdcon :: { DataCon } -- Wired in data constructors + : '(' ')' { unitDataCon } + | '(' commas ')' { tupleCon Boxed $2 } + | '[' ']' { nilDataCon } + var :: { RdrName } : varid { $1 } | '(' varsym ')' { $2 } @@ -1290,22 +1295,39 @@ qconop :: { RdrName } ----------------------------------------------------------------------------- -- Type constructors -tycon :: { RdrName } -- Unqualified - : CONID { mkUnqual tcClsName $1 } +gtycon :: { RdrName } -- A "general" qualified tycon + : oqtycon { $1 } + | '(' ')' { getRdrName unitTyCon } + | '(' commas ')' { getRdrName (tupleTyCon Boxed $2) } + | '(' '->' ')' { nameRdrName funTyConName } + | '[' ']' { nameRdrName listTyConName } + | '[:' ':]' { nameRdrName parrTyConName } + +oqtycon :: { RdrName } -- An "ordinary" qualified tycon + : qtycon { $1 } + | '(' qtyconsym ')' { $2 } + +qtyconop :: { RdrName } -- Qualified or unqualified + : qtyconsym { $1 } + | '`' qtycon '`' { $2 } tyconop :: { RdrName } -- Unqualified - : CONSYM { mkUnqual tcClsName $1 } - | '`' tyvar '`' { $2 } - | '`' tycon '`' { $2 } + : tyconsym { $1 } + | '`' tycon '`' { $2 } qtycon :: { RdrName } -- Qualified or unqualified - : QCONID { mkQual tcClsName $1 } - | tycon { $1 } + : QCONID { mkQual tcClsName $1 } + | tycon { $1 } -qtyconop :: { RdrName } -- Qualified or unqualified - : QCONSYM { mkQual tcClsName $1 } - | '`' QCONID '`' { mkQual tcClsName $2 } - | tyconop { $1 } +tycon :: { RdrName } -- Unqualified + : CONID { mkUnqual tcClsName $1 } + +qtyconsym :: { RdrName } + : QCONSYM { mkQual tcClsName $1 } + | tyconsym { $1 } + +tyconsym :: { RdrName } + : CONSYM { mkUnqual tcClsName $1 } ----------------------------------------------------------------------------- -- Any operator @@ -1407,6 +1429,10 @@ qconsym :: { RdrName } -- Qualified or unqualified consym :: { RdrName } : CONSYM { mkUnqual dataName $1 } + -- ':' means only list cons + | ':' { nameRdrName consDataConName } + -- NB: SrcName because we are reading source + ----------------------------------------------------------------------------- -- Literals