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
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
|
module AST.AddSpans (apModule) where
import Char (toUpper)
import List (last)
import Maybe (fromMaybe)
import Prelude hiding (mapM)
import AST.ASM
import AST.AST as AST
import qualified AST.Ident as I
import AST.PositionUtils (moveColBy)
import AST.Span (Span, virtualSpan, isVirtualPos, start, end)
import qualified AST.SpanAST as SpanAST
import AST.Token
setMIdSpan :: Span -> AST.ModuleIdent -> I.ModuleIdent
setMIdSpan s m = let qs = midQualifiers m
in I.ModuleIdent s qs
setIdSpan :: Span -> AST.Ident -> I.Ident
setIdSpan s i = let n = AST.idName i
u = AST.idUnique i
in I.Ident s n u
setQIdSpan :: Span -> AST.QualIdent -> I.QualIdent
setQIdSpan s q = let i = AST.qidIdent q in case AST.qidModule q of
Just m -> I.QualIdent (Just (setMIdSpan s m)) (setIdSpan s i)
Nothing -> I.QualIdent Nothing (setIdSpan s i)
apModule :: AST.Module -> ASM SpanAST.Module
apModule (AST.Module ps mi mes is ds) =
mapM apPragma ps >+= \ ps' ->
maybeTokenSpan KW_module >+= \ mpm ->
(case mpm of
Nothing -> returnP (Nothing, Nothing, Nothing)
Just _ -> (\x y z -> (x,y,z))
<$> maybeOneOf (Id (moduleName mi))(QId (moduleName mi))
<*> optional apExportSpec mes
<*> maybeTokenSpan KW_where) >+= \(mpn, mes', mpw) ->
mapM apImportDecl is >+= \ is' ->
mapM apDecl ds >+= \ ds' ->
let mi' = setMIdSpan (fromMaybe virtualSpan mpn) mi
in returnP (SpanAST.Module ps' mpm mi' mpw mes' is' ds')
apPragma :: AST.ModulePragma -> ASM SpanAST.ModulePragma
apPragma (AST.LanguagePragma _ exts) =
tokenSpan PragmaLanguage >+= \ pl ->
sepBy apExtension (tokenSpan Comma) exts >+= \ (pexts, pss) ->
tokenSpan PragmaEnd >+= \ pr ->
returnP (SpanAST.LanguagePragma pl pexts pss pr)
apPragma (AST.OptionsPragma _ mt s) =
getTokenSpan >+= \ (pl, op) ->
tokenSpan PragmaEnd >+= \ pr ->
ensure ((getMbTool op) == (showMbTool mt))
(SpanAST.OptionsPragma pl (showMbTool mt) s pr)
getMbTool :: Token -> (Maybe String)
getMbTool tok = case tok of
(PragmaOptions mt _) -> case mt of
Nothing -> Nothing
Just t -> Just (map toUpper t)
_ -> error "Next token is not PragmaOptions."
showMbTool :: (Maybe Tool) -> (Maybe String)
showMbTool mt = case mt of
Nothing -> Nothing
Just t -> Just (show t)
apExtension :: AST.Extension -> ASM SpanAST.Extension
apExtension (AST.KnownExtension p e)
= getTokenSpan >+= \ (_, Id e') ->
ensure (show e == e') (SpanAST.KnownExtension (p, moveColBy p (length (show e) - 1)) e)
apExtension (AST.UnknownExtension p s)
= getTokenSpan >+= \ (_, StringTok s') ->
ensure (show s == s') (SpanAST.UnknownExtension (p, moveColBy p (length s - 1)) s)
apExportSpec :: AST.ExportSpec -> ASM SpanAST.ExportSpec
apExportSpec (AST.Exporting _ exs)
= parens (sepBy apExport (tokenSpan Comma) exs)
>+= \ (pl, (exs', pcs), pr) ->
returnP (SpanAST.Exporting pl exs' pcs pr)
apExport :: AST.Export -> ASM SpanAST.Export
apExport (AST.Export qi) =
apSymQualIdent qi >+= \ qi' ->
returnP (SpanAST.Export qi')
apExport (AST.ExportTypeWith qi is) =
apQualIdent2 qi >+= \ qi' ->
tokenSpan LeftParen >+= \ pl ->
(sepBy apIdent (tokenSpan Comma) is) >+= \ (is', pcs) ->
tokenSpan RightParen >+= \ pr ->
returnP (SpanAST.ExportTypeWith qi' pl is' pcs pr)
apExport (AST.ExportTypeAll qi) =
apQualIdent2 qi >+= \ qi' ->
tokenSpan LeftParen >+= \ pl ->
tokenSpan DotDot >+= \ pdd ->
tokenSpan RightParen >+= \ pr ->
returnP (SpanAST.ExportTypeAll qi' pl pdd pr)
apExport (AST.ExportModule mi) =
tokenSpan KW_module >+= \ pm ->
apModIdent mi >+= \ mi' ->
returnP (SpanAST.ExportModule pm mi')
apImportDecl :: AST.ImportDecl -> ASM SpanAST.ImportDecl
apImportDecl (AST.ImportDecl p mi q mmi mis)
| isVirtualPos p
= let mi' = setMIdSpan virtualSpan mi
mmi' = maybe Nothing (\m -> Just (setMIdSpan virtualSpan m)) mmi
in returnP
(SpanAST.ImportDecl virtualSpan Nothing mi' Nothing q mmi' Nothing)
| otherwise
= tokenSpan KW_import >+= \ pi ->
maybeTokenSpan Id_qualified >+= \ mpq ->
apModIdent mi >+= \ mi' ->
maybeTokenSpan Id_as >+= \ mpa ->
optional apModIdent mmi >+= \ mmi' ->
optional apImportSpec mis >+= \ mis' ->
returnP (SpanAST.ImportDecl pi mpq mi' mpa q mmi' mis')
apImportSpec :: AST.ImportSpec -> ASM SpanAST.ImportSpec
apImportSpec (AST.Importing _ is) =
parens (sepBy apImport (tokenSpan Comma) is) >+= \ (pl, (pis, pcs), pr) ->
returnP (SpanAST.Importing pl pis pcs pr)
apImportSpec (AST.Hiding _ is) =
tokenSpan Id_hiding >+= \ ph ->
parens (sepBy apImport (tokenSpan Comma) is) >+= \ (pl, (pis, pcs), pr) ->
returnP (SpanAST.Hiding ph pl pis pcs pr)
apImport :: AST.Import -> ASM SpanAST.Import
apImport (AST.Import i) = SpanAST.Import <$> apSymIdent i
apImport (AST.ImportTypeWith i is) =
apIdent i >+= \ i' ->
parens (sepBy apIdent (tokenSpan Comma) is) >+= \ (pl, (pis, pcs), pr) ->
returnP (SpanAST.ImportTypeWith i' pl pis pcs pr)
apImport (AST.ImportTypeAll i) =
apIdent i >+= \ i' ->
parens (tokenSpan DotDot) >+= \ (pl, pd, pr) ->
returnP (SpanAST.ImportTypeAll i' pl pd pr)
apDecl :: AST.Decl -> ASM SpanAST.Decl
apDecl (AST.InfixDecl _ inf mprec is) =
apInfix inf >+= \ inf' ->
optional apInt mprec >+= \ mprec' ->
sepBy apSymIdent (tokenSpan Comma) is >+= \ (ops, cps) ->
returnP (SpanAST.InfixDecl inf' mprec' ops cps)
apDecl (AST.DataDecl _ i is cds clss) =
tokenSpan KW_data >+= \ pd ->
apIdent i >+= \ i' ->
mapM apIdent is >+= \ is' ->
choose
(tokenSpan Equals >+= \ pe ->
sepBy apConstrDecl (tokenSpan Bar) cds >+= \ (pcds, pss) ->
apDeriving clss >+= \ (pde, mpl, clss', ps, mpr) ->
returnP (Just pe, pcds, pss, pde, mpl, clss', ps, mpr))
(returnP (Nothing, [], [], Nothing, Nothing, [], [], Nothing))
>+= \ (pe, pcds, pss, pde, mpl, clss', ps, mpr) ->
returnP (SpanAST.DataDecl pd i' is' pe pcds pss pde mpl clss' ps mpr)
apDecl (AST.NewtypeDecl _ i is ncd clss) =
tokenSpan KW_newtype >+= \ pn ->
apIdent i >+= \ i' ->
mapM apIdent is >+= \ is' ->
tokenSpan Equals >+= \ pe ->
apNewConstrDecl ncd >+= \ ncd' ->
apDeriving clss >+= \ (pde, mpl, clss', ps, mpr) ->
returnP (SpanAST.NewtypeDecl pn i' is' pe ncd' pde mpl clss' ps mpr)
apDecl (AST.TypeDecl _ i is te) =
tokenSpan KW_type >+= \ pt ->
apIdent i >+= \ i' ->
mapM apIdent is >+= \ is' ->
tokenSpan Equals >+= \ pe ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.TypeDecl pt i' is' pe te')
apDecl (AST.FunctionDecl _ i eqs) =
let p = idPosition i
i' = setIdSpan (p, moveColBy p (length (idName i) - 1)) i
in mapM apEquation eqs >+= \ eqs' ->
returnP (SpanAST.FunctionDecl i' eqs')
apDecl (AST.TypeSig _ is qte) =
sepBy apSymIdent (tokenSpan Comma) is >+= \ (is', pcs) ->
tokenSpan DoubleColon >+= \ pdc ->
apQualTypeExpr qte >+= \ qte' ->
returnP (SpanAST.TypeSig is' pcs pdc qte')
apDecl (AST.ForeignDecl _ cc mbLib i te) =
tokenSpan KW_foreign >+= \ pf ->
apCallConv cc >+= \ cc' ->
optional apString mbLib >+= \ mbLib' ->
apSymIdent i >+= \ i' ->
tokenSpan DoubleColon >+= \ pd ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.ForeignDecl pf cc' mbLib' i' pd te')
apDecl (AST.ExternalDecl _ is) =
sepBy apSymIdent (tokenSpan Comma) is >+= \ (is', pss) ->
tokenSpan KW_external >+= \ pe ->
returnP (SpanAST.ExternalDecl is' pss pe)
apDecl (AST.PatternDecl _ pat rhs) =
apPat pat >+= \ pat' ->
apRhs rhs Equals >+= \ rhs' ->
returnP (SpanAST.PatternDecl pat' rhs')
apDecl (AST.FreeDecl _ is) =
sepBy apIdent (tokenSpan Comma) is >+= \ (is', pss) ->
tokenSpan KW_free >+= \ pf ->
returnP (SpanAST.FreeDecl is' pss pf)
apDecl (AST.DefaultDecl _ tes) =
tokenSpan KW_default >+= \ pd ->
parens (sepBy apTypeExpr (tokenSpan Comma) tes) >+= \ (lp, (tes', pss), rp) ->
returnP (SpanAST.DefaultDecl pd lp tes' pss rp)
apDecl (AST.ClassDecl _ cx cls tv ds) =
tokenSpan KW_class >+= \ pc ->
apOptContext cx >+= \ (cx', pa) ->
apIdent cls >+= \ cls' ->
apIdent tv >+= \ tv' ->
maybeTokenSpan KW_where >+= \ pw ->
mapM apDecl ds >+= \ ds' ->
returnP (SpanAST.ClassDecl pc cx' pa cls' tv' pw ds')
apDecl (AST.InstanceDecl _ cx qcls inst ds) =
tokenSpan KW_instance >+= \ pi ->
apOptContext cx >+= \ (cx', pa) ->
apQualIdent qcls >+= \ qcls' ->
apInstanceType inst >+= \ inst' ->
maybeTokenSpan KW_where >+= \ pw ->
mapM apDecl ds >+= \ ds' ->
returnP (SpanAST.InstanceDecl pi cx' pa qcls' inst' pw ds')
apDeriving :: [AST.QualIdent]
-> ASM (Maybe Span, Maybe Span, [I.QualIdent], [Span], Maybe Span)
apDeriving clss = choose
(tokenSpan KW_deriving >+= \ pde ->
maybeParens (apClasses clss) >+= \ (mpl, (clss', ps), mpr) ->
returnP (Just pde, mpl, clss', ps, mpr))
(returnP (Nothing, Nothing, [], [], Nothing))
where apClasses = sepBy apQualIdent (tokenSpan Comma)
apInfix :: AST.Infix -> ASM SpanAST.Infix
apInfix AST.InfixL = SpanAST.InfixL <$> tokenSpan KW_infixl
apInfix AST.InfixR = SpanAST.InfixR <$> tokenSpan KW_infixr
apInfix AST.Infix = SpanAST.Infix <$> tokenSpan KW_infix
apConstrDecl :: AST.ConstrDecl -> ASM SpanAST.ConstrDecl
apConstrDecl (AST.ConstrDecl _ is cx i tes) =
apExistVars is >+= \ (pf, is', pd) ->
apOptContext cx >+= \ (cx', pa) ->
apIdent i >+= \ i' ->
mapM apTypeExpr tes >+= \tes' ->
returnP (SpanAST.ConstrDecl pf is' pd cx' pa i' tes')
apConstrDecl (AST.ConOpDecl _ is cx te1 i te2) =
apExistVars is >+= \ (pf, is', pd) ->
apOptContext cx >+= \ (cx', pa) ->
apTypeExpr te1 >+= \ te1' ->
apIdent i >+= \ i' ->
apTypeExpr te2 >+= \ te2' ->
returnP (SpanAST.ConOpDecl pf is' pd cx' pa te1' i' te2')
apConstrDecl (AST.RecordDecl _ is cx i fds) =
apExistVars is >+= \ (pf, is', pd) ->
apOptContext cx >+= \ (cx', pa) ->
apIdent i >+= \ i' ->
braces (sepBy apFieldDecl (tokenSpan Comma) fds) >+= \ (pl, (pfds, pss), pr) ->
returnP (SpanAST.RecordDecl pf is' pd cx' pa i' pl pfds pss pr)
apExistVars :: [AST.Ident] -> ASM (Maybe Span, [I.Ident], Maybe Span)
apExistVars is = choose
(tokenSpan Id_forall >+= \ pf ->
mapM apIdent is >+= \ is' ->
tokenSpan SymDot >+= \ pd ->
returnP (Just pf, is', Just pd))
(returnP (Nothing, [], Nothing))
apNewConstrDecl :: AST.NewConstrDecl -> ASM SpanAST.NewConstrDecl
apNewConstrDecl (AST.NewConstrDecl _ i te) =
apIdent i >+= \ i' ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.NewConstrDecl i' te')
apNewConstrDecl (AST.NewRecordDecl _ i1 (i2, te)) =
apIdent i1 >+= \ i1' ->
braces (apNewRecordDecl i2 te) >+= \ (pl, (i2', pc, te'), pr) ->
returnP (SpanAST.NewRecordDecl i1' pl (i2', pc, te') pr)
where
apNewRecordDecl i2_ te_ =
apIdent i2_ >+= \ i2' ->
tokenSpan DoubleColon >+= \ pc ->
apTypeExpr te_ >+= \ te' ->
returnP (i2', pc, te')
apFieldDecl :: AST.FieldDecl -> ASM SpanAST.FieldDecl
apFieldDecl (AST.FieldDecl _ is te) =
sepBy apIdent (tokenSpan Comma) is >+= \ (is', pss) ->
tokenSpan DoubleColon >+= \ p ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.FieldDecl is' pss p te')
apCallConv :: AST.CallConv -> ASM SpanAST.CallConv
apCallConv (AST.CallConvPrimitive) =
tokenSpan Id_primitive >+= \ p ->
returnP (SpanAST.CallConvPrimitive p)
apCallConv (AST.CallConvCCall) =
tokenSpan Id_ccall >+= \ p ->
returnP (SpanAST.CallConvCCall p)
apTypeExpr :: AST.TypeExpr -> ASM SpanAST.TypeExpr
apTypeExpr (AST.ConstructorType qi)
| qidName qi == "(->)" =
SpanAST.ConstructorType <$> expectTokens [LeftParen, RightArrow, RightParen]
| qidName qi == "[]" =
SpanAST.ConstructorType <$> expectTokens [LeftBracket, RightBracket]
| otherwise = SpanAST.ConstructorType <$> apQualIdent qi
where
expectTokens :: [Token] -> ASM I.QualIdent
expectTokens ts =
mapM tokenSpan ts >+= \ps ->
returnP (setQIdSpan (start (head ps), end (last ps)) qi)
apTypeExpr (AST.ApplyType te1 te2) =
SpanAST.ApplyType <$> apTypeExpr te1 <*> apTypeExpr te2
apTypeExpr (AST.VariableType x) = SpanAST.VariableType <$> apIdent x
apTypeExpr (AST.TupleType tes) =
parens (sepBy apTypeExpr (tokenSpan Comma) tes) >+= \ (pl, (tes', pss), pr) ->
returnP (SpanAST.TupleType pl tes' pss pr)
apTypeExpr (AST.ListType te) =
brackets (apTypeExpr te) >+= \ (pl, te', pr) ->
returnP (SpanAST.ListType pl te' pr)
apTypeExpr (AST.ArrowType te1 te2) =
apTypeExpr te1 >+= \ te1' ->
tokenSpan RightArrow >+= \ pa ->
apTypeExpr te2 >+= \ te2' ->
returnP (SpanAST.ArrowType te1' pa te2')
apTypeExpr (AST.ParenType te) =
parens (apTypeExpr te) >+= \ (pl, te', pr) ->
returnP (SpanAST.ParenType pl te' pr)
apQualTypeExpr :: AST.QualTypeExpr -> ASM SpanAST.QualTypeExpr
apQualTypeExpr (AST.QualTypeExpr cx te) =
apOptContext cx >+= \ (cx', pa) ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.QualTypeExpr cx' pa te')
apOptContext :: AST.Context -> ASM (SpanAST.Context, Maybe Span)
apOptContext cx = choose
(apContext cx >+= \ cx' ->
tokenSpan DoubleArrow >+= \ pa ->
returnP (cx', Just pa))
(returnP (SpanAST.Context Nothing [] [] Nothing, Nothing))
apContext :: AST.Context -> ASM SpanAST.Context
apContext cs =
maybeParens (apConstraints cs) >+= \ (mpl, (cs', ps), mpr) ->
returnP (SpanAST.Context mpl cs' ps mpr)
where apConstraints = sepBy apConstraint (tokenSpan Comma)
apConstraint :: AST.Constraint -> ASM SpanAST.Constraint
apConstraint (AST.Constraint qi te) =
apQualIdent qi >+= \ qi' ->
apTypeExpr te >+= \ te' ->
returnP (SpanAST.Constraint qi' te')
apInstanceType :: AST.InstanceType -> ASM SpanAST.InstanceType
apInstanceType = apTypeExpr
apEquation :: AST.Equation -> ASM SpanAST.Equation
apEquation (AST.Equation _ lhs rhs) =
apLhs lhs >+= \ lhs' ->
apRhs rhs Equals >+= \ rhs' ->
returnP (SpanAST.Equation lhs' rhs')
apLhs :: AST.Lhs -> ASM SpanAST.Lhs
apLhs (AST.FunLhs f ps) =
apSymIdent f >+= \ f' ->
mapM apPat ps >+= \ ps' ->
returnP (SpanAST.FunLhs f' ps')
apLhs (AST.OpLhs pat1 si pat2) =
apPat pat1 >+= \ pat1' ->
apSymIdent si >+= \ si' ->
apPat pat2 >+= \ pat2' ->
returnP (SpanAST.OpLhs pat1' si' pat2')
apLhs (AST.ApLhs lhs pats) =
apLhs lhs >+= \ lhs' ->
mapM apPat pats >+= \ pats' ->
returnP (SpanAST.ApLhs lhs' pats')
apRhs :: AST.Rhs -> Token -> ASM SpanAST.Rhs
apRhs (AST.SimpleRhs _ e ds) t =
tokenSpan t >+= \ pe ->
apExpr e >+= \ e' ->
apLocalDecls ds >+= \ (mp, ds') ->
returnP (SpanAST.SimpleRhs pe e' mp ds')
apRhs (AST.GuardedRhs ces ds) _ =
tokenSpan Bar >+= \ pb ->
sepBy apCondExpr (tokenSpan Bar) ces >+= \ (ces', pss) ->
apLocalDecls ds >+= \ (mp, ds') ->
returnP (SpanAST.GuardedRhs pb ces' pss mp ds')
apLocalDecls :: [AST.Decl] -> ASM (Maybe Span, [SpanAST.Decl])
apLocalDecls [] = returnP (Nothing, [])
apLocalDecls ds@(_:_) = tokenSpan KW_where >+= \ mpw ->
mapM apDecl ds >+= \ ds' ->
returnP (Just mpw, ds')
apCondExpr :: AST.CondExpr -> ASM SpanAST.CondExpr
apCondExpr (AST.CondExpr _ e1 e2) =
apExpr e1 >+= \ e1' ->
tokenSpanOneOf Equals RightArrow >+= \ pe ->
apExpr e2 >+= \ e2' ->
returnP (SpanAST.CondExpr e1' pe e2')
apInt :: Int -> ASM (Span, Int)
apInt i = getTokenSpan >+= \ (p, IntTok i') -> ensure (i == i') (p, i)
apString :: String -> ASM (Span, String)
apString s = getTokenSpan >+= \ (p, StringTok s') -> ensure (s == s') (p, s)
apLit :: AST.Literal -> ASM SpanAST.Literal
apLit (AST.Char c') = getTokenSpan >+= \ (p, CharTok c) ->
ensure (c == c') (SpanAST.Char p c)
apLit (AST.Int i') = getTokenSpan >+= \ (p, IntTok i) ->
ensure (i == i') (SpanAST.Int p i)
apLit (AST.Float f') = getTokenSpan >+= \ (p, FloatTok f) ->
ensure (f == f') (SpanAST.Float p f)
apLit (AST.String s') = getTokenSpan >+= \ (p, StringTok s) ->
ensure (s == s') (SpanAST.String p s)
apIdent :: AST.Ident -> ASM I.Ident
apIdent i = getTokenSpan >+= \ (p, t) -> case t of
Id i' -> ensure (idName i == i') (setIdSpan p i)
Sym _ -> returnP (setIdSpan p i)
SymDot -> ensure (idName i == ".") (setIdSpan p i)
SymMinus -> ensure (idName i == "-") (setIdSpan p i)
SymStar -> ensure (idName i == "*") (setIdSpan p i)
Underscore -> ensure (idName i == "_") (setIdSpan p i)
_ -> failP ( "Tried to apply apIdent to Token "
++ show t ++ " on position " ++ show p
++ " which doesn't represent an Ident.")
apQualIdent :: AST.QualIdent -> ASM I.QualIdent
apQualIdent q
| qidName q == "()" = expectTokens [LeftParen, RightParen]
| qidName q == '(' : replicate (length (qidName q) - 2) ',' ++ ")" =
expectTokens $
LeftParen : replicate (length (qidName q) - 2) Comma ++ [RightParen]
| otherwise = getTokenSpan >+= \ (p, t) -> case t of
Colon -> ensure (qidName q == ":") (setQIdSpan p q)
Id i -> ensure (qidName q == i) (setQIdSpan p q)
QId i -> ensure (qidName q == i) (setQIdSpan p q)
QSym i -> ensure (qidName q == i) (setQIdSpan p q)
Sym _ -> returnP (setQIdSpan p q)
SymDot -> ensure (qidName q == ".") (setQIdSpan p q)
SymMinus -> ensure (qidName q == "-") (setQIdSpan p q)
SymStar -> ensure (qidName q == "*") (setQIdSpan p q)
Underscore -> ensure (qidName q == "_") (setQIdSpan p q)
_ -> failP ( "Tried to apply apQualIdent to Token "
++ show t ++ " on position " ++ show p
++ " which doesn't represent a QualIdent.")
where
expectTokens :: [Token] -> ASM I.QualIdent
expectTokens ts =
mapM tokenSpan ts >+= \ps ->
returnP (setQIdSpan (start (head ps), end (last ps)) q)
apQualIdent2 :: AST.QualIdent -> ASM I.QualIdent
apQualIdent2 q
= getTokenSpan >+= \ (p, t) -> case t of
Id i -> ensure (qidName2 q == i) (setQIdSpan p q)
QId i -> ensure (qidName2 q == i) (setQIdSpan p q)
_ -> failP ( "Tried to apply apQualIdent2 to Token "
++ show t++ " on position " ++ show p
++ " which doesn't represent a QualIdent.")
where qidName2 (QualIdent _ i) = idName i
apSymIdent :: Ident -> ASM I.SymIdent
apSymIdent i = maybeEnclosedBy
[(LeftParen, RightParen), (Backquote, Backquote)]
(apIdent i) >+= \ (mpl, i', mpr) ->
returnP (I.SymIdent mpl i' mpr)
apSymQualIdent :: QualIdent -> ASM I.SymQualIdent
apSymQualIdent qi
| qidName qi == "()" ||
qidName qi == '(' : replicate (length (qidName qi) - 2) ',' ++ ")" =
apQualIdent qi >+= \ qi' ->
returnP (I.SymQualIdent Nothing qi' Nothing)
| otherwise = maybeEnclosedBy
[(LeftParen, RightParen), (Backquote, Backquote)]
(apQualIdent qi) >+= \ (mpl, qi', mpr) ->
returnP (I.SymQualIdent mpl qi' mpr)
apModIdent :: AST.ModuleIdent -> ASM I.ModuleIdent
apModIdent mi =
getTokenSpan >+= \ (p, t) -> case t of
Id i -> ensure (moduleName mi == i) (setMIdSpan p mi)
QId i -> ensure (moduleName mi == i) (setMIdSpan p mi)
_ -> failP ( "Tried to apply apModIdent to Token "
++ show t ++ " on position " ++ show p
++ " which doesn't represent a ModuleIdent.")
apPat :: AST.Pattern -> ASM SpanAST.Pattern
apPat (AST.LiteralPattern l) = SpanAST.LiteralPattern <$> apLit l
apPat (AST.NegativePattern l) =
tokenSpan SymMinus >+= \ p ->
apLit l >+= \ l' ->
returnP (SpanAST.NegativePattern p l')
apPat (AST.VariablePattern x) = SpanAST.VariablePattern <$> apIdent x
apPat (AST.ConstructorPattern qi pats) =
apQualIdent qi >+= \ qi' ->
mapM apPat pats >+= \ pats' ->
returnP (SpanAST.ConstructorPattern qi' pats')
apPat (AST.InfixPattern pat1 qi pat2) =
apPat pat1 >+= \ pat1' ->
apQualIdent qi >+= \ qi' ->
apPat pat2 >+= \ pat2' ->
returnP (SpanAST.InfixPattern pat1' qi' pat2')
apPat (AST.ParenPattern pat) =
parens (apPat pat) >+= \ (pl, pat', pr) ->
returnP (SpanAST.ParenPattern pl pat' pr)
apPat (AST.RecordPattern qi fps) =
apQualIdent qi >+= \ qi' ->
braces (sepBy apFieldP (tokenSpan Comma) fps) >+= \ (pl, (fps', pss), pr) ->
returnP (SpanAST.RecordPattern qi' pl fps' pss pr)
apPat (AST.TuplePattern pats) =
parens (sepBy apPat (tokenSpan Comma) pats) >+= \ (pl, (pats', pss), pr) ->
returnP (SpanAST.TuplePattern pl pats' pss pr)
apPat (AST.ListPattern pats) =
brackets (sepBy apPat (tokenSpan Comma) pats) >+= \ (pl, (pats', pss), pr) ->
returnP (SpanAST.ListPattern pl pats' pss pr)
apPat (AST.AsPattern i pat) =
apIdent i >+= \ i' ->
tokenSpan At >+= \ pa ->
apPat pat >+= \ pat' ->
returnP (SpanAST.AsPattern i' pa pat')
apPat (AST.LazyPattern pat) =
tokenSpan Tilde >+= \ pt ->
apPat pat >+= \ pat' ->
returnP (SpanAST.LazyPattern pt pat')
apPat (AST.FunctionPattern qi pats) =
apQualIdent qi >+= \ qi' ->
mapM apPat pats >+= \ pats' ->
returnP (SpanAST.FunctionPattern qi' pats')
apPat (AST.InfixFuncPattern pat1 qi pat2) =
apPat pat1 >+= \ pat1' ->
apQualIdent qi >+= \ qi' ->
apPat pat2 >+= \ pat2' ->
returnP (SpanAST.InfixFuncPattern pat1' qi' pat2')
apExpr :: AST.Expression -> ASM SpanAST.Expression
apExpr (AST.Literal l) = SpanAST.Literal <$> apLit l
apExpr (AST.Variable x) = SpanAST.Variable <$> apSymQualIdent x
apExpr (AST.Constructor c) = SpanAST.Constructor <$> apSymQualIdent c
apExpr (AST.Paren e) =
parens (apExpr e) >+= \ (pl, e', pr) ->
returnP (SpanAST.Paren pl e' pr)
apExpr (AST.Typed e qte) =
apExpr e >+= \ e' ->
tokenSpan DoubleColon >+= \ p ->
apQualTypeExpr qte >+= \ qte' ->
returnP (SpanAST.Typed e' p qte')
apExpr (AST.Record qi fes) =
apQualIdent qi >+= \ qi' ->
braces (sepBy apFieldE (tokenSpan Comma) fes) >+= \ (pl, (pfes, pss), pr) ->
returnP (SpanAST.Record qi' pl pfes pss pr)
apExpr (AST.RecordUpdate e fes) =
apExpr e >+= \ e' ->
braces (sepBy apFieldE (tokenSpan Comma) fes) >+= \ (pl, (fes', pss), pr) ->
returnP (SpanAST.RecordUpdate e' pl fes' pss pr)
apExpr (AST.Tuple es) =
parens (sepBy apExpr (tokenSpan Comma) es) >+=
\ (pl, (pes, pss), pr) ->
returnP (SpanAST.Tuple pl pes pss pr)
apExpr (AST.List es) =
brackets (sepBy apExpr (tokenSpan Comma) es) >+=
\ (pl, (pes, pss), pr) ->
returnP (SpanAST.List pl pes pss pr)
apExpr (AST.ListCompr e sts) =
brackets (apListCompr e sts) >+= \ (pl, (e', pb, psts, pss), pr) ->
returnP (SpanAST.ListCompr pl e' pb psts pss pr)
where
apListCompr e_ sts_ =
apExpr e_ >+= \ e' ->
tokenSpan Bar >+= \ pb ->
sepBy apStmt (tokenSpan Comma) sts_ >+= \ (psts, pss) ->
returnP (e', pb, psts, pss)
apExpr (AST.EnumFrom e) =
brackets (apEnumFrom e) >+= \ (pl, (e', pd), pr) ->
returnP (SpanAST.EnumFrom pl e' pd pr)
where
apEnumFrom e_ =
apExpr e_ >+= \ e' ->
tokenSpan DotDot >+= \ pd ->
returnP (e', pd)
apExpr (AST.EnumFromThen e1 e2) =
brackets (apEnumFromThen e1 e2) >+= \ (pl, (e1', pc, e2', pd), pr) ->
returnP (SpanAST.EnumFromThen pl e1' pc e2' pd pr)
where
apEnumFromThen e1_ e2_ =
apExpr e1_ >+= \ e1' ->
tokenSpan Comma >+= \ pc ->
apExpr e2_ >+= \ e2' ->
tokenSpan DotDot >+= \ pd ->
returnP (e1', pc, e2', pd)
apExpr (AST.EnumFromTo e1 e2) =
brackets (apEnumFromTo e1 e2) >+= \ (pl, (e1', pd, e2'), pr) ->
returnP (SpanAST.EnumFromTo pl e1' pd e2' pr)
where
apEnumFromTo e1_ e2_ =
apExpr e1_ >+= \ e1' ->
tokenSpan DotDot >+= \ pd ->
apExpr e2_ >+= \ e2' ->
returnP (e1', pd, e2')
apExpr (AST.EnumFromThenTo e1 e2 e3) =
brackets (apEnumFromThenTo e1 e2 e3) >+=
\ (pl, (e1', pc, e2', pd, e3'), pr) ->
returnP (SpanAST.EnumFromThenTo pl e1' pc e2' pd e3' pr)
where
apEnumFromThenTo e1_ e2_ e3_ =
apExpr e1_ >+= \ e1' ->
tokenSpan Comma >+= \ pc ->
apExpr e2_ >+= \ e2' ->
tokenSpan DotDot >+= \ pd ->
apExpr e3_ >+= \ e3' ->
returnP (e1', pc, e2', pd, e3')
apExpr (AST.UnaryMinus e) =
tokenSpan SymMinus >+= \ p ->
apExpr e >+= \ e' ->
returnP (SpanAST.UnaryMinus p e')
apExpr (AST.Apply e1 e2) =
apExpr e1 >+= \ e1' ->
apExpr e2 >+= \ e2' ->
returnP (SpanAST.Apply e1' e2')
apExpr (AST.InfixApply e1 iop e2) =
apExpr e1 >+= \ e1' ->
apInfixOp iop >+= \ iop' ->
apExpr e2 >+= \ e2' ->
returnP (SpanAST.InfixApply e1' iop' e2')
apExpr (AST.LeftSection e iop) =
parens (apLeftSection e iop) >+= \ (pl, (e', iop'), pr) ->
returnP (SpanAST.LeftSection pl e' iop' pr)
where
apLeftSection e_ iop_ =
apExpr e_ >+= \ e' ->
apInfixOp iop_ >+= \ iop' ->
returnP (e', iop')
apExpr (AST.RightSection iop e) =
parens (apRightSection iop e) >+= \ (pl, (iop', e'), pr) ->
returnP (SpanAST.RightSection pl iop' e' pr)
where
apRightSection iop_ e_ =
apInfixOp iop_ >+= \ iop' ->
apExpr e_ >+= \ e' ->
returnP (iop', e')
apExpr (AST.Lambda pats e) =
tokenSpan Backslash >+= \ pl ->
mapM apPat pats >+= \ pats' ->
tokenSpan RightArrow >+= \ pa ->
apExpr e >+= \ e' ->
returnP (SpanAST.Lambda pl pats' pa e')
apExpr (AST.Let decls e) =
tokenSpan KW_let >+= \ pl ->
mapM apDecl decls >+= \ decls' ->
tokenSpan KW_in >+= \ pi ->
apExpr e >+= \ e' ->
returnP (SpanAST.Let pl decls' pi e')
apExpr (AST.Do stmts e) =
tokenSpan KW_do >+= \ pd ->
mapM apStmt stmts >+= \ stmts' ->
apExpr e >+= \ e' ->
returnP (SpanAST.Do pd stmts' e')
apExpr (AST.IfThenElse i t e) =
tokenSpan KW_if >+= \ pi ->
apExpr i >+= \ i' ->
tokenSpan KW_then >+= \ pt ->
apExpr t >+= \ t' ->
tokenSpan KW_else >+= \ pe ->
apExpr e >+= \ e' ->
returnP (SpanAST.IfThenElse pi i' pt t' pe e')
apExpr (AST.Case ct e alts) =
apCaseType ct >+= \ ct' ->
tokenSpan KW_case >+= \ pc ->
apExpr e >+= \ e' ->
tokenSpan KW_of >+= \ po ->
mapM apAlt alts >+= \ alts' ->
returnP (SpanAST.Case ct' pc e' po alts')
apInfixOp :: AST.InfixOp -> ASM SpanAST.InfixOp
apInfixOp (AST.InfixOp qi) =
apSymQualIdent qi >+= \ qis' ->
returnP (SpanAST.InfixOp qis')
apInfixOp (AST.InfixConstr qi) =
apSymQualIdent qi >+= \ qis' ->
returnP (SpanAST.InfixConstr qis')
apStmt :: AST.Statement -> ASM SpanAST.Statement
apStmt (AST.StmtExpr e) =
apExpr e >+= \ e' ->
returnP (SpanAST.StmtExpr e')
apStmt (AST.StmtDecl ds) =
tokenSpan KW_let >+= \ pl ->
mapM apDecl ds >+= \ ds' ->
returnP (SpanAST.StmtDecl pl ds')
apStmt (AST.StmtBind pat e) =
apPat pat >+= \ pat' ->
tokenSpan LeftArrow >+= \ pla ->
apExpr e >+= \ e' ->
returnP (SpanAST.StmtBind pla pat' e')
apCaseType :: AST.CaseType -> ASM SpanAST.CaseType
apCaseType (AST.Rigid) = returnP (SpanAST.Rigid)
apCaseType (AST.Flex) = returnP (SpanAST.Flex)
apAlt :: AST.Alt -> ASM SpanAST.Alt
apAlt (AST.Alt _ pat rhs) =
apPat pat >+= \ pat' ->
apRhs rhs RightArrow >+= \ rhs' ->
returnP (SpanAST.Alt pat' rhs')
apFieldE :: AST.Field AST.Expression -> ASM (SpanAST.Field SpanAST.Expression)
apFieldE (AST.Field _ qi e) =
apQualIdent qi >+= \ qi' ->
tokenSpan Equals >+= \ pe ->
apExpr e >+= \ e' ->
returnP (SpanAST.Field qi' pe e')
apFieldP :: AST.Field AST.Pattern -> ASM (SpanAST.Field SpanAST.Pattern)
apFieldP (AST.Field _ qi pat) =
apQualIdent qi >+= \ qi' ->
tokenSpan Equals >+= \ pe ->
apPat pat >+= \ pat' ->
returnP (SpanAST.Field qi' pe pat')
|