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
|
;;; coq-db.el --- coq keywords database utility functions
;;
;; Author: Pierre Courtieu <courtieu@lri.fr>
;; License: GPL (GNU GENERAL PUBLIC LICENSE)
;;
;;; We store all information on keywords (tactics or command) in big
;; tables (ex: `coq-tactics-db') From there we get: menus including
;; "smart" commands, completions for command coq-insert-...
;; abbrev tables and font-lock keyword
;;; real value defined below
;;; Commentary:
;;
;;; Code:
;(require 'proof-config) ; for proof-face-specs, a macro
;(require 'holes)
(defconst coq-syntax-db nil
"Documentation-only variable, for coq keyword databases.
Each element of a keyword database contains the definition of a \"form\", of the
form:
(MENUNAME ABBREV INSERT STATECH KWREG INSERT-FUN HIDE)
MENUNAME is the name of form (or form variant) as it should appear in menus or
completion lists.
ABBREV is the abbreviation for completion via \\[expand-abbrev].
INSERT is the complete text of the form, which may contain holes denoted by
\"#\" or \"@{xxx}\".
If non-nil the optional STATECH specifies that the command is not state
preserving for coq.
If non-nil the optional KWREG is the regexp to colorize correponding to the
keyword. ex: \"simple\\\\s-+destruct\" (\\\\s-+ meaning \"one or more spaces\").
*WARNING*: A regexp longer than another one should be put FIRST. For example:
(\"Module Type\" ... ... t \"Module\\s-+Type\")
(\"Module\" ... ... t \"Module\")
Is ok because the longer regexp is recognized first.
If non-nil the optional INSERT-FUN is the function to be called when inserting
the form (instead of inserting INSERT, except when using \\[expand-abbrev]). This
allows to write functions asking for more information to assist the user.
If non-nil the optional HIDE specifies that this form should not appear in the
menu but only in interactive completions.
Example of what could be in your emacs init file:
(defvar coq-user-tactics-db
'(
(\"mytac\" \"mt\" \"mytac # #\" t \"mytac\")
(\"myassert by\" \"massb\" \"myassert ( # : # ) by #\" t \"assert\")
))
Explanation of the first line: the tactic menu entry mytac, abbreviated by mt,
will insert \"mytac # #\" where #s are holes to fill, and \"mytac\" becomes a
new keyword to colorize." )
(defun coq-insert-from-db (db prompt)
"Ask for a keyword, with completion on keyword database DB and insert.
Insert corresponding string with holes at point. If an insertion function is
present for the keyword, call it instead. see `coq-syntax-db' for DB
structure."
(let* ((tac (completing-read (concat prompt " (tab for completion) : ")
db nil nil))
(infos (cddr (assoc tac db)))
(s (car infos)) ; completion to insert
(f (car-safe (cdr-safe (cdr-safe (cdr infos))))) ; insertion function
(pt (point)))
(if f (funcall f) ; call f if present
(insert (or s tac)) ; insert completion and indent otherwise
(holes-replace-string-by-holes-backward-jump pt)
(indent-according-to-mode))))
(defun coq-build-regexp-list-from-db (db &optional filter)
"Take a keyword database DB and return the list of regexps for font-lock.
If non-nil Optional argument FILTER is a function applying to each line of DB.
For each line if FILTER returns nil, then the keyword is not added to the
regexp. See `coq-syntax-db' for DB structure."
(let ((l db) (res ()))
(while l
(let* ((hd (car l)) (tl (cdr l)) ; hd is the first infos list
(e1 (car hd)) (tl1 (cdr hd)) ; e1 = menu entry
(e2 (car tl1)) (tl2 (cdr tl1)) ; e2 = abbreviation
(e3 (car tl2)) (tl3 (cdr tl2)) ; e3 = completion
(e4 (car-safe tl3)) (tl4 (cdr-safe tl3)) ; e4 = state changing
(e5 (car-safe tl4)) (tl5 (cdr-safe tl4)) ; e5 = colorization string
)
;; TODO delete doublons
(when (and e5 (or (not filter) (funcall filter hd)))
(setq res (nconc res (list e5)))) ; careful: nconc destructive!
(setq l tl)))
res
))
;; Computes the max length of strings in a list
(defun max-length-db (db)
"Return the length of the longest first element (menu label) of DB.
See `coq-syntax-db' for DB structure."
(let ((l db) (res 0))
(while l
(let ((lgth (length (car (car l)))))
(setq res (max lgth res))
(setq l (cdr l))))
res))
(defun coq-build-menu-from-db-internal (db lgth menuwidth)
"Take a keyword database DB and return one insertion submenu.
Argument LGTH is the max size of the submenu. Argument MENUWIDTH is the width
of the largest line in the menu (without abbrev and shortcut specifications).
Used by `coq-build-menu-from-db', which you should probably use instead. See
`coq-syntax-db' for DB structure."
(let ((l db) (res ()) (size lgth)
(keybind-abbrev (substitute-command-keys " \\[expand-abbrev]")))
(while (and l (> size 0))
(let* ((hd (car l))(tl (cdr l)) ; hd is a list of length 3 or 4
(e1 (car hd)) (tl1 (cdr hd)) ; e1 = menu entry
(e2 (car tl1)) (tl2 (cdr tl1)) ; e2 = abbreviation
(e3 (car tl2)) (tl3 (cdr tl2)) ; e3 = completion
(e4 (car-safe tl3)) (tl4 (cdr-safe tl3)) ; e4 = state changing
(e5 (car-safe tl4)) (tl5 (cdr-safe tl4)) ; e5 = colorization string
(e6 (car-safe tl5)) ; e6 = function for smart insertion
(e7 (car-safe (cdr-safe tl5))) ; e7 = if non-nil : hide in menu
(entry-with (max (- menuwidth (length e1)) 0))
(spaces (make-string entry-with ? ))
;;(restofmenu (coq-build-menu-from-db-internal tl (- size 1) menuwidth))
)
(when (not e7) ;; if not hidden
(let ((menu-entry
(vector
;; menu entry label
(concat e1 (if (not e2) "" (concat spaces "(" e2 keybind-abbrev ")")))
;;insertion function if present otherwise insert completion
(if e6 e6 `(holes-insert-and-expand ,e3))
t)))
(setq res (nconc res (list menu-entry)))));; append *in place*
(setq l tl)
(setq size (- size 1))))
res))
(defun coq-build-title-menu (db size)
"Build a title for the first submenu of DB, of size SIZE.
Return the string made of the first and the SIZE nth first element of DB,
separated by \"...\". Used by `coq-build-menu-from-db'. See `coq-syntax-db'
for DB structure."
(concat (car-safe (car-safe db))
" ... "
(car-safe (car-safe (nthcdr (- size 1) db)))))
(defun coq-sort-menu-entries (menu)
(sort menu
'(lambda (x y) (string<
(downcase (elt x 0))
(downcase (elt y 0))))))
(defun coq-build-menu-from-db (db &optional size)
"Take a keyword database DB and return a list of insertion menus for them.
Submenus contain SIZE entries (default 30). See `coq-syntax-db' for DB
structure."
;; sort is destructive for the list, so copy list before sorting
(let* ((l (coq-sort-menu-entries (copy-list db))) (res ())
(wdth (+ 2 (max-length-db db)))
(sz (or size 30)) (lgth (length l)))
(while l
(if (<= lgth sz)
(setq res ;; careful: nconc destructive!
(nconc res (list (cons
(coq-build-title-menu l lgth)
(coq-build-menu-from-db-internal l lgth wdth)))))
(setq res ; careful: nconc destructive!
(nconc res (list (cons
(coq-build-title-menu l sz)
(coq-build-menu-from-db-internal l sz wdth))))))
(setq l (nthcdr sz l))
(setq lgth (length l)))
res))
(defun coq-build-abbrev-table-from-db (db)
"Take a keyword database DB and return an abbrev table.
See `coq-syntax-db' for DB structure."
(let ((l db) (res ()))
(while l
(let* ((hd (car l))(tl (cdr l)) ; hd is a list of length 3 or 4
(e1 (car hd)) (tl1 (cdr hd)) ; e1 = menu entry
(e2 (car tl1)) (tl2 (cdr tl1)) ; e2 = abbreviation
(e3 (car tl2)) (tl3 (cdr tl2)) ; e3 = completion
)
;; careful: nconc destructive!
(when e2
(setq res (nconc res (list `(,e2 ,e3 holes-abbrev-complete)))))
(setq l tl)))
res))
(defun filter-state-preserving (l)
; checkdoc-params: (l)
"Not documented."
(not (nth 3 l))) ; fourth argument is nil --> state preserving command
(defun filter-state-changing (l)
; checkdoc-params: (l)
"Not documented."
(nth 3 l)) ; fourth argument is nil --> state preserving command
;;A new face for tactics which fail when they don't kill the current goal
(defface coq-solve-tactics-face
(proof-face-specs
(:foreground "red" t) ; pour les fonds clairs
(:foreground "red" t) ; pour les fond foncés
()) ; pour le noir et blanc
"Face for names of closing tactics in proof scripts."
:group 'proof-faces)
(defconst coq-solve-tactics-face 'coq-solve-tactics-face
"Expression that evaluates to a face.
Required so that 'proof-solve-tactics-face is a proper facename")
(provide 'coq-db)
;;; coq-db.el ends here
;** Local Variables: ***
;** fill-column: 80 ***
;** End: ***
|
