1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
|
-- contains modified Haskell source code copied from Text.Parsec.Token, see below
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE PatternSynonyms #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# OPTIONS_GHC -fno-warn-orphans #-} -- instance NFData SourcePos
{-# OPTIONS -fno-warn-unused-do-bind -fno-warn-name-shadowing #-}
module LambdaCube.Compiler.Lexer where
import Data.Monoid
import Data.Maybe
import Data.List
import Data.Char
import qualified Data.Set as Set
import qualified Data.Map as Map
import Control.Monad.Except
import Control.Monad.Reader
import Control.Monad.Writer
import Control.Arrow hiding ((<+>))
import Control.Applicative
import Control.DeepSeq
import Text.Parsec hiding ((<|>), many)
import Text.Parsec.Indentation as Pa
import Text.Parsec.Indentation.Char
import LambdaCube.Compiler.Pretty hiding (Doc, braces, parens)
-------------------------------------------------------------------------------- parser utils
-- see http://blog.ezyang.com/2014/05/parsec-try-a-or-b-considered-harmful/comment-page-1/#comment-6602
try_ s m = try m <?> s
manyNM a b _ | b < a || b < 0 || a < 0 = mzero
manyNM 0 0 _ = pure []
manyNM 0 n p = option [] $ (:) <$> p <*> manyNM 0 (n-1) p
manyNM k n p = (:) <$> p <*> manyNM (k-1) (n-1) p
-------------------------------------------------------------------------------- parser type
type P = ParsecT (IndentStream (CharIndentStream String)) SourcePos InnerP
type InnerP = WriterT [PostponedCheck] (Reader (DesugarInfo, Namespace))
type PostponedCheck = Maybe String
type DesugarInfo = (FixityMap, ConsMap)
type ConsMap = Map.Map SName{-constructor name-}
(Either ((SName{-type name-}, Int{-num of indices-}), [(SName, Int)]{-constructors with arities-})
Int{-arity-})
dsInfo :: P DesugarInfo
dsInfo = asks fst
namespace :: P Namespace
namespace = asks snd
-------------------------------------------------------------------------------- literals
data Lit
= LInt Integer
| LChar Char
| LFloat Double
| LString String
deriving (Eq)
instance Show Lit where
show = \case
LFloat x -> show x
LString x -> show x
LInt x -> show x
LChar x -> show x
-------------------------------------------------------------------------------- names
type SName = String
caseName (c:cs) = toLower c: cs ++ "Case"
pattern MatchName cs <- (getMatchName -> Just cs) where MatchName = matchName
matchName cs = "match" ++ cs
getMatchName ('m':'a':'t':'c':'h':cs) = Just cs
getMatchName _ = Nothing
-------------------------------------------------------------------------------- source infos
instance NFData SourcePos where
rnf x = x `seq` ()
data Range = Range SourcePos SourcePos
deriving (Eq, Ord)
instance NFData Range where
rnf (Range a b) = rnf a `seq` rnf b `seq` ()
instance PShow Range where
pShowPrec _ (Range b e) | sourceName b == sourceName e = text (sourceName b) <+> f b <> "-" <> f e
where
f x = pShow (sourceLine x) <> ":" <> pShow (sourceColumn x)
joinRange :: Range -> Range -> Range
joinRange (Range b e) (Range b' e') = Range (min b b') (max e e')
data SI
= NoSI (Set.Set String) -- no source info, attached debug info
| RangeSI Range
instance Show SI where show _ = "SI"
instance Eq SI where _ == _ = True
instance Ord SI where _ `compare` _ = EQ
instance Monoid SI where
mempty = NoSI Set.empty
mappend (RangeSI r1) (RangeSI r2) = RangeSI (joinRange r1 r2)
mappend (NoSI ds1) (NoSI ds2) = NoSI (ds1 `Set.union` ds2)
mappend r@RangeSI{} _ = r
mappend _ r@RangeSI{} = r
instance PShow SI where
pShowPrec _ (NoSI ds) = hsep $ map pShow $ Set.toList ds
pShowPrec _ (RangeSI r) = pShow r
showSI_ _ (NoSI ds) = unwords $ Set.toList ds
showSI_ source (RangeSI (Range s e)) = show str
where
startLine = sourceLine s - 1
endline = sourceLine e - if sourceColumn e == 1 then 1 else 0
len = endline - startLine
str = vcat $ text (show s <> ":"){- <+> "-" <+> text (show e)-}:
map text (take len $ drop startLine $ lines source)
++ [text $ replicate (sourceColumn s - 1) ' ' ++ replicate (sourceColumn e - sourceColumn s) '^' | len == 1]
showSourcePosSI (NoSI ds) = unwords $ Set.toList ds
showSourcePosSI (RangeSI (Range s _)) = show s
-- TODO: remove
validSI RangeSI{} = True
validSI _ = False
debugSI a = NoSI (Set.singleton a)
si@(RangeSI r) `validate` xs | all validSI xs && r `notElem` [r | RangeSI r <- xs] = si
_ `validate` _ = mempty
sourceNameSI (RangeSI (Range a _)) = sourceName a
sameSource r@(RangeSI {}) q@(RangeSI {}) = sourceNameSI r == sourceNameSI q
sameSource _ _ = True
class SourceInfo si where
sourceInfo :: si -> SI
instance SourceInfo SI where
sourceInfo = id
instance SourceInfo si => SourceInfo [si] where
sourceInfo = foldMap sourceInfo
class SetSourceInfo a where
setSI :: SI -> a -> a
appRange :: P (SI -> a) -> P a
appRange p = (\p1 a p2 -> a $ RangeSI $ Range p1 p2) <$> getPosition <*> p <*> getState
withRange :: (SI -> a -> b) -> P a -> P b
withRange f p = appRange $ flip f <$> p
infix 9 `withRange`
type SIName = (SI, SName)
parseSIName :: P String -> P SIName
parseSIName = withRange (,)
-------------------------------------------------------------------------------- namespace handling
data Level = TypeLevel | ExpLevel
deriving (Eq, Show)
data Namespace = Namespace
{ namespaceLevel :: Maybe Level
, constructorNamespace :: Bool -- True means that the case of the first letter of identifiers matters
}
deriving (Show)
tick = (\case TypeLevel -> switchTick; _ -> id) . fromMaybe ExpLevel . namespaceLevel
tick' c = (`tick` c) <$> namespace
switchTick ('\'': n) = n
switchTick n = '\'': n
modifyLevel f = local $ second $ \(Namespace l p) -> Namespace (f <$> l) p
typeNS, expNS, switchNS :: P a -> P a
typeNS = modifyLevel $ const TypeLevel
expNS = modifyLevel $ const ExpLevel
switchNS = modifyLevel $ \case ExpLevel -> TypeLevel; TypeLevel -> ExpLevel
ifNoCNamespace p = namespace >>= \ns -> if constructorNamespace ns then mzero else p
-------------------------------------------------------------------------------- identifiers
lcIdentStart = satisfy $ \c -> isLower c || c == '_'
identStart = satisfy $ \c -> isLetter c || c == '_'
identLetter = satisfy $ \c -> isAlphaNum c || c == '_' || c == '\'' || c == '#'
lowercaseOpLetter = oneOf "!#$%&*+./<=>?@\\^|-~"
opLetter = oneOf ":!#$%&*+./<=>?@\\^|-~"
maybeStartWith p i = i <|> (:) <$> satisfy p <*> i
lowerLetter = lcIdentStart <|> ifNoCNamespace identStart
upperLetter = satisfy isUpper <|> ifNoCNamespace identStart
upperCase, lowerCase, symbols, colonSymbols, backquotedIdent :: P SName
upperCase = identifier (tick' =<< maybeStartWith (=='\'') ((:) <$> upperLetter <*> many identLetter)) <?> "uppercase ident"
lowerCase = identifier ((:) <$> lowerLetter <*> many identLetter) <?> "lowercase ident"
backquotedIdent = identifier ((:) <$ char '`' <*> identStart <*> many identLetter <* char '`') <?> "backquoted ident"
symbols = operator (some opLetter) <?> "symbols"
lcSymbols = operator ((:) <$> lowercaseOpLetter <*> many opLetter) <?> "symbols"
colonSymbols = operator ((:) <$> satisfy (== ':') <*> many opLetter) <?> "op symbols"
patVar = f <$> lowerCase where
f "_" = ""
f x = x
lhsOperator = lcSymbols <|> backquotedIdent
rhsOperator = symbols <|> backquotedIdent
varId = lowerCase <|> parens rhsOperator
upperLower = lowerCase <|> upperCase <|> parens rhsOperator
moduleName = {-qualified_ todo-} expNS upperCase
--qIdent = {-qualified_ todo-} (lowerCase <|> upperCase)
{-
qualified_ id = do
q <- try_ "qualification" $ upperCase' <* dot
(N t qs n i) <- qualified_ id
return $ N t (q:qs) n i
<|>
id
where
upperCase' = (:) <$> satisfy isUpper <*> many (satisfy isAlphaNum)
-}
-------------------------------------------------------------------------------- fixity handling
data FixityDef = Infix | InfixL | InfixR deriving (Show)
type Fixity = (FixityDef, Int)
type MFixity = Maybe Fixity
type FixityMap = Map.Map SName Fixity
calcPrec
:: (Show e, Show f)
=> (f -> e -> e -> e)
-> (f -> Fixity)
-> e
-> [(f, e)]
-> e
calcPrec app getFixity e = compileOps [((Infix, -1000), error "calcPrec", e)]
where
compileOps [(_, _, e)] [] = e
compileOps acc [] = compileOps (shrink acc) []
compileOps acc@((p, g, e1): ee) es_@((op, e'): es) = case compareFixity (pr, op) (p, g) of
Right GT -> compileOps ((pr, op, e'): acc) es
Right LT -> compileOps (shrink acc) es_
Left err -> error err
where
pr = getFixity op
shrink ((_, op, e): (pr, op', e'): es) = (pr, op', app op e' e): es
compareFixity ((dir, i), op) ((dir', i'), op')
| i > i' = Right GT
| i < i' = Right LT
| otherwise = case (dir, dir') of
(InfixL, InfixL) -> Right LT
(InfixR, InfixR) -> Right GT
_ -> Left $ "fixity error:" ++ show (op, op')
parseFixityDecl :: P [(SIName, Fixity)]
parseFixityDecl = do
dir <- Infix <$ reserved "infix"
<|> InfixL <$ reserved "infixl"
<|> InfixR <$ reserved "infixr"
localIndentation Gt $ do
LInt n <- parseLit
let i = fromIntegral n
ns <- commaSep1 (parseSIName rhsOperator)
return $ (,) <$> ns <*> pure (dir, i)
getFixity :: DesugarInfo -> SName -> Fixity
getFixity (fm, _) n = fromMaybe (InfixL, 9) $ Map.lookup n fm
----------------------------------------------------------------------
----------------------------------------------------------------------
-- modified version of
--
-- Module : Text.Parsec.Token
-- Copyright : (c) Daan Leijen 1999-2001, (c) Paolo Martini 2007
-- License : BSD-style
-----------------------------------------------------------
-- Bracketing
-----------------------------------------------------------
parens p = between (symbol "(") (symbol ")") p
braces p = between (symbol "{") (symbol "}") p
angles p = between (symbol "<") (symbol ">") p
brackets p = between (symbol "[") (symbol "]") p
commaSep p = sepBy p $ symbol ","
commaSep1 p = sepBy1 p $ symbol ","
-----------------------------------------------------------
parseLit = lexeme $ charLiteral <|> stringLiteral <|> natFloat
where
-----------------------------------------------------------
-- Chars & Strings
-----------------------------------------------------------
charLiteral = LChar <$> between (char '\'')
(char '\'' <?> "end of character")
characterChar
<?> "character"
characterChar = charLetter <|> charEscape
<?> "literal character"
charEscape = do{ char '\\'; escapeCode }
charLetter = satisfy (\c -> (c /= '\'') && (c /= '\\') && (c > '\026'))
stringLiteral = LString <$>
do{ str <- between (char '"')
(localTokenMode (const Pa.Any) (char '"' <?> "end of string"))
(localTokenMode (const Pa.Any) (many stringChar))
; return (foldr (maybe id (:)) "" str)
}
<?> "literal string"
stringChar = do{ c <- stringLetter; return (Just c) }
<|> stringEscape
<?> "string character"
stringLetter = satisfy (\c -> (c /= '"') && (c /= '\\') && (c > '\026'))
stringEscape = do{ char '\\'
; do{ escapeGap ; return Nothing }
<|> do{ escapeEmpty; return Nothing }
<|> do{ esc <- escapeCode; return (Just esc) }
}
escapeEmpty = char '&'
escapeGap = do{ many1 space
; char '\\' <?> "end of string gap"
}
-- escape codes
escapeCode = charEsc <|> charNum <|> charAscii <|> charControl
<?> "escape code"
charControl = do{ char '^'
; code <- upper
; return (toEnum (fromEnum code - fromEnum 'A'))
}
charNum = do{ code <- decimal
<|> do{ char 'o'; number 8 octDigit }
<|> do{ char 'x'; number 16 hexDigit }
; return (toEnum (fromInteger code))
}
charEsc = choice (map parseEsc escMap)
where
parseEsc (c,code) = do{ char c; return code }
charAscii = choice (map parseAscii asciiMap)
where
parseAscii (asc,code) = try (do{ string asc; return code })
-- escape code tables
escMap = zip ("abfnrtv\\\"\'") ("\a\b\f\n\r\t\v\\\"\'")
asciiMap = zip (ascii3codes ++ ascii2codes) (ascii3 ++ ascii2)
ascii2codes = ["BS","HT","LF","VT","FF","CR","SO","SI","EM",
"FS","GS","RS","US","SP"]
ascii3codes = ["NUL","SOH","STX","ETX","EOT","ENQ","ACK","BEL",
"DLE","DC1","DC2","DC3","DC4","NAK","SYN","ETB",
"CAN","SUB","ESC","DEL"]
ascii2 = ['\BS','\HT','\LF','\VT','\FF','\CR','\SO','\SI',
'\EM','\FS','\GS','\RS','\US','\SP']
ascii3 = ['\NUL','\SOH','\STX','\ETX','\EOT','\ENQ','\ACK',
'\BEL','\DLE','\DC1','\DC2','\DC3','\DC4','\NAK',
'\SYN','\ETB','\CAN','\SUB','\ESC','\DEL']
-----------------------------------------------------------
-- Numbers
-----------------------------------------------------------
-- floats
natFloat = do{ char '0'
; zeroNumFloat
}
<|> decimalFloat
zeroNumFloat = do{ n <- hexadecimal <|> octal
; return (LInt n)
}
<|> decimalFloat
<|> fractFloat 0
<|> return (LInt 0)
decimalFloat = do{ n <- decimal
; option (LInt n)
(fractFloat n)
}
fractFloat n = do{ f <- fractExponent n
; return (LFloat f)
}
fractExponent n = do{ fract <- fraction
; expo <- option 1.0 exponent'
; return ((fromInteger n + fract)*expo)
}
<|>
do{ expo <- exponent'
; return ((fromInteger n)*expo)
}
fraction = do{ char '.'
; digits <- many1 digit <?> "fraction"
; return (foldr op 0.0 digits)
}
<?> "fraction"
where
op d f = (f + fromIntegral (digitToInt d))/10.0
exponent' = do{ oneOf "eE"
; f <- sign
; e <- decimal <?> "exponent"
; return (power (f e))
}
<?> "exponent"
where
power e | e < 0 = 1.0/power(-e)
| otherwise = fromInteger (10^e)
-- integers and naturals
sign = (char '-' >> return negate)
<|> (char '+' >> return id)
<|> return id
decimal = number 10 digit
hexadecimal = do{ oneOf "xX"; number 16 hexDigit }
octal = do{ oneOf "oO"; number 8 octDigit }
number base baseDigit
= do{ digits <- many1 baseDigit
; let n = foldl' (\x d -> base*x + toInteger (digitToInt d)) 0 digits
; seq n (return n)
}
-----------------------------------------------------------
-- Operators & reserved ops
-----------------------------------------------------------
reservedOp name =
lexeme $ try $
do{ string name
; notFollowedBy opLetter <?> ("end of " ++ show name)
}
operator oper =
lexeme $ try $ trCons <$> expect "reserved operator" (`Set.member` theReservedOpNames) oper
where
trCons ":" = "Cons"
trCons x = x
theReservedOpNames = Set.fromList ["::","..","=","\\","|","<-","->","@","~","=>"]
expect msg p i = i >>= \n -> if (p n) then unexpected (msg ++ " " ++ show n) else return n
-----------------------------------------------------------
-- Identifiers & Reserved words
-----------------------------------------------------------
reserved name =
lexeme $ try $
do{ string name
; notFollowedBy identLetter <?> ("end of " ++ show name)
}
identifier ident =
lexeme $ try $ expect "reserved word" (`Set.member` theReservedNames) ident
theReservedNames = Set.fromList $
["let","in","case","of","if","then","else"
,"data","type"
,"class","default","deriving","do","import"
,"infix","infixl","infixr","instance","module"
,"newtype","where"
,"primitive"
-- "as","qualified","hiding"
] ++
["foreign","import","export","primitive"
,"_ccall_","_casm_"
,"forall"
]
-----------------------------------------------------------
-- White space & symbols
-----------------------------------------------------------
lexeme p
= p <* (getPosition >>= setState >> whiteSpace)
symbol name
= lexeme (string name)
whiteSpace = ignoreAbsoluteIndentation (localTokenMode (const Pa.Any) whiteSpace')
whiteSpace' = skipMany (simpleSpace <|> oneLineComment <|> multiLineComment <?> "")
simpleSpace
= skipMany1 (satisfy isSpace)
oneLineComment
= try (string "--" >> many (char '-') >> notFollowedBy opLetter)
>> skipMany (satisfy (/= '\n'))
multiLineComment = try (string "{-") *> inCommentMulti
inCommentMulti
= try (() <$ string "-}")
<|> multiLineComment *> inCommentMulti
<|> skipMany1 (noneOf "{}-") *> inCommentMulti
<|> oneOf "{}-" *> inCommentMulti
<?> "end of comment"
|