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
|
(* $Id$ *)
open Pp
open Util
open Coqast
open Ast
open Pcoq
open Extend
open Esyntax
open Libobject
open Library
open Summary
(*************************
**** PRETTY-PRINTING ****
*************************)
(* Pretty-printer state summary *)
let _ =
declare_summary "syntax"
{ freeze_function = Esyntax.freeze;
unfreeze_function = Esyntax.unfreeze;
init_function = Esyntax.init }
(* Pretty-printing objects = syntax_entry *)
let (inPPSyntax,outPPSyntax) =
declare_object
("PPSYNTAX",
{ load_function = (fun (_,ppobj) -> Esyntax.add_ppobject ppobj);
open_function = (fun _ -> ());
cache_function = (fun (_,ppobj) -> Esyntax.add_ppobject ppobj);
specification_function = (fun x -> x) })
(* Syntax extension functions (registered in the environnement) *)
(* Checking the pretty-printing rules against free meta-variables.
* Note that object are checked before they are added in the environment.
* Syntax objects in compiled modules are not re-checked. *)
let add_syntax_obj whatfor sel =
Lib.add_anonymous_leaf (inPPSyntax (interp_syntax_entry whatfor sel))
(************************
******* GRAMMAR ********
************************)
let _ =
declare_summary "GRAMMAR_LEXER"
{ freeze_function = Egrammar.freeze;
unfreeze_function = Egrammar.unfreeze;
init_function = Egrammar.init}
(* Tokens *)
let (inToken, outToken) =
declare_object
("TOKEN",
{ load_function = (fun _ -> ());
open_function = (fun _ -> ());
cache_function = (fun (_, s) -> Pcoq.lexer.Token.using ("", s));
specification_function = (fun x -> x)})
let add_token_obj s = Lib.add_anonymous_leaf (inToken s)
(* Grammar rules *)
let (inGrammar, outGrammar) =
declare_object
("GRAMMAR",
{ load_function = (fun (_, a) -> Egrammar.extend_grammar a);
open_function = (fun _ -> ());
cache_function = (fun (_, a) -> Egrammar.extend_grammar a);
specification_function = (fun x -> x)})
let add_grammar_obj univ al =
Lib.add_anonymous_leaf (inGrammar (Extend.interp_grammar_command univ al))
(* printing grammar entries *)
let print_grammar univ entry =
let u = get_univ univ in
let te = get_entry u entry in
match te with
| Ast e -> Gram.Entry.print e
| ListAst e -> Gram.Entry.print e
(* Infix, distfix *)
let split str =
let rec loop beg i =
if i < String.length str then
if str.[i] == ' ' then
if beg == i then
loop (succ beg) (succ i)
else
String.sub str beg (i - beg) :: loop (succ i) (succ i)
else
loop beg (succ i)
else if beg == i then
[]
else
[String.sub str beg (i - beg)]
in
loop 0 0
(* An infix or a distfix is a pair of a grammar rule and a pretty-printing rule
*)
let (inInfix, outInfix) =
declare_object
("INFIX",
{ load_function = (fun _ -> ());
open_function = (fun _ -> ());
cache_function =
(fun (_,(gr,se)) ->
Egrammar.extend_grammar gr;
Esyntax.add_ppobject {sc_univ="constr";sc_entries=se});
specification_function = (fun x -> x)})
let prec_assoc = function
| Some(Gramext.RightA) -> (":L",":E")
| Some(Gramext.LeftA) -> (":E",":L")
| Some(Gramext.NonA) -> (":L",":L")
| None -> (":E",":L") (* LEFTA by default *)
let constr_tab =
[| "constr0"; "constr1"; "constr2"; "constr3"; "lassoc_constr4";
"constr5"; "constr6"; "constr7"; "constr8"; "constr9"; "constr10" |]
let constr_rule n p = if p = ":E" then constr_tab.(n) else constr_tab.(n-1)
let nonterm_meta nt var = NonTerm(NtShort nt, ETast, Some var)
(* infix_syntax_entry : int -> string -> string -> grammar_entry
* takes precedence, infix op and prefix op and returns
* the corresponding Syntax entry *)
let infix_syntax_entry assoc n inf pref =
let (lp,rp) = match assoc with
| Some(Gramext.RightA) -> (Extend.L,Extend.E)
| Some(Gramext.LeftA) -> (Extend.E,Extend.L)
| Some(Gramext.NonA) -> (Extend.L,Extend.L)
| None -> (Extend.E,Extend.L) (* LEFTA by default *)
in
[{Extend.syn_id = pref^"_infix";
Extend.syn_prec = n,0,0;
Extend.syn_astpat =
Pnode
("APPLIST",
Pcons
(Pquote (Nvar ((0, 0), pref)),
Pcons (Pmeta ("$e1", Tany), Pcons (Pmeta ("$e2", Tany), Pnil))));
Extend.syn_hunks =
[Extend.UNP_BOX
(Extend.PpHOVB 1,
[Extend.PH (Pmeta ("$e1", Tany), None, lp);
Extend.UNP_BRK (0, 1); Extend.RO inf;
Extend.PH (Pmeta ("$e2", Tany), None, rp)])]}]
(* infix_gram_entry : int -> string -> string -> grammar_entry
* takes precedence, infix op and prefix op and returns
* the corresponding Grammar entry *)
let gram_infix assoc n infl pref =
let (lp,rp) = prec_assoc assoc in
let action =
Aast(Pnode("APPLIST",
Pcons(Pquote(nvar pref),
Pcons(Pmeta("$a",Tany),
Pcons(Pmeta("$b",Tany),Pnil)))))
in
{ gc_univ = "constr";
gc_entries =
[ { ge_name = constr_rule n ":E";
ge_type = ETast;
gl_assoc = None;
gl_rules =
[ { gr_name = pref^"_infix";
gr_production =
(nonterm_meta (constr_rule n lp) "$a")
::(List.map (fun s -> Term("", s)) infl)
@[nonterm_meta (constr_rule n rp) "$b"];
gr_action = action} ]
}
]
}
let add_infix assoc n inf pr =
(* check the precedence *)
if n<1 or n>10 then
errorlabstrm "Metasyntax.infix_grammar_entry"
[< 'sTR"Precedence must be between 1 and 10." >];
if (assoc<>None) & (n<6 or n>9) then
errorlabstrm "Vernacentries.infix_grammar_entry"
[< 'sTR"Associativity Precedence must be 6,7,8 or 9." >];
(* check the grammar entry *)
let gram_rule = gram_infix assoc n (split inf) pr in
(* check the syntax entry *)
let syntax_rule = infix_syntax_entry assoc n inf pr in
Lib.add_anonymous_leaf (inInfix(gram_rule,syntax_rule))
(* Distfix *)
(* Distfix LEFTA 7 "/ _ / _ /" app.*)
let rec make_symbols c_first c_next c_last new_var = function
| [] -> []
| ["_"] -> [nonterm_meta c_last ("$e"^(string_of_int new_var))]
| ("_"::sl) ->
let symb = nonterm_meta c_first ("$e"^(string_of_int new_var)) in
symb :: make_symbols c_next c_next c_last (new_var+1) sl
| s :: sl ->
let symb = Term("", s) in
symb :: make_symbols c_next c_next c_last new_var sl
let collect_metas sl =
List.fold_right
(fun it metatl ->
match it with
| NonTerm(_,_,Some m) -> Pcons(Pmeta(m,Tany),metatl)
| _ -> metatl)
sl Pnil
let distfix assoc n sl f =
let (lp,rp) = prec_assoc assoc in
let symbols =
make_symbols (constr_rule n lp) constr_tab.(8) (constr_rule n rp) 0 sl in
let action =
Aast(Pnode("APPLIST",Pcons(Pquote(nvar f), collect_metas symbols)))
in
{ gc_univ = "constr";
gc_entries =
[ { ge_name = constr_rule n ":E";
ge_type = ETast;
gl_assoc = None;
gl_rules =
[ { gr_name = f^"_distfix";
gr_production = symbols;
gr_action = action} ]
}
]
}
let add_distfix a n df f =
Lib.add_anonymous_leaf (inInfix(distfix a n (split df) f, []))
|
