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
|
; The text structure is supposed to be given by annotations of the
; form %annotation text|annotated text@, The % and @ signs act as
; opening and closing parentheses, so that the annotated text may itself
; contain extra annotations. Analysing this structure yields the
; uncorrupted text (only "annotated text"), but the annotation are recorded
; into Emacs Extents that span over the text.
;To construct these extents, one scans the whole text for the characters
; % and @. When finding a %, its location is simply kept on a stack
; *location-stack*. When finding a @, one looks in the stack to get
; the position of the last % and creates an extent with these two positions.
; The annotation is then removed and stored in the extent's properties
; and the last bits are cleared.
(defun analyse-structure ()
(map-extents
(lambda (ext maparg)
(when (extent-property ext 'lego-pbp) (delete-extent ext))))
(beginning-of-buffer)
(setq *location-stack* ())
(setq *extent-count* 0)
(while (search-forward "Discharge.. " () t)
(beginning-of-line)
(kill-line))
(beginning-of-buffer)
(while (re-search-forward "[%@&]" () t)
(cond ((string= (char-to-string (preceding-char)) "%")
(progn (delete-backward-char 1)(location-push (point))))
((string= (char-to-string (preceding-char)) "&")
(let ((previous-ampersand (location-pop)))
(if previous-ampersand (make-top-extent previous-ampersand))
(delete-backward-char 1)
(location-push (point))))
(t (make-pbp-extent))))
(end-of-buffer)
(make-top-extent (location-pop)))
(defun make-top-extent (previous-ampersand)
(save-excursion
(beginning-of-line) (backward-char)
(let ((extent (make-extent previous-ampersand (point))))
(set-extent-property extent 'mouse-face 'highlight)
(set-extent-property extent 'lego-top-element
(compute-extent-name extent))
(set-extent-property extent 'keymap *lego-pbp-keymap*))))
(defun make-pbp-extent ()
(let ((extent (make-extent (or (location-pop) 1) (point))))
(set-extent-property extent 'mouse-face 'highlight)
(set-extent-property extent 'keymap *lego-pbp-keymap*)
(let ((pos1 (extent-start-position extent))
(annot()))
(goto-char pos1)
(if (search-forward "|" () t)
(progn
(setq annot
(buffer-substring pos1 (- (point) 1)))
(delete-region pos1 (point))
(set-extent-property extent 'lego-pbp annot)))
(goto-char (extent-end-position extent))
(delete-backward-char 1))))
(defun compute-extent-name (extent)
(save-excursion
(goto-char (extent-start-position extent))
; the search for an hypothesis name is ambiguous: any binder in
; logical formula will be recognized. This is why we have to
; check first that we are not in a goal, and then look for the
; first identifier.
(if (re-search-forward " *\\?\\([0-9][0-9]*\\) *:"
(extent-end-position extent) t)
(cons 'goal (match-string 1))
(if (re-search-forward "\\([a-zA-Z][a-zA-Z_0-9]*\\) *:"
(extent-end-position extent) t)
(cons 'hyp (match-string 1))
(bug "top element does not start with a name")))))
; Receiving the data from Lego is performed that a filter function
; added among the comint-output-filter-functions of the shell-mode.
; This function is a two state function. It may happen that the
; last string that was processed was in the middle of a goal listing,
; in this case one must go on reading the rest of the goals.
(defun lego-filter (string)
(cond ( *lego-in-goals-output*
(save-excursion
(set-buffer *lego-goals* )
(end-of-buffer)
(insert-string string *lego-goals*)
(lego-analyse-buffer)))
(t (save-excursion
(set-buffer *lego-tmp-goals*)
(erase-buffer)
(insert-string string)
(end-of-buffer)
(cond ((search-backward "-- Start of Goals --" () t)
(end-of-line)
(delete-region 1 (point))
(set-buffer *lego-goals*)
(erase-buffer)
(insert-buffer *lego-tmp-goals*)
(lego-analyse-buffer))
((search-backward "KillRef: ok, not in proof state" () t)
(set-buffer *lego-goals*)
(erase-buffer))
((search-backward "-- Pbp result --" () t)
(end-of-line)
(delete-region 1 (point))
(search-forward "-- End Pbp result --" () t)
(beginning-of-line)
(delete-region (- (point) 1) (point-max))
(if *script-buffer*
(progn (set-buffer *script-buffer*)
(end-of-buffer)
(insert-buffer *lego-tmp-goals*)
(set-buffer *lego-tmp-goals*)))
(proof-simple-send
(buffer-substring 1 (point-max)))
(erase-buffer)))))))
(defun lego-analyse-buffer ()
(beginning-of-buffer)
(cond ((search-forward "*** QED ***" () t)
(beginning-of-line)
(delete-region 1 (point))
(end-of-line)
(delete-region (point) (point-max)))
((search-forward "-- End of Goals --" () t)
(backward-char 18)
(delete-region (point)(point-max))
(setq *lego-in-goals-output* ())
(analyse-structure))
(t (end-of-buffer)
(setq *lego-in-goals-output* t))))
(defvar *lego-in-goals-output* ())
(defvar *script-buffer*)
(defun lego-goals-init ()
(setq *lego-tmp-goals* (get-buffer-create "*lego-tmp-goals*"))
(setq *lego-goals* (get-buffer-create "*lego goals*"))
(bury-buffer *lego-tmp-goals*))
; Now, using the extents in a mouse behavior is quite simple:
; from the mouse position, find the relevant extent, then get its annotation
; and produce a piece of text that will be inserted in the right buffer.
; Attaching this behavior to the mouse is simply done by attaching a keymap
; to all the extents.
(defvar *lego-pbp-keymap*)
(setq *lego-pbp-keymap*
(make-keymap 'Lego-PBP-keymap))
(define-key *lego-pbp-keymap* 'button1
'pbp-button-action)
(defun pbp-button-action (event)
(interactive "e")
(mouse-set-point event)
(pbp-construct-command))
(defun pbp-construct-command ()
(let ((ext (extent-at (point) () 'lego-pbp))
(top-ext (extent-at (point) () 'lego-top-element)))
(cond ((and (extentp top-ext) (extentp ext))
(let ((path (extent-property ext 'lego-pbp))
(top-info (extent-property top-ext 'lego-top-element)))
(proof-simple-send
(if (eq 'hyp (car top-info))
(concat "PbpHyp " (cdr top-info) " " path ";")
(concat "Pbp " (cdr top-info) " " path ";")))))
((extentp top-ext)
(let ((top-info (extent-property top-ext 'lego-top-element)))
(let ((value (if (eq 'hyp (car top-info))
(concat "Refine " (cdr top-info) ";")
(concat "Next +" (cdr top-info) ";"))))
(proof-simple-send
value)
(if *script-buffer*
(progn (set-buffer *script-buffer*)
(end-of-buffer)
(insert-string value)))))))))
; a little package to manage a stack of locations
(defun location-push (value)
(setq *location-stack* (cons value *location-stack*)))
(defun location-pop ()
(if *location-stack*
(let ((result (car *location-stack*)))
(setq *location-stack* (cdr *location-stack*))
result)))
(defvar *location-stack* ())
(provide 'ext)
|
