summaryrefslogtreecommitdiff
path: root/compiler/parser
diff options
context:
space:
mode:
authorSimon Peyton Jones <simonpj@microsoft.com>2016-03-30 17:14:11 +0100
committerSimon Peyton Jones <simonpj@microsoft.com>2016-03-31 08:04:04 +0100
commitbdd90426a7f88d57bedf15411fa00f62aeb22172 (patch)
tree378a99bb29281b420a836cb13cfb78e65268cf57 /compiler/parser
parent2e5e8223e2fd0fe7f6082a15627dfd54e3560b06 (diff)
downloadhaskell-bdd90426a7f88d57bedf15411fa00f62aeb22172.tar.gz
Refactor in TcMatches
* Move the several calls of tauifyMultipleMatches into tcMatches, so that it can be called only once, and the invariants are clearer * I discovered in doing this that HsLamCase had a redundant and tiresome argument, so I removed it. That in turn allowed some modest but nice code simplification
Diffstat (limited to 'compiler/parser')
-rw-r--r--compiler/parser/Parser.y2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/parser/Parser.y b/compiler/parser/Parser.y
index 0b11b04a5e..497566154a 100644
--- a/compiler/parser/Parser.y
+++ b/compiler/parser/Parser.y
@@ -2151,7 +2151,7 @@ exp10 :: { LHsExpr RdrName }
(mj AnnLet $1:mj AnnIn $3
:(fst $ unLoc $2)) }
| '\\' 'lcase' altslist
- {% ams (sLL $1 $> $ HsLamCase placeHolderType
+ {% ams (sLL $1 $> $ HsLamCase
(mkMatchGroup FromSource (snd $ unLoc $3)))
(mj AnnLam $1:mj AnnCase $2:(fst $ unLoc $3)) }
| 'if' exp optSemi 'then' exp optSemi 'else' exp