/
DefFormParsers.scala
837 lines (665 loc) · 31.6 KB
/
DefFormParsers.scala
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
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
package info.kwarc.mmt.imps
import info.kwarc.mmt.api.utils.JSONObject
import info.kwarc.mmt.imps.NumericalType.NumericalType
import info.kwarc.mmt.imps.OperationType.OperationType
import info.kwarc.mmt.imps.ParseMethod.ParseMethod
import info.kwarc.mmt.imps.ParserWithSourcePosition._
import info.kwarc.mmt.imps.Usage.Usage
class DefFormParsers(js : List[JSONObject])
{
// ######### Sort Parsers
lazy val parseAtomicSort : PackratParser[IMPSAtomSort] = {
"[^,\\]):\\s\"]+".r ^^ (sort => IMPSAtomSort(sort))
}
lazy val parseSort : PackratParser[IMPSSort] = { parseSets | parseFunSort | parseFunSort2 | parseAtomicSort }
lazy val parseSets : PackratParser[IMPSSetSort] = {
("sets[" ~> parseSort <~ "]") ^^ (setsort => IMPSSetSort(setsort))
}
lazy val parseFunSort : PackratParser[IMPSNaryFunSort] = {
"[" ~> rep1sep(parseSort,",") <~ "]" ^^ (sorts => IMPSNaryFunSort(sorts))
}
lazy val parseFunSort2 : PackratParser[IMPSNaryFunSort] = {
"(" ~> rep1(parseSort) <~ ")" ^^ (sorts => IMPSNaryFunSort(sorts))
}
// ######### Argument Parsers
lazy val number : Parser[Int] = """(0|[1-9]\d*)""".r ^^ { _.toInt }
lazy val parseTNumber : Parser[Number] = fullParser(
number ^^ (n => Number(n, None, None))
)
lazy val parseName : Parser[String] = "[^()\"\t\r\n ]+".r
lazy val parseTName : Parser[Name] = fullParser(
(parseName ^^ (nm => Name(nm, None, None))) | ("()" ^^ (_ => Name("()", None, None)))
)
lazy val parseDefString : Parser[DefString] = fullParser("\"[^\"]+\"".r ^^ (s => DefString(s, None, None)))
lazy val parseArgTheory : Parser[ArgTheory] =
fullParser(("(theory" ~> parseTName <~ ")") ^^ (n => ArgTheory(n, None, None)))
lazy val parseArgTranslation : Parser[ArgTranslation] =
fullParser(("(translation" ~> parseTName <~ ")") ^^ (n => ArgTranslation(n, None, None)))
lazy val parseArgLanguage : Parser[ArgLanguage] = {
fullParser(("(language" ~> parseTName <~ ")") ^^ (n => ArgLanguage(n, None, None)))
}
lazy val parseArgWitness : Parser[ArgWitness] =
fullParser(("(witness" ~> parseDefString <~ ")") ^^ (s => ArgWitness(s, None, None)))
lazy val parseUsage : Parser[Usage] = parseName ^^ {
case "elementary-macete" => Usage.ELEMENTARYMACETE
case "transportable-macete" => Usage.TRANSPORTABLEMACETE
case "rewrite" => Usage.REWRITE
case "transportable-rewrite" => Usage.TRANSPORTABLEREWRITE
case "simplify-logically-first" => Usage.SIMPLIFYLOGICALLYFIRST
case "d-r-convergence" => Usage.DRCONVERGENCE
case "d-r-value" => Usage.DRVALUE
case "transportable" => Usage.TRANSPORTABLE
}
lazy val parseArgUsages : Parser[ArgUsages] =
fullParser(("(usages" ~> rep(parseUsage) <~ ")") ^^ (us => ArgUsages(us, None, None)))
lazy val parseArgSort : Parser[ArgSort] =
fullParser(("(sort" ~> (("\""?) ~> parseSort <~ ("\""?)) <~ ")") ^^ (n => ArgSort(n, None, None)))
lazy val parseArgFixedTheories : Parser[ArgFixedTheories] =
fullParser(("(fixed-theories" ~> rep1(parseTName) <~ ")") ^^ (ts => ArgFixedTheories(ts, None, None)))
lazy val parseModTransportable : Parser[ModTransportable] =
fullParser("transportable" ^^ (_ => ModTransportable(None, None)))
lazy val parseModNull : Parser[ModNull] = fullParser("null" ^^ (_ => ModNull(None, None)))
lazy val parseSpecName : Parser[MSpecName] = fullParser(parseTName ^^ (n => MSpecName(n, None, None)))
lazy val parseSpecSeries : Parser[MSpecSeries] = fullParser(
"(series" ~> rep1(parseSpec) <~ ")" ^^ (s => MSpecSeries(s, None, None))
)
lazy val parseSpecRepeat : Parser[MSpecRepeat] = fullParser(
"(repeat" ~> rep1(parseSpec) <~ ")" ^^ (s => MSpecRepeat(s, None, None))
)
lazy val parseSpecSequential : Parser[MSpecSequential] = fullParser(
"(sequential" ~> rep1(parseSpec) <~ ")" ^^ (s => MSpecSequential(s, None, None))
)
lazy val parseSpecSound : Parser[MSpecSound] = fullParser(
"(sound" ~> (parseSpec ~ parseSpec ~ parseSpec) <~ ")" ^^ { case x ~ y ~ z => MSpecSound(x,y,z,None,None)}
)
lazy val parseSpecParallel : Parser[MSpecParallel] = fullParser(
"(parallel" ~> rep1(parseSpec) <~ ")" ^^ (s => MSpecParallel(s, None, None))
)
lazy val parseSpecWithoutMinorPremises : Parser[MSpecWithoutMinorPremises] = fullParser(
"(without-minor-premises" ~> parseSpec <~ ")" ^^ (s => MSpecWithoutMinorPremises(s, None, None))
)
val allMSpecs : List[Parser[MaceteSpec]] = List(
parseSpecSeries, parseSpecRepeat, parseSpecSequential, parseSpecSound,
parseSpecParallel, parseSpecWithoutMinorPremises, parseSpecName
)
lazy val parseSpec : Parser[MaceteSpec] = anyOf(allMSpecs)
lazy val parseArgSourceTheory : Parser[ArgSourceTheory] = fullParser(
"(source-theory" ~> parseTName <~ ")" ^^ (n => ArgSourceTheory(n, None, None))
)
lazy val parseArgSourceTheories : Parser[ArgSourceTheories] = fullParser(
"(source-theories" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgSourceTheories(ns, None, None))
)
lazy val parseInductionPrinciple : Parser[ArgInductionPrinciple] = fullParser(
(parseDefString | parseTName) ^^ {
case n@Name(_,_,_) => ArgInductionPrinciple(Left(n),None,None)
case d@DefString(_,_,_) => ArgInductionPrinciple(Right(d),None,None)
case p@_ => ??!(p)
}
)
lazy val parseArgBaseCaseHook : Parser[ArgBaseCaseHook] = fullParser(
"(base-case-hook" ~> parseTName <~ ")" ^^ (n => ArgBaseCaseHook(n, None, None))
)
lazy val parseArgInductionStepHook : Parser[ArgInductionStepHook] = fullParser(
"(induction-step-hook" ~> parseTName <~ ")" ^^ (n => ArgInductionStepHook(n, None, None))
)
lazy val parseArgDontUnfold : Parser[ArgDontUnfold] = fullParser(
"(dont-unfold" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgDontUnfold(ns, None, None))
)
lazy val parseArgEmbeddedLang : Parser[ArgEmbeddedLang] = fullParser(
"(embedded-language" ~> parseTName <~ ")" ^^ (n => ArgEmbeddedLang(n, None, None))
)
lazy val parseArgEmbeddedLangs : Parser[ArgEmbeddedLangs] = fullParser(
"(embedded-languages" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgEmbeddedLangs(ns, None, None))
)
lazy val parseArgBaseTypes : Parser[ArgBaseTypes] = fullParser(
"(base-types" ~> rep1(parseAtomicSort) <~ ")" ^^ (ns => ArgBaseTypes(ns, None, None))
)
lazy val parseArgSortSpec : Parser[ArgSortSpec] = fullParser(
"(" ~> (parseSort ~ parseSort) <~ ")" ^^ { case sub ~ sup => ArgSortSpec(sub,sup,None,None) }
)
lazy val parseArgSorts : Parser[ArgSorts] = fullParser(
"(sorts" ~> rep1(parseArgSortSpec) <~ ")" ^^ (ns => ArgSorts(ns, None, None))
)
lazy val parseNumericalType : Parser[NumericalType] = parseName ^^ {
case "*integer-type*" => NumericalType.INTEGERTYPE
case "*rational-type*" => NumericalType.RATIONALTYPE
case "*octet-type*" => NumericalType.OCTETTYPE
}
lazy val parseArgTypeSortAList : Parser[ArgTypeSortAList] = fullParser(
"(" ~> (parseNumericalType ~ parseSort) <~ ")" ^^ { case num ~ srt => ArgTypeSortAList(num,srt,None,None) }
)
lazy val parseArgExtensible : Parser[ArgExtensible] = fullParser(
"(extensible" ~> rep1(parseArgTypeSortAList) <~ ")" ^^ (als => ArgExtensible(als, None, None))
)
lazy val parseArgConstantSpec : Parser[ArgConstantSpec] = fullParser(
"(" ~> (parseTName ~ (("\""?) ~> parseSort <~ ("\""?))) <~ ")" ^^ { case nm ~ srt => ArgConstantSpec(nm,srt,None,None) }
)
lazy val parseArgConstants : Parser[ArgConstants] = fullParser(
"(constants" ~> rep1(parseArgConstantSpec) <~ ")" ^^ (ns => ArgConstants(ns, None, None))
)
lazy val parseArgRenamerPair : Parser[ArgRenamerPair] = fullParser(
"(" ~> parseTName ~ parseTName <~ ")" ^^ { case old ~ nu => ArgRenamerPair(old,nu,None,None) }
)
lazy val parseArgRenamerPairs : Parser[ArgPairs] = fullParser(
"(pairs" ~> rep1(parseArgRenamerPair) <~ ")" ^^ (ps => ArgPairs(ps, None, None))
)
lazy val parseArgToken : Parser[ArgToken] = fullParser(
"(token" ~> parseScript <~ ")" ^^ (muls => ArgToken(muls, None, None))
)
lazy val parseArgBinding : Parser[ArgBinding] = fullParser(
"(binding" ~> number <~ ")" ^^ (n => ArgBinding(n, None, None))
)
lazy val parseArgTable : Parser[ArgTable] = fullParser(
"(table" ~> parseTName <~ ")" ^^ (t => ArgTable(t, None, None))
)
lazy val parseArgMethod : Parser[ArgMethod] = fullParser(
"(method" ~> parseTName <~ ")" ^^ (m => ArgMethod(m, None, None))
)
lazy val parseParseMethod : Parser[ParseMethod] = parseName ^^ {
case "prefix-operator-method" => ParseMethod.PREFIXMETHOD
case "infix-operator-method" => ParseMethod.INFIXMETHOD
case "postfix-operator-method" => ParseMethod.POSTFIXMETHOD
case "negation-operator-method" => ParseMethod.NEGATIONMETHOD
case "table-operator-method" => ParseMethod.TABLEMETHOD
case "parse-indicator-constructor-both-syntaxes" => ParseMethod.INDBOTHSYN
case "prefix-sort-dependent-operator-method" => ParseMethod.PREFSORTDEPOM
case "null-call-method-terminator" => ParseMethod.NULLCALL
}
lazy val parseArgLeftMethod : Parser[ArgLeftMethod] = fullParser(
"(left-method" ~> parseParseMethod <~ ")" ^^ (m => ArgLeftMethod(m, None, None))
)
lazy val parseArgNullMethod : Parser[ArgNullMethod] = fullParser(
"(null-method" ~> parseParseMethod <~ ")" ^^ (m => ArgNullMethod(m, None, None))
)
lazy val parseModTex : Parser[ModTex] = fullParser(("tex" | "TeX" | "TEX") ^^ (_ => ModTex(None, None)))
lazy val parseModReverse : Parser[ModReverse] = fullParser("reverse" ^^ (_ => ModReverse(None, None)))
lazy val parseModLemma : Parser[ModLemma] = fullParser("lemma" ^^ (_ => ModLemma(None, None)))
lazy val parseArgMacete : Parser[ArgMacete] = fullParser(
"(macete" ~> parseTName <~ ")" ^^ (m => ArgMacete(m, None, None))
)
lazy val parseArgHomeTheory : Parser[ArgHomeTheory] = fullParser(
"(home-theory" ~> parseTName <~ ")" ^^ (m => ArgHomeTheory(m, None, None))
)
def balance(chars:List[Char], level:Int=0): Boolean = {
if (level < 0) return false
val nextParen = chars.dropWhile(char => char != ')' && char != '(')
if (nextParen.isEmpty) {
level == 0
} else if (nextParen.head == '(') {
balance(nextParen.tail, level + 1)
} else {
assert(nextParen.head == ')')
balance(nextParen.tail, level - 1)
}
}
lazy val stuff : Parser[String] = "[^()]+".r
lazy val bracketed : Parser[String] = "(" ~> (parseScript | "") <~ ")" ^^ (s => "(" + s.toString + ")")
lazy val parseScript : Parser[Script] = fullParser(
rep1(bracketed|stuff) ^^ (ss => Script(ss.mkString(" "), None, None))
)
lazy val parseArgProof : Parser[ArgProof] = fullParser(
"(proof" ~> parseScript <~ ")" ^^ (m => ArgProof(m, None, None))
)
lazy val parseArgComponentTheories : Parser[ArgComponentTheories] = fullParser(
"(component-theories" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgComponentTheories(ns, None, None))
)
lazy val parseArgDistinctConstants : Parser[ArgDistinctConstants] = fullParser(
"(distinct-constants" ~> rep1("(" ~> rep1(parseTName) <~ ")") <~ ")" ^^ (ll => ArgDistinctConstants(ll, None, None))
)
lazy val parseAxiomSpec : Parser[AxiomSpec] = fullParser(
"(" ~> (parseName?) ~ parseDefString ~ (rep1(parseUsage)?) <~ ")" ^^ {case n ~ d ~ us => AxiomSpec(n,d,None,us,None,None)}
)
lazy val parseArgAxioms : Parser[ArgAxioms] = fullParser(
"(axioms" ~> rep1(parseAxiomSpec) <~ ")" ^^ (as => ArgAxioms(as, None, None))
)
lazy val parseArgOverloadingPairs : Parser[ArgOverloadingPair] = fullParser(
"(" ~> parseTName ~ parseTName <~ ")" ^^ {case p1 ~ p2 => ArgOverloadingPair(p1,p2,None,None)}
)
lazy val parseModForce : Parser[ModForce] = fullParser("force" ^^ (_ => ModForce(None, None)))
lazy val parseModForceU : Parser[ModForceUnderQuickLoad] = fullParser("force-under-quick-load" ^^ (_ => ModForceUnderQuickLoad(None, None)))
lazy val parseModDontEnrich : Parser[ModDontEnrich] = fullParser("dont-enrich" ^^ (_ => ModDontEnrich(None, None)))
lazy val parseArgSource : Parser[ArgSource] = fullParser(
"(source" ~> parseTName <~ ")" ^^ (n => ArgSource(n, None, None))
)
lazy val parseArgTarget : Parser[ArgTarget] = fullParser(
"(target" ~> parseTName <~ ")" ^^ (n => ArgTarget(n, None, None))
)
lazy val parseArgAssumptions : Parser[ArgAssumptions] = fullParser(
"(assumptions" ~> rep1(parseDefString) <~ ")" ^^ (as => ArgAssumptions(as, Nil, None, None))
)
lazy val pv0 : Parser[(Name,Int)] = parseTName ^^ (n => (n, 0))
lazy val pv1 : Parser[(DefString,Int)] = parseDefString ^^ (d => (d, 1))
lazy val pv2 : Parser[(DefString,Int)] = "(pred" ~> parseDefString <~ ")" ^^ (d => (d, 2))
lazy val pv3 : Parser[(DefString,Int)] = "(indic" ~> parseDefString <~ ")" ^^ (d => (d, 3))
lazy val parseSortPairSpec : Parser[ArgSortPairSpec] = fullParser(
"(" ~> parseTName ~ (pv0 | pv1 | pv2 | pv3) <~ ")" ^^ { case (nm : Name) ~ t => t match {
case (n : Name, 0) => ArgSortPairSpec(nm,Left(Left(n)),None,None,None)
case (d : DefString, 1) => ArgSortPairSpec(nm,Left(Right(d)),None,None,None)
case (d : DefString, 2) => ArgSortPairSpec(nm,Right(Left(d)),None,None,None)
case (d : DefString, 3) => ArgSortPairSpec(nm,Right(Right(d)),None,None,None)
case _ => ??!(t)
}
}
)
lazy val parseArgSortPairs : Parser[ArgSortPairs] = fullParser(
"(sort-pairs" ~> rep1(parseSortPairSpec) <~ ")" ^^ (sps => ArgSortPairs(sps, None, None))
)
lazy val parseDefStringOrName : Parser[ODefString] = fullParser(
(parseDefString ^^ (d => ODefString(Left((d, None)), None, None))) | (parseTName ^^ (n => ODefString(Right(n), None, None)))
)
lazy val parseArgConstPairSpec : Parser[ArgConstPairSpec] = fullParser(
"(" ~> parseTName ~ parseDefStringOrName <~ ")" ^^ { case f ~ b => ArgConstPairSpec(f,b,None,None) }
)
lazy val parseArgConstPairs : Parser[ArgConstPairs] = fullParser(
("(constant-pairs" ~> rep1(parseArgConstPairSpec) <~ ")") ^^ (as => ArgConstPairs(as, None, None))
)
lazy val parseArgCoreTranslation : Parser[ArgCoreTranslation] = fullParser(
"(core-translation" ~> parseTName <~ ")" ^^ (n => ArgCoreTranslation(n, None, None))
)
lazy val parseArgTheoryInterpretationCheck : Parser[ArgTheoryInterpretationCheck] = fullParser(
"(theory-interpretation-check" ~> parseTName <~ ")" ^^ (n => ArgTheoryInterpretationCheck(n, None, None))
)
lazy val parseArgNameList : Parser[ArgNameList] = fullParser(
singleOrList(parseTName) ^^ (ns => ArgNameList(ns, None, None))
)
lazy val parseArgDefStringList : Parser[ArgDefStringList] = fullParser(
singleOrList(parseDefString) ^^ (ds => ArgDefStringList(ds, None, None))
)
lazy val parseArgDefinitionName : Parser[ArgDefinitionName] = fullParser(
"(definition-name" ~> parseTName <~ ")" ^^ (nm => ArgDefinitionName(nm, None, None))
)
lazy val parseArgRenamer : Parser[ArgRenamer] = fullParser(
"(renamer" ~> parseTName <~ ")" ^^ (r => ArgRenamer(r, None, None))
)
lazy val parseOperationType : Parser[OperationType] = parseName ^^ {
case "+" => OperationType.PLUS
case "-" => OperationType.MINUS
case "*" => OperationType.TIMES
case "/" => OperationType.DIV
case "^" => OperationType.EXP
case "sub" => OperationType.SUB
case "zero" => OperationType.ZERO
case "unit" => OperationType.UNIT
}
lazy val parseOperationAlist : Parser[ArgOperationAlist] = fullParser(
"(" ~> parseOperationType ~ parseTName <~ ")" ^^ {case ot ~ n => ArgOperationAlist(ot,n,None,None) }
)
lazy val parseArgOperations : Parser[ArgOperations] = fullParser(
"(operations" ~> rep1(parseOperationAlist) <~ ")" ^^ (oas => ArgOperations(oas, None, None))
)
lazy val parseArgScalars : Parser[ArgScalars] = fullParser(
"(scalars" ~> parseNumericalType <~ ")" ^^ (nt => ArgScalars(nt, None, None))
)
lazy val parseModUseNumerals : Parser[ModUseNumerals] = fullParser(
"use-numerals-for-ground-terms" ^^ (_ => ModUseNumerals(None, None))
)
lazy val parseModCommutes : Parser[ModCommutes] = fullParser(
"commutes" ^^ (_ => ModCommutes(None, None))
)
lazy val parseQDFSpecForm : Parser[QDFSpecForm] = composeParser(
"",
Nil,
List(parseModCommutes,parseModUseNumerals),
List(parseArgScalars,parseArgOperations).map(p => (p,O)),
QDFSpecForm
)
lazy val parseArgSpecForms : Parser[ArgSpecForms] = fullParser(
(parseQDFSpecForm ^^ (sf => ArgSpecForms(Right(sf), None, None))) | (parseTName ^^ (n => ArgSpecForms(Left(n), None, None)))
)
lazy val parseArgBase : Parser[ArgBase] = fullParser(
"(base" ~> parseArgSpecForms <~ ")" ^^ (b => ArgBase(b, None, None))
)
lazy val parseArgExponent : Parser[ArgExponent] = fullParser(
"(exponent" ~> parseArgSpecForms <~ ")" ^^ (b => ArgExponent(b, None, None))
)
lazy val parseArgCoefficient : Parser[ArgCoefficient] = fullParser(
"(coefficient" ~> parseArgSpecForms <~ ")" ^^ (b => ArgCoefficient(b, None, None))
)
lazy val parseModCancellative : Parser[ModCancellative] = fullParser(
"cancellative" ^^ (_ => ModCancellative(None, None))
)
lazy val parseArgRetrievalProtocol : Parser[ArgRetrievalProtocol] = fullParser(
"(retrieval-protocol" ~> parseTName <~ ")" ^^ (b => ArgRetrievalProtocol(b, None, None))
)
lazy val parseArgApplicabilityRecognizer : Parser[ArgApplicabilityRecognizer] = fullParser(
"(applicability-recognizer" ~> parseTName <~ ")" ^^ (b => ArgApplicabilityRecognizer(b, None, None))
)
lazy val parseArgFileSpec : Parser[ArgFileSpec] = fullParser(
(";;"?) ~> "(" ~> parseTName ~ parseTName <~ ")" ^^ { case p ~ q => ArgFileSpec(p,q,None,None) }
)
lazy val parseArgFiles : Parser[ArgFiles] = fullParser(
"(files" ~> rep1(parseArgFileSpec) <~ ")" ^^ (fss => ArgFiles(fss, None, None))
)
lazy val parseArgComponentSections : Parser[ArgComponentSections] = fullParser(
"(component-sections" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgComponentSections(ns, None, None))
)
lazy val parseArgBaseTheory : Parser[ArgBaseTheory] = fullParser(
"(base-theory" ~> parseTName <~ ")" ^^ (b => ArgBaseTheory(b, None, None))
)
lazy val parseArgReplicaRenamer : Parser[ArgReplicaRenamer] = fullParser(
"(replica-renamer" ~> parseTName <~ ")" ^^ (b => ArgReplicaRenamer(b, None, None))
)
lazy val parseArgNumbers : Parser[ArgNumbers] = fullParser(
"(" ~> rep1(parseTNumber) <~ ")" ^^ (ns => ArgNumbers(ns, None, None))
)
lazy val parseArgTargetTheories : Parser[ArgTargetTheories] = fullParser(
"(target-theories" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgTargetTheories(ns, None, None))
)
lazy val parseArgTargetMultiple : Parser[ArgTargetMultiple] = fullParser(
"(target-multiple" ~> parseTNumber <~ ")" ^^ (n => ArgTargetMultiple(n, None, None))
)
lazy val parseArgSortAssoc : Parser[ArgSortAssoc] = fullParser(
"(" ~> parseTName ~ rep1(parseDefStringOrName) <~ ")" ^^ { case n ~ ns => ArgSortAssoc(n,ns,None,None) }
)
lazy val parseArgEnsembleSorts : Parser[ArgEnsembleSorts] = fullParser(
"(sorts" ~> rep1(parseArgSortAssoc) <~ ")" ^^ (sas => ArgEnsembleSorts(sas, None, None))
)
lazy val parseArgConstAssoc : Parser[ArgConstAssoc] = fullParser(
"(" ~> parseTName ~ rep1(parseDefStringOrName) <~ ")" ^^ { case n ~ ns => ArgConstAssoc(n,ns,None,None) }
)
lazy val parseArgEnsembleConsts : Parser[ArgEnsembleConsts] = fullParser(
"(constants" ~> rep1(parseArgConstAssoc) <~ ")" ^^ (cas => ArgEnsembleConsts(cas, None, None))
)
lazy val parseArgMultiples : Parser[ArgMultiples] = fullParser(
"(multiples" ~> rep1(parseTNumber) <~ ")" ^^ (ns => ArgMultiples(ns, None, None))
)
lazy val parseArgPermutations : Parser[ArgPermutations] = fullParser(
"(permutations" ~> rep1("(" ~> rep1(parseTNumber) <~ ")") <~ ")" ^^ (ns => ArgPermutations(ns, None, None))
)
lazy val parseArgSpecialRenamings : Parser[ArgSpecialRenamings] = fullParser(
"(special-renamings" ~> rep1(parseArgRenamerPair) <~ ")" ^^ (ns => ArgSpecialRenamings(ns, None, None))
)
lazy val parseArgNewTranslationName : Parser[ArgNewTranslationName] = fullParser(
"(new-translation-name" ~> parseTName <~ ")" ^^ (n => ArgNewTranslationName(n, None, None))
)
lazy val parseAlgebraicSimplifierSpec : Parser[ArgAlgebraicSimplifierSpec] = fullParser(
"(" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgAlgebraicSimplifierSpec(ns, None, None))
)
lazy val parseAlgebraicSimplifier : Parser[ArgAlgebraicSimplifier] = fullParser(
"(algebraic-simplifier" ~> rep1(parseAlgebraicSimplifierSpec) <~ ")" ^^ (specs => ArgAlgebraicSimplifier(specs, None, None))
)
lazy val parseAlgebraicOrderSimplifierSpec : Parser[ArgAlgebraicOrderSimplifierSpec] = fullParser(
"(" ~> rep1(parseTName) <~ ")" ^^ (ns => ArgAlgebraicOrderSimplifierSpec(ns, None, None))
)
lazy val parseAlgebraicOrderSimplifier : Parser[ArgAlgebraicOrderSimplifier] = fullParser(
"(algebraic-order-simplifier" ~> rep1(parseAlgebraicOrderSimplifierSpec) <~ ")" ^^ (specs => ArgAlgebraicOrderSimplifier(specs, None, None))
)
lazy val parseAlgebraicTermComparator : Parser[ArgAlgebraicTermComparator] = fullParser(
"(algebraic-term-comparator" ~> rep1(parseTName) <~ ")" ^^ (specs => ArgAlgebraicTermComparator(specs, None, None))
)
lazy val parseArgAlgebraicProcessor : Parser[ArgAlgebraicProcessor] = fullParser(
"(algebraic-processor" ~> parseTName <~ ")" ^^ (n => ArgAlgebraicProcessor(n, None, None))
)
lazy val parseArgDiscreteSorts : Parser[ArgDiscreteSorts] = fullParser(
"(discrete-sorts" ~> rep1(parseSort) <~ ")" ^^ (srt => ArgDiscreteSorts(srt, None, None))
)
lazy val parseArgOperationsAlist : Parser[ArgOperationsAlist] = fullParser(
"(" ~> parseTName ~ parseTName <~ ")" ^^ { case o ~ p => ArgOperationsAlist(o,p,None,None) }
)
lazy val parseArgProcOperations : Parser[ArgProcOperations] = fullParser(
"(operations" ~> rep1(parseArgOperationsAlist) <~ ")" ^^ (ls => ArgProcOperations(ls, None, None))
)
lazy val parseModReload : Parser[ModReload] = fullParser(
"reload" ^^ (_ => ModReload(None, None))
)
lazy val parseModQuickLoad : Parser[ModQuickLoad] = fullParser(
"quick-load" ^^ (_ => ModQuickLoad(None, None))
)
// ######### Full Def-Form Parsers
val pHeralding : Parser[Heralding] = composeParser(
"herald",
List(parseTName),
Nil,
Nil,
Heralding
)
val pAtomicSort : Parser[DFAtomicSort] = composeParser(
"def-atomic-sort",
List(parseTName, parseDefString),
Nil,
List((parseArgTheory, R), (parseArgUsages, O), (parseArgWitness, O)),
new DFAtomicSortC(js)
)
val pCompoundMacete : Parser[DFCompoundMacete] = composeParser(
"def-compound-macete",
List(parseTName, parseSpec),
Nil,
Nil,
DFCompoundMacete
)
val pConstant : Parser[DFConstant] = composeParser(
"def-constant",
List(parseTName, parseDefString),
Nil,
List((parseArgTheory,R),(parseArgSort,O),(parseArgUsages,O)),
new DFConstantC(js)
)
val pImportedRewriteRules : Parser[DFImportedRewriteRules] = composeParser(
"def-imported-rewrite-rules",
List(parseTName),
Nil,
List((parseArgSourceTheory,O), (parseArgSourceTheories,O)),
DFImportedRewriteRules
)
val pInductor : Parser[DFInductor] = composeParser(
"def-inductor",
List(parseTName, parseInductionPrinciple),
Nil,
List((parseArgTheory,R), (parseArgTranslation,O), (parseArgBaseCaseHook,O),
(parseArgInductionStepHook,O), (parseArgDontUnfold,O)),
DFInductor
)
val pLanguage : Parser[DFLanguage] = composeParser(
"def-language",
List(parseTName),
Nil,
List(parseArgEmbeddedLangs, parseArgEmbeddedLang, parseArgBaseTypes, parseArgSorts,
parseArgExtensible, parseArgConstants).map(p => (p,O)), // all optional
DFLanguage
)
val pQuasiConstructor : Parser[DFQuasiConstructor] = composeParser(
"def-quasi-constructor",
List(parseTName, parseDefString),
Nil,
List((parseArgLanguage,R),(parseArgFixedTheories,O)),
DFQuasiConstructor
)
val pRenamer : Parser[DFRenamer] = composeParser(
"def-renamer",
List(parseTName),
Nil,
List((parseArgRenamerPairs,O)),
DFRenamer
)
val pSchematicMacete : Parser[DFSchematicMacete] = composeParser(
"def-schematic-macete",
List(parseTName, parseDefString),
List(parseModNull, parseModTransportable),
List((parseArgTheory,R)),
DFSchematicMacete
)
val pParseSyntax : Parser[DFParseSyntax] = composeParser(
"def-parse-syntax",
List(parseTName),
Nil,
List((parseArgToken,O),(parseArgLeftMethod,O),(parseArgNullMethod,O),(parseArgTable,O),(parseArgBinding,R)),
DFParseSyntax
)
val pPrintSyntax : Parser[DFPrintSyntax] = composeParser(
"def-print-syntax",
List(parseTName),
List(parseModTex),
List((parseArgToken,O),(parseArgMethod,O),(parseArgTable,O),(parseArgBinding,R)),
DFPrintSyntax
)
val pTheorem : Parser[DFTheorem] =
composeParser(
"def-theorem",
List(parseTName, parseDefStringOrName),
List(parseModReverse, parseModLemma),
List((parseArgTheory,R)) :::
List(parseArgUsages, parseArgTranslation, parseArgMacete,parseArgHomeTheory,parseArgProof).map(p => (p,O)),
new DFTheoremC(js)
)
val pTheory : Parser[DFTheory] = composeParser(
"def-theory ", // space is necessary because otherwise this conflicts with theory-ensemble etc.
List(parseTName),
Nil,
List(parseArgLanguage,parseArgComponentTheories,parseArgAxioms,parseArgDistinctConstants).map(p => (p,O)),
new DFTheoryC(js)
)
lazy val pOverloading : Parser[DFOverloading] = fullParser(
"(def-overloading" ~> parseTName ~ rep1(parseArgOverloadingPairs) <~ ")" ^^ { case t ~ ps =>
DFOverloading.build(List(t,ps))
}
)
lazy val pTranslation : Parser[DFTranslation] = composeParser(
"def-translation",
List(parseTName),
List(parseModForceU,parseModForce,parseModDontEnrich),
List(parseArgSource, parseArgTarget).map(p => (p,R)) :::
List(parseArgAssumptions, parseArgFixedTheories, parseArgSortPairs, parseArgConstPairs,
parseArgCoreTranslation, parseArgTheoryInterpretationCheck).map(p => (p,O)),
new DFTranslationC(js)
)
lazy val pRecursiveConstant : Parser[DFRecursiveConstant] = {
composeParser(
"def-recursive-constant",
List(parseArgNameList, parseArgDefStringList),
Nil,
List((parseArgTheory,R),(parseArgUsages,O),(parseArgDefinitionName,O)),
new DFRecursiveConstantC(js)
)
}
lazy val pTransportedSymbols : Parser[DFTransportedSymbols] = composeParser(
"def-transported-symbols",
List(parseArgNameList),
Nil,
List((parseArgTranslation,R),(parseArgRenamer,O)),
DFTransportedSymbols
)
lazy val pAlgebraicProcessor : Parser[DFAlgebraicProcessor] = composeParser(
"def-algebraic-processor",
List(parseTName),
List(parseModCancellative),
List((parseArgLanguage,R),(parseArgBase,R),(parseArgExponent,O),(parseArgCoefficient,O)),
DFAlgebraicProcessor
)
lazy val pScript : Parser[DFScript] = composeParser(
"def-script",
List(parseTName,parseTNumber,parseScript),
Nil,
List(parseArgRetrievalProtocol, parseArgApplicabilityRecognizer).map(p => (p,O)),
DFScript
)
lazy val pSection : Parser[DFSection] = composeParser(
"def-section",
List(parseTName),
Nil,
List(parseArgComponentSections, parseArgFiles).map(p => (p,O)),
DFSection
)
lazy val pTheoryEnsemble : Parser[DFTheoryEnsemble] = composeParser(
"def-theory-ensemble ",
List(parseTName),
Nil,
List(parseArgBaseTheory,parseArgFixedTheories,parseArgReplicaRenamer).map(p => (p,O)),
DFTheoryEnsemble
)
lazy val pTheoryEnsembleMultiple : Parser[DFTheoryEnsembleMultiple] = composeParser(
"def-theory-ensemble-multiple",
List(parseTName,parseTNumber),
Nil,
Nil,
DFTheoryEnsembleMultiple
)
lazy val pTheoryEnsembleOverloadings : Parser[DFTheoryEnsembleOverloadings] = composeParser(
"def-theory-ensemble-overloadings",
List(parseTName,parseArgNumbers),
Nil,
Nil,
DFTheoryEnsembleOverloadings
)
lazy val pTheoryEnsembleInstances : Parser[DFTheoryEnsembleInstances] = composeParser(
"def-theory-ensemble-instances",
List(parseTName),
List(parseModForceU),
List(parseArgTargetTheories, parseArgTargetMultiple, parseArgEnsembleSorts, parseArgEnsembleConsts,
parseArgMultiples, parseArgTheoryInterpretationCheck, parseArgPermutations,parseArgSpecialRenamings).map(p => (p,O)),
DFTheoryEnsembleInstances
)
lazy val pTheoryInstance : Parser[DFTheoryInstance] = composeParser(
"def-theory-instance",
List(parseTName),
Nil,
List((parseArgSource,R),(parseArgTarget,R),(parseArgTranslation,R),(parseArgFixedTheories,O),
(parseArgRenamer,O),(parseArgNewTranslationName,O)),
DFTheoryInstance
)
lazy val pTheoryProcessors : Parser[DFTheoryProcessors] = composeParser(
"def-theory-processors",
List(parseTName),
Nil,
List(parseAlgebraicSimplifier,parseAlgebraicOrderSimplifier,parseAlgebraicTermComparator).map(p => (p,O)),
DFTheoryProcessors
)
lazy val pOrderProcessors : Parser[DFOrderProcessor] = composeParser(
"def-order-processor",
List(parseTName),
Nil,
List(parseArgAlgebraicProcessor,parseArgProcOperations,parseArgDiscreteSorts).map(p => (p,O)),
DFOrderProcessor
)
lazy val pIncludeFiles : Parser[DFIncludeFiles] = composeParser(
"include-files",
Nil,
List(parseModReload,parseModQuickLoad),
List((parseArgFiles,O)),
DFIncludeFiles
)
lazy val pLoadSection : Parser[DFLoadSection] = composeParser(
"load-section",
List(parseTName),
Nil,
Nil,
DFLoadSection
)
lazy val pComment : Parser[DFComment] = composeParser(
"comment",
List(parseScript),
Nil,
Nil,
DFComment
)
lazy val pSet : Parser[ArgSet] = fullParser(
"(set" ~> parseScript <~ ")" ^^ (c => ArgSet(c, None, None))
)
lazy val pDefine : Parser[Define] = fullParser(
"(define" ~> parseScript <~ ")" ^^ (c => Define(c, None, None))
)
lazy val pTeXCorrespondence : Parser[TeXCorrespondence] = fullParser(
"(make-tex-correspondence" ~> parseScript <~ ")" ^^ (s => TeXCorrespondence(s, None, None))
)
lazy val pQCConstantlike : Parser[QCConstantlike] = fullParser(
"(make-quasi-constructor-constantlike" ~> parseTName <~ ")" ^^ (s => QCConstantlike(s, None, None))
)
lazy val pEnsembleDontTranslateConst : Parser[EnsembleDontTranslateConst] = fullParser(
"(ensemble-dont-translate-constant" ~> parseScript <~ ")" ^^ (s => EnsembleDontTranslateConst(s, None, None))
)
def parseArbitrary(str : String) : Parser[ArbitraryScript] = fullParser(
"(" ~> str.r ~ parseScript <~ ")" ^^ { case n ~ s => ArbitraryScript(n,s,None,None) }
)
lazy val pSimplog1stWrapper : Parser[Simplog1stWrapper] = fullParser(
"(transportable-rewrite-usage-simplog1st" ~> pTheorem <~ ")" ^^ (d => Simplog1stWrapper(d, None, None))
)
// ######### Complete Parsers
val allDefFormParsers : List[Parser[DefForm]] = List(
parseLineComment,pComment,pHeralding, pAtomicSort, pConstant, pQuasiConstructor, pSchematicMacete, pCompoundMacete,
pInductor, pImportedRewriteRules, pLanguage, pRenamer, pPrintSyntax, pParseSyntax, pTheorem, pTheory, pOverloading,
pTranslation, pTransportedSymbols, pRecursiveConstant, pAlgebraicProcessor, pScript, pSection, pTheoryEnsemble,
pTheoryEnsembleMultiple, pTheoryEnsembleOverloadings, pTheoryEnsembleInstances, pTheoryInstance, pTheoryProcessors,
pOrderProcessors,pIncludeFiles,pLoadSection,pSet,pDefine,pTeXCorrespondence,pQCConstantlike, pEnsembleDontTranslateConst,
pSimplog1stWrapper
)
lazy val parseImpsSource : PackratParser[List[DefForm]] = { rep1(anyOf(allDefFormParsers)) }
}