-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathParser.hs
438 lines (368 loc) · 17.8 KB
/
Parser.hs
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
{-# LANGUAGE PackageImports, ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE GeneralizedNewtypeDeriving,FlexibleInstances #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE ViewPatterns #-}
-- A simple parser for the Frank language
module Parser where
import Control.Applicative
import Control.Monad
import Control.Monad.IO.Class
import Data.Char
import qualified Data.Map.Strict as M
import qualified Data.HashSet as HashSet
import Text.Trifecta
import Text.Trifecta.Delta
import "indentation-trifecta" Text.Trifecta.Indentation
import Text.Parser.Token as Tok
import Text.Parser.Token.Style
import qualified Text.Parser.Token.Highlight as Hi
import Test.Tasty (TestTree, testGroup)
import Test.Tasty.HUnit (testCase, assertEqual, assertFailure, Assertion)
import Syntax
import ParserCommon
import Debug
import qualified Data.ByteString.Char8 as B
-- the eof disallows gibberish at the end of the file!
prog :: (Applicative m, MonadicParsing m) => m (Prog Raw)
prog = MkProg <$ whiteSpace <*> do tts <- many tterm; eof; return tts
tterm :: MonadicParsing m => m (TopTm Raw)
tterm = do attachLoc $ (DataTm <$> parseDataT <|>
SigTm <$> try parseMHSig <|>
ClsTm <$> parseMHCls <|>
ItfTm <$> try parseItf <|>
ItfAliasTm <$> parseItfAlias)
parseTyVar :: MonadicParsing m => m (Id, Kind)
parseTyVar = (\x -> (x, ET)) <$> brackets parseEVar <|>
(\x -> (x, VT)) <$> identifier
parseDataT :: MonadicParsing m => m (DataT Raw)
parseDataT = attachLoc $ do reserved "data"
name <- identifier
ps <- many parseTyVar
symbol "="
cs <- localIndentation Gt ctrlist
return $ DT name ps cs
parseEVar :: MonadicParsing m => m Id
parseEVar = do mx <- optional identifier
case mx of
Nothing -> return "£"
Just x -> return x
ctrlist :: MonadicParsing m => m [Ctr Raw]
ctrlist = sepBy parseCtr (symbol "|")
parseCtr :: MonadicParsing m => m (Ctr Raw)
parseCtr = attachLoc $ do name <- identifier
args <- many parseVType'
return $ Ctr name args
parseMHSig :: MonadicParsing m => m (MHSig Raw)
parseMHSig = attachLoc $ do name <- identifier
symbol ":"
ty <- parseSigType
return (Sig name ty)
-- As the outer braces are optional in top-level signatures we require
-- that plain pegs must have explicit ability brackets.
--
-- The following collections of signatures are equivalent:
--
-- f : {A -> B -> C} and f : A -> B -> C
-- x : {Int} and x : {[]Int} and x : []Int
--
-- A signature of the form
--
-- x : Int
--
-- is not currently valid. Once we add support for top level values it
-- will become valid, but will not mean the same thing as:
--
-- x : []Int
parseSigType :: MonadicParsing m => m (CType Raw)
parseSigType = (do loc <- getLocation
symbol "{"
ct <- parseCType
symbol "}"
rest <- optional (symbol "->" *> parseCType)
return $
case rest of
Nothing -> ct
Just (CType ports peg a) ->
CType ((Port idAdjRaw (SCTy ct a) a) : ports) peg a) <|>
attachLoc (do ports <- some (try (parsePort <* symbol "->"))
peg <- parsePeg
return $ CType ports peg) <|>
attachLoc (do peg <- parsePegExplicit
return $ CType [] peg)
parseMHCls :: MonadicParsing m => m (MHCls Raw)
parseMHCls = attachProvideLoc $ \a -> do
name <- identifier
ps <- choice [some parsePattern, symbol "!" >> return []]
symbol "="
seq <- localIndentation Gt parseRawTmSeq
return $ MHCls name (Cls ps seq a) a
parseItf :: MonadicParsing m => m (Itf Raw)
parseItf = attachLoc $ do reserved "interface"
name <- identifier
ps <- many parseTyVar
symbol "="
xs <- localIndentation Gt $ sepBy1 parseCmd (symbol "|")
return (Itf name ps xs)
parseCmd :: MonadicParsing m => m (Cmd Raw)
parseCmd = attachLoc $ do cmd <- identifier
ps <- many parseTyVar -- polymorphic commands
symbol ":"
(xs,y) <- parseCmdType
return (Cmd cmd ps xs y)
-- type vars, input types, output type
parseCmdType :: MonadicParsing m => m ([VType Raw], VType Raw)
parseCmdType = do vs <- sepBy1 parseVType (symbol "->")
if length vs == 1 then return ([],head vs)
else return (init vs, last vs)
parseItfAlias :: MonadicParsing m => m (ItfAlias Raw)
parseItfAlias = attachLoc $ do reserved "interface"
name <- identifier
ps <- many parseTyVar
symbol "="
a <- getLocation
symbol "["
xs <- parseItfInstances
symbol "]"
return $ ItfAlias name ps (ItfMap (M.fromList xs) a)
parseCType :: MonadicParsing m => m (CType Raw)
parseCType = attachLoc $ do ports <- many (try (parsePort <* symbol "->"))
peg <- parsePeg
return $ CType ports peg
parsePort :: MonadicParsing m => m (Port Raw)
parsePort = attachLoc $ do adj <- parseAdj
ty <- parseVType
return $ Port adj ty
parsePeg :: MonadicParsing m => m (Peg Raw)
parsePeg = attachLoc $ do ab <- parseAb
ty <- parseVType
return $ Peg ab ty
parsePegExplicit :: MonadicParsing m => m (Peg Raw)
parsePegExplicit = attachLoc $ do ab <- brackets parseAbBody
ty <- parseVType
return $ Peg ab ty
parseAdj :: MonadicParsing m => m (Adj Raw)
parseAdj = attachProvideLoc $ \a -> do
mxs <- optional $ angles (sepBy parseAdj' (symbol ","))
case mxs of
Nothing -> return $ Adj (ItfMap M.empty a) a
Just xs -> return $ Adj (ItfMap (M.fromList xs) a) a
parseAdj' :: MonadicParsing m => m (Id, [TyArg Raw])
parseAdj' = do x <- identifier
ts <- many parseTyArg
return (x, ts)
parseDTAb :: MonadicParsing m => m (Ab Raw)
parseDTAb = brackets parseAbBody
parseItfInstances :: MonadicParsing m => m [(Id, [TyArg Raw])]
parseItfInstances = sepBy parseItfInstance (symbol ",")
-- 0 | 0|Interfaces | E|Interfaces | Interfaces
parseAbBody :: MonadicParsing m => m (Ab Raw)
parseAbBody = attachProvideLoc $ \a ->
-- closed ability: [0] or [0 | i_1, ... i_n]
(do symbol "0"
xs <- option [] (symbol "|" *> parseItfInstances)
return $ Ab (EmpAb a) (ItfMap (M.fromList xs) a) a) <|>
-- open ability: [i_1, ..., i_n] (implicitly e := £) or [e | i_1, ..., i_n]
(do e <- option (AbVar "£" a) (try $ AbVar <$> identifier <* symbol "|" <*> pure a)
xs <- parseItfInstances
return $ Ab e (ItfMap (M.fromList xs) a) a)
parseAb :: MonadicParsing m => m (Ab Raw)
parseAb = do mxs <- optional $ brackets parseAbBody
case mxs of
Nothing -> attachProvideLoc $ \a ->
return $ Ab (AbVar "£" a) (ItfMap M.empty a) a
Just ab -> return ab
parseItfInstance :: MonadicParsing m => m (Id, [TyArg Raw])
parseItfInstance = do x <- identifier
ts <- many parseTyArg
return (x, ts)
-- This parser gives higher precedence to MkDTTy when coming across "X"
-- E.g., the type "X" becomes MkDTTy "X" [] (instead of MkTVar "X")
parseVType :: MonadicParsing m => m (VType Raw)
parseVType = try parseDTType <|> -- could possibly also be a MKTvar (determined
-- during refinement)
parseVType'
-- This parser gives higher precedence to MkTVar when coming across "X"
-- E.g., the type "X" becomes MkTVar "X" (instead of MkDTTy "X" [])
-- By writing "(X)" one can escape back to parseVType
parseVType' :: MonadicParsing m => m (VType Raw)
parseVType' = parens parseVType <|>
(attachLoc $ SCTy <$> try (braces parseCType)) <|>
(attachLoc $ StringTy <$ reserved "String") <|>
(attachLoc $ IntTy <$ reserved "Int") <|>
(attachLoc $ CharTy <$ reserved "Char") <|>
(attachLoc $ TVar <$> identifier) -- could possibly also be a MkDTTy
-- (determined during refinement)
parseTyArg :: MonadicParsing m => m (TyArg Raw)
parseTyArg = attachLoc $ VArg <$> parseVType' <|>
EArg <$> parseDTAb
-- Parse a potential datatype. Note it may actually be a type variable.
parseDTType :: MonadicParsing m => m (VType Raw)
parseDTType = attachLoc $ do x <- identifier
args <- localIndentation Gt $ many parseTyArg
return $ DTTy x args
parseRawTmSeq :: MonadicParsing m => m (Tm Raw)
parseRawTmSeq = do loc <- getLocation
tm1 <- parseRawTm
m <- optional $ symbol ";"
case m of
Just _ -> do tm2 <- parseRawTmSeq
return $ TmSeq tm1 tm2 loc
Nothing -> return tm1
-- parse term of 1st syntactic category
parseRawTm :: MonadicParsing m => m (Tm Raw)
parseRawTm = parseLet <|>
try parseRawOpTm <|>
parseRawTm'
-- parse term of 2nd syntactic category
-- parse binary operation or term comb t_1 ... t_n
parseRawOpTm :: (MonadicParsing m) => m (Tm Raw)
parseRawOpTm = do loc <- getLocation
uminus <- optional $ symbol "-"
t1 <- parseRawOperandTm
let t1' = case uminus of
Just _ -> Use (RawComb (RawId "-" loc) [IntTm 0 loc, t1] loc) loc
Nothing -> t1
(do binOp <- parseBinOp
t2 <- parseRawOperandTm
return $ Use (RawComb binOp [t1',t2] loc) loc
<|> (return t1'))
parseRawOperandTm :: MonadicParsing m => m (Tm Raw)
parseRawOperandTm = (attachLoc $ Use <$> try parseComb) <|>
parens parseRawOpTm <|>
(attachLoc $ Use <$> parseId) <|>
(attachLoc $ IntTm <$> natural)
parseBinOp :: MonadicParsing m => m (Use Raw)
parseBinOp = attachLoc $ do op <- choice $ map symbol ["+","-","*","/","::"]
let op' = if op == "::" then "cons" else op
return $ RawId op'
parseId :: MonadicParsing m => m (Use Raw)
parseId = attachLoc $ do x <- identifier
return $ RawId x
parseNullaryComb :: MonadicParsing m => m (Use Raw)
parseNullaryComb = attachLoc $ do x <- choice [parseId, parens parseComb]
symbol "!"
return $ RawComb x []
parseLet :: MonadicParsing m => m (Tm Raw)
parseLet = attachLoc $ do reserved "let"
x <- identifier
symbol "="
tm1 <- parseRawTm
reserved "in"
tm2 <- parseRawTmSeq
return $ Let x tm1 tm2
-- parse any term except let-expression or binary operation
parseRawTm' :: MonadicParsing m => m (Tm Raw)
parseRawTm' = (attachLoc $ Use <$> try parseNullaryComb) <|> -- x!
parens parseRawTmSeq <|> -- t_1 ; ... ; t_n
(attachLoc $ Use <$> parseId) <|> -- x
(attachLoc $ SC <$> parseRawSComp) <|> -- { p_1 -> t_1 | ...
(attachLoc $ StrTm <$> stringLiteral) <|> -- "string"
(attachLoc $ IntTm <$> natural) <|> -- 42
(attachLoc $ CharTm <$> charLiteral) <|> -- 'c'
(attachLoc $ ListTm <$> listTm) -- [t_1, ..., t_n]
listTm :: MonadicParsing m => m [Tm Raw] -- [t_1, ..., t_n]
listTm = brackets (sepBy parseRawTm (symbol ","))
parseComb :: MonadicParsing m => m (Use Raw)
parseComb = attachLoc $ do x <- choice [parseId, parens parseComb]
args <- choice [some parseRawTm', symbol "!" >> pure []]
return $ RawComb x args
parseRawClause :: MonadicParsing m => m (Clause Raw)
parseRawClause = attachLoc $ do ps <- choice [try parsePatterns, pure []]
seq <- parseRawTmSeq
return $ Cls ps seq
where parsePatterns =
do ps <- choice [some parsePattern, symbol "!" >> return []]
symbol "->"
return $ ps
parsePattern :: MonadicParsing m => m (Pattern Raw)
parsePattern = try parseCPat <|> (attachLoc $ VPat <$> parseVPat)
parseCPat :: MonadicParsing m => m (Pattern Raw)
parseCPat = between (symbol "<") (symbol ">") $
try parseCmdPat <|> parseThunkPat
parseThunkPat :: MonadicParsing m => m (Pattern Raw)
parseThunkPat = attachLoc $ do x <- identifier
return (ThkPat x)
parseCmdPat :: MonadicParsing m => m (Pattern Raw)
parseCmdPat = attachLoc $ do cmd <- identifier
ps <- many parseVPat
symbol "->"
g <- identifier
return (CmdPat cmd ps g)
parseVPat :: MonadicParsing m => m (ValuePat Raw)
parseVPat = parseDataTPat <|>
(attachLoc $ (do x <- identifier
return $ VarPat x)) <|>
(attachLoc $ (IntPat <$> try integer)) <|> -- try block for unary minus
(attachLoc $ (CharPat <$> charLiteral)) <|>
(attachLoc $ (StrPat <$> stringLiteral)) <|>
(attachLoc $ (ListPat <$> brackets (sepBy parseVPat (symbol ","))))
parseDataTPat :: MonadicParsing m => m (ValuePat Raw)
parseDataTPat = attachLoc $ parens $ ((try (do p <- parseVPat
symbol "::"
q <- parseVPat
return $ ConsPat p q)) <|>
(do k <- identifier
ps <- many parseVPat
return $ DataPat k ps))
parseRawSComp :: MonadicParsing m => m (SComp Raw)
parseRawSComp = attachLoc $ localIndentation Gt $ absoluteIndentation $
do cs <- braces $ sepBy parseRawClause (symbol "|")
return $ SComp cs
evalCharIndentationParserT :: Monad m => FrankParser Char m a ->
IndentationState -> m a
evalCharIndentationParserT = evalIndentationParserT . runFrankParser
evalTokenIndentationParserT :: Monad m => FrankParser Token m a ->
IndentationState -> m a
evalTokenIndentationParserT = evalIndentationParserT . runFrankParser
runParse ev p input
= let indA = ev p $ mkIndentationState 0 infIndentation True Ge
in case parseString indA mempty input of
Failure err -> Left (show err)
Success t -> Right t
runProgParse ev input = runParse ev prog input
runParseFromFileEx ev p fname =
let indA = ev p $ mkIndentationState 0 infIndentation True Ge in
do res <- parseFromFileEx indA fname
case res of
Failure err -> return $ Left (show err)
Success t -> return $ Right t
runProgParseFromFileEx ev fname = runParseFromFileEx ev prog fname
--runCharParseFromFile = runParseFromFileEx evalCharIndentationParserT
runTokenParseFromFile :: (MonadIO m, Applicative m, MonadicParsing m) =>
String -> m (Either String (Prog Raw))
runTokenParseFromFile = runProgParseFromFileEx evalTokenIndentationParserT
--runCharParse = runParse evalCharIndentationParserT
runTokenParse p = runParse evalTokenIndentationParserT p
runTokenProgParse = runProgParse evalTokenIndentationParserT
getLocation :: (MonadicParsing m) => m Raw
getLocation = do r <- rend
line <- line
case delta r of
(Lines l c _ _) -> return $ Raw $ InCode (fromIntegral l + 1, fromIntegral c + 1)
_ -> return $ Raw $ InCode (-2, -2) -- TODO: LC: fix this after understanding
-- what the different Delta cases really mean
attachLoc :: (MonadicParsing m) => (m (Raw -> AnnotFix f Raw)) -> m (AnnotFix f Raw)
attachLoc parser = do a <- getLocation
parser <*> pure a
attachProvideLoc :: (MonadicParsing m) => (Raw -> m (AnnotFix f Raw)) -> m (AnnotFix f Raw)
attachProvideLoc parser = do a <- getLocation
parser a
-- Tests
input = [ "tests/evalState.fk"
, "tests/listMap.fk"
, "tests/suspended_computations.fk"
, "tests/fib.fk"
, "tests/paper.fk"]
--outputc = map runCharParseFromFile input
--outputt = map runTokenParseFromFile input
assertParsedOk :: (Show err, Show a, Eq a) => IO (Either err a) -> IO a
-> Assertion
assertParsedOk actual expected =
do x <- actual
case x of
Right ok -> do y <- expected
assertEqual "parsing succeeded, but " y ok
Left err -> do y <- expected
assertFailure ("parse failed with " ++ show err
++ ", expected " ++ show y)