blob: d0f75dcfcc78cfd3d54aef28855fc47125dca3be (
plain)
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
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(* $Id: PPCases.v,v 1.11.6.1 2004/07/16 19:30:51 herbelin Exp $ *)
Syntax constr
level 8:
tomatch_cons [ << (TOMATCH $c1 ($LIST $cl)) >> ]
-> [ $c1:L [1 0] (TOMATCH ($LIST $cl)) ]
| tomatch_one [ << (TOMATCH $c1) >> ] -> [$c1:L]
;
level 10:
as_patt [ << (PATTAS $var $patt) >> ] -> [$patt:L" as "$var]
;
level 0:
ne_pattlist_nil [ << (PATTLIST) >> ] -> [ ]
| ne_pattlist_cons [ << (PATTLIST $patt ($LIST $lpatt)) >> ]
-> [$patt:E " " (PATTLIST ($LIST $lpatt))]
;
level 8:
equation [ << (EQN $rhs ($LIST $lhs)) >> ]
-> [ [<hov 0> (PATTLIST ($LIST $lhs)) "=> " [0 1] $rhs:E] ]
;
level 0:
bar_eqnlist_nil [ << (BAREQNLIST) >> ] -> [ ]
| bar_eqnlist_cons [ << (BAREQNLIST $eqn ($LIST $leqn)) >> ]
-> [ "| " $eqn [1 0] (BAREQNLIST ($LIST $leqn)) ]
| bar_eqnlist_one [ << (BAREQNLIST $eqn) >> ]
-> [ "| " $eqn ]
;
level 10:
pattconstruct [ << (PATTCONSTRUCT $C $D ($LIST $T)) >> ] ->
[(APPLIST $C $D ($LIST $T))]
;
level 0:
pattconstructatomic [ << (PATTCONSTRUCT $C) >> ] -> [ $C:E ]
;
level 8:
cases_exp_none [ << (CASES $pred $tomatch) >> ]
-> [ [<hov 0> (ELIMPRED $pred)
[<hv 0> "Cases"[1 2] $tomatch:E [1 0] "of"] [1 0] "end"] ]
| cases_exp_one [ << (CASES $pred $tomatch $eqn) >> ]
-> [ [<hov 0> (ELIMPRED $pred)
[<hv 0> [<hv 0> "Cases"[1 2] $tomatch:E [1 0] "of"] [1 2]
$eqn [1 0]
"end"] ] ]
| cases_exp_many [ << (CASES $pred $tomatch $eqn1 $eqn2 ($LIST $eqns)) >> ]
-> [ [<hov 0> (ELIMPRED $pred)
[<v 0> [<hv 0> "Cases"[1 2] $tomatch:E [1 0] "of"] [1 2]
$eqn1 [1 0]
(BAREQNLIST $eqn2 ($LIST $eqns)) [1 0]
"end"] ] ]
(* "level" indifférent pour ce qui suit *)
| let_binder_var [ << (LETBINDER ($VAR $id)) >> ] -> [ $id ]
| let_binder_app
[<<(LETBINDER (PATTCONSTRUCT $toforget ($VAR $id) ($LIST $vars)))>>]
-> [ "(" $id (LETBINDERTAIL ($LIST $vars)) ")" ]
| let_binder_tail_nil [ << (LETBINDERTAIL) >> ] -> [ ]
| let_binder_tail_cons [ << (LETBINDERTAIL $var ($LIST $vars)) >> ]
-> [ "," [1 0] $var (LETBINDERTAIL ($LIST $vars)) ]
;
(* On force les parenthèses autour d'un "if" sous-terme (même si le
parsing est lui plus tolérant) *)
level 10:
boolean_cases [ << (FORCEIF $pred $tomatch $c1 $c2) >> ]
-> [ [<hov 0> (ELIMPRED $pred)
[<hv 0> "if " [<hov 0> $tomatch:L ]
[1 0] [<hov 0> "then" [1 1] $c1:L ]
[1 0] [<hov 0> "else" [1 1] $c2:L ] ] ] ]
| let_cases [ << (FORCELET $pred $tomatch (EQN $c $pat)) >> ]
-> [ [<hov 0> (ELIMPRED $pred)
[<hv 0> "let " [<hov 0> (LETBINDER $pat) ] " ="
[1 1] [<hov 0> $tomatch:L ] ]
[1 0] "in " [<hov 0> $c:L ] ] ]
.
|
