2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
4 \section[PatSyntax]{Abstract Haskell syntax---patterns}
7 #include "HsVersions.h"
13 irrefutablePat, irrefutablePats,
15 patsAreAllCons, isConPat,
16 patsAreAllLits, isLitPat,
23 import HsLit ( HsLit )
24 IMPORT_DELOOPER(HsLoop) ( HsExpr )
27 import Id ( dataConTyCon, GenId )
28 import Maybes ( maybeToBool )
29 import Name ( pprSym, pprNonSym )
30 import Outputable ( interppSP, interpp'SP, ifPprShowAll )
31 import PprStyle ( PprStyle(..) )
33 import TyCon ( maybeTyConSingleCon )
34 import PprType ( GenType )
37 Patterns come in distinct before- and after-typechecking flavo(u)rs.
40 = WildPatIn -- wild card
41 | VarPatIn name -- variable
42 | LitPatIn HsLit -- literal
43 | LazyPatIn (InPat name) -- lazy pattern
44 | AsPatIn name -- as pattern
46 | ConPatIn name -- constructed type
48 | ConOpPatIn (InPat name)
52 -- We preserve prefix negation and parenthesis for the precedence parser.
54 | NegPatIn (InPat name) -- negated pattern
55 | ParPatIn (InPat name) -- parenthesised pattern
57 | ListPatIn [InPat name] -- syntactic list
58 -- must have >= 1 elements
59 | TuplePatIn [InPat name] -- tuple
61 | RecPatIn name -- record
62 [(name, InPat name, Bool)] -- True <=> source used punning
64 data OutPat tyvar uvar id
65 = WildPat (GenType tyvar uvar) -- wild card
67 | VarPat id -- variable (type is in the Id)
69 | LazyPat (OutPat tyvar uvar id) -- lazy pattern
71 | AsPat id -- as pattern
72 (OutPat tyvar uvar id)
74 | ConPat Id -- Constructor is always an Id
75 (GenType tyvar uvar) -- the type of the pattern
76 [OutPat tyvar uvar id]
78 | ConOpPat (OutPat tyvar uvar id) -- just a special case...
80 (OutPat tyvar uvar id)
82 | ListPat -- syntactic list
83 (GenType tyvar uvar) -- the type of the elements
84 [OutPat tyvar uvar id]
86 | TuplePat [OutPat tyvar uvar id] -- tuple
87 -- UnitPat is TuplePat []
89 | RecPat Id -- record constructor
90 (GenType tyvar uvar) -- the type of the pattern
91 [(Id, OutPat tyvar uvar id, Bool)] -- True <=> source used punning
93 | LitPat -- Used for *non-overloaded* literal patterns:
94 -- Int#, Char#, Int, Char, String, etc.
96 (GenType tyvar uvar) -- type of pattern
98 | NPat -- Used for *overloaded* literal patterns
99 HsLit -- the literal is retained so that
100 -- the desugarer can readily identify
101 -- equations with identical literal-patterns
102 (GenType tyvar uvar) -- type of pattern, t
103 (HsExpr tyvar uvar id (OutPat tyvar uvar id))
104 -- of type t -> Bool; detects match
106 | DictPat -- Used when destructing Dictionaries with an explicit case
107 [id] -- superclass dicts
112 instance (Outputable name, NamedThing name) => Outputable (InPat name) where
115 pprInPat :: (Outputable name, NamedThing name) => PprStyle -> InPat name -> Pretty
117 pprInPat sty (WildPatIn) = ppStr "_"
118 pprInPat sty (VarPatIn var) = pprNonSym sty var
119 pprInPat sty (LitPatIn s) = ppr sty s
120 pprInPat sty (LazyPatIn pat) = ppBeside (ppChar '~') (ppr sty pat)
121 pprInPat sty (AsPatIn name pat)
122 = ppBesides [ppLparen, ppr sty name, ppChar '@', ppr sty pat, ppRparen]
124 pprInPat sty (ConPatIn c pats)
128 ppCat [ppr sty c, interppSP sty pats] -- ParPats put in the parens
130 pprInPat sty (ConOpPatIn pat1 op pat2)
131 = ppCat [ppr sty pat1, ppr sty op, ppr sty pat2] -- ParPats put in parens
133 -- ToDo: use pprSym to print op (but this involves fiddling various
134 -- contexts & I'm lazy...); *PatIns are *rarely* printed anyway... (WDP)
136 pprInPat sty (NegPatIn pat)
138 pp_pat = pprInPat sty pat
140 ppBeside (ppChar '-') (
146 pprInPat sty (ParPatIn pat)
147 = ppParens (pprInPat sty pat)
149 pprInPat sty (ListPatIn pats)
150 = ppBesides [ppLbrack, interpp'SP sty pats, ppRbrack]
151 pprInPat sty (TuplePatIn pats)
152 = ppParens (interpp'SP sty pats)
154 pprInPat sty (RecPatIn con rpats)
155 = ppBesides [ppr sty con, ppSP, ppChar '{', ppInterleave ppComma (map (pp_rpat sty) rpats), ppChar '}']
157 pp_rpat PprForUser (v, _, True) = ppr PprForUser v
158 pp_rpat sty (v, p, _) = ppCat [ppr sty v, ppStr "=", ppr sty p]
162 instance (Eq tyvar, Outputable tyvar, Eq uvar, Outputable uvar,
163 NamedThing id, Outputable id)
164 => Outputable (OutPat tyvar uvar id) where
169 pprOutPat sty (WildPat ty) = ppChar '_'
170 pprOutPat sty (VarPat var) = pprNonSym sty var
171 pprOutPat sty (LazyPat pat) = ppBesides [ppChar '~', ppr sty pat]
172 pprOutPat sty (AsPat name pat)
173 = ppBesides [ppLparen, ppr sty name, ppChar '@', ppr sty pat, ppRparen]
175 pprOutPat sty (ConPat name ty [])
176 = ppBeside (ppr sty name)
177 (ifPprShowAll sty (pprConPatTy sty ty))
179 pprOutPat sty (ConPat name ty pats)
180 = ppBesides [ppLparen, ppr sty name, ppSP,
181 interppSP sty pats, ppRparen,
182 ifPprShowAll sty (pprConPatTy sty ty) ]
184 pprOutPat sty (ConOpPat pat1 op pat2 ty)
185 = ppBesides [ppLparen, ppr sty pat1, ppSP, pprSym sty op, ppSP, ppr sty pat2, ppRparen]
187 pprOutPat sty (ListPat ty pats)
188 = ppBesides [ppLbrack, interpp'SP sty pats, ppRbrack]
189 pprOutPat sty (TuplePat pats)
190 = ppParens (interpp'SP sty pats)
192 pprOutPat sty (RecPat con ty rpats)
193 = ppBesides [ppr sty con, ppChar '{', ppInterleave ppComma (map (pp_rpat sty) rpats), ppChar '}']
195 pp_rpat PprForUser (v, _, True) = ppr PprForUser v
196 pp_rpat sty (v, p, _) = ppCat [ppr sty v, ppStr "=", ppr sty p]
198 pprOutPat sty (LitPat l ty) = ppr sty l -- ToDo: print more
199 pprOutPat sty (NPat l ty e) = ppr sty l -- ToDo: print more
201 pprOutPat sty (DictPat dicts methods)
202 = ppSep [ppBesides [ppLparen, ppPStr SLIT("{-dict-}")],
203 ppBracket (interpp'SP sty dicts),
204 ppBesides [ppBracket (interpp'SP sty methods), ppRparen]]
207 = ppParens (ppr sty ty)
210 %************************************************************************
212 %* predicates for checking things about pattern-lists in EquationInfo *
214 %************************************************************************
215 \subsection[Pat-list-predicates]{Look for interesting things in patterns}
217 Unlike in the Wadler chapter, where patterns are either ``variables''
218 or ``constructors,'' here we distinguish between:
221 Patterns that cannot fail to match: variables, wildcards, and lazy
224 These are the irrefutable patterns; the two other categories
225 are refutable patterns.
228 A non-literal constructor pattern (see next category).
230 \item[literal patterns:]
231 At least the numeric ones may be overloaded.
234 A pattern is in {\em exactly one} of the above three categories; `as'
235 patterns are treated specially, of course.
237 The 1.3 report defines what ``irrefutable'' and ``failure-free'' patterns are.
239 irrefutablePats :: [OutPat a b c] -> Bool
240 irrefutablePats pat_list = all irrefutablePat pat_list
242 irrefutablePat (AsPat _ pat) = irrefutablePat pat
243 irrefutablePat (WildPat _) = True
244 irrefutablePat (VarPat _) = True
245 irrefutablePat (LazyPat _) = True
246 irrefutablePat (DictPat ds ms) = (length ds + length ms) <= 1
247 irrefutablePat other = False
249 failureFreePat :: OutPat a b c -> Bool
251 failureFreePat (WildPat _) = True
252 failureFreePat (VarPat _) = True
253 failureFreePat (LazyPat _) = True
254 failureFreePat (AsPat _ pat) = failureFreePat pat
255 failureFreePat (ConPat con tys pats) = only_con con && all failureFreePat pats
256 failureFreePat (ConOpPat pat1 con pat2 _) = only_con con && failureFreePat pat1 && failureFreePat pat1
257 failureFreePat (RecPat con _ fields) = only_con con && and [ failureFreePat pat | (_,pat,_) <- fields ]
258 failureFreePat (ListPat _ _) = False
259 failureFreePat (TuplePat pats) = all failureFreePat pats
260 failureFreePat (DictPat _ _) = True
261 failureFreePat other_pat = False -- Literals, NPat
263 only_con con = maybeToBool (maybeTyConSingleCon (dataConTyCon con))
267 patsAreAllCons :: [OutPat a b c] -> Bool
268 patsAreAllCons pat_list = all isConPat pat_list
270 isConPat (AsPat _ pat) = isConPat pat
271 isConPat (ConPat _ _ _) = True
272 isConPat (ConOpPat _ _ _ _) = True
273 isConPat (ListPat _ _) = True
274 isConPat (TuplePat _) = True
275 isConPat (RecPat _ _ _) = True
276 isConPat (DictPat ds ms) = (length ds + length ms) > 1
277 isConPat other = False
279 patsAreAllLits :: [OutPat a b c] -> Bool
280 patsAreAllLits pat_list = all isLitPat pat_list
282 isLitPat (AsPat _ pat) = isLitPat pat
283 isLitPat (LitPat _ _) = True
284 isLitPat (NPat _ _ _) = True
285 isLitPat other = False
288 This function @collectPatBinders@ works with the ``collectBinders''
289 functions for @HsBinds@, etc. The order in which the binders are
290 collected is important; see @HsBinds.lhs@.
292 collectPatBinders :: InPat a -> [a]
294 collectPatBinders WildPatIn = []
295 collectPatBinders (VarPatIn var) = [var]
296 collectPatBinders (LitPatIn _) = []
297 collectPatBinders (LazyPatIn pat) = collectPatBinders pat
298 collectPatBinders (AsPatIn a pat) = a : collectPatBinders pat
299 collectPatBinders (ConPatIn c pats) = concat (map collectPatBinders pats)
300 collectPatBinders (ConOpPatIn p1 c p2)= collectPatBinders p1 ++ collectPatBinders p2
301 collectPatBinders (NegPatIn pat) = collectPatBinders pat
302 collectPatBinders (ParPatIn pat) = collectPatBinders pat
303 collectPatBinders (ListPatIn pats) = concat (map collectPatBinders pats)
304 collectPatBinders (TuplePatIn pats) = concat (map collectPatBinders pats)
305 collectPatBinders (RecPatIn c fields) = concat (map (\ (f,pat,_) -> collectPatBinders pat) fields)