Source file syntax.ml
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
(** This module defines the shallow abstract syntax for an error specification
file (.lrgrep). It includes types for representing locations, symbols, regular
expressions, semantic actions, and the overall structure of a lexer
definition. *)
open Utils
(** {1 The shallow abstract syntax} *)
(** Kind of quantifier used in regular expressions. *)
type quantifier_kind =
| Longest
| Shortest
type position = Lexing.position
(** This represents a piece of OCaml code, as appearing in semantic
actions, as well as in the header and trailer. *)
type ocaml_code = position * string
(** A grammar symbol (a terminal or a non-terminal) *)
type symbol =
| Name of string
(** Symbols are usually simple names, like 'a' or 'X'. *)
| Apply of string * symbol list
(** Menhir supports higher-order non-terminals. In this case, a symbol is
the application of the higher-order non-terminal to some arguments.
E.g separated_list(sep, X) is represented as:
[Apply ("separated_list", [Name "sep"; Name "X"])] *)
(** A wildcard symbol is either a symbol or '_'. *)
type wild_symbol = symbol option
(** Symbols used in filter globbing expressions to specify matching criteria. *)
type filter_symbol =
| Skip
| Find of wild_symbol
| Dot
(** [regular_desc] describes the different cases of the regular expression
syntax. *)
type regular_desc =
| Atom of string option * wild_symbol * Usage.mark
(** [Atom (capture, sym,_)] represents the base cases ([symbol] and [_]). *)
| Alternative of regular_expr list
(** A disjunction of multiple expressions.
[e1 | e2 | e3] is represented as [Alternative [e1; e2; e3]] *)
| Repetition of {
expr: regular_expr;
policy: quantifier_kind;
}
(** [Repetition e] represents [e*] and [e**] *)
| Reduce of {
capture: string option;
mark: Usage.mark;
expr: regular_expr;
policy: quantifier_kind;
}
(** [Reduce {expr; _}] represents [[expr]] and [[[expr]]]. *)
| Concat of regular_expr list
(** [Concat [e1; e2; ..]] is [e1; e2; ...] *)
| Filter of filter
(** [Filter f] represents [/foo: bar...] *)
(** [regular_expr] adds position information to [regular_desc] for error
reporting purposes. *)
and regular_expr = {
desc: regular_desc;
position: position; (** the position where this term ends *)
}
and filter = {
lhs: wild_symbol option;
rhs: (filter_symbol * position) list;
}
(** The semantic action associated to a pattern *)
type clause_action =
| Total of ocaml_code (** ... { code }, normal semantic action **)
| Partial of ocaml_code (** ... partial { ... }, a semantic action that can
return [None] to continue matching *)
| Unreachable of position (** [... { . }] the pattern should never match *)
(** A pattern is a combination of a regular expression and an optional list
of lookahead constraints. *)
type pattern = {
expr: regular_expr; (** the pattern *)
lookaheads: (symbol * position) list; (** restrict matching to these lookahead terminals, or [] for all terminals *)
}
(** A clause is a pair of a pattern and an action, representing one rule. *)
type clause = {
patterns: pattern list;
action: clause_action; (** the semantic action *)
}
type clause_group = clause list
(** A rule in .lrgrep file is represented by the [rule] type. *)
type rule = {
name : string;
(** Name of the rule *)
error : bool * position;
(** [error] is true if this entry only matches failing stacks.
Syntactically, an error entry has the form:
rule x ... = parse error
| ...
*)
startsymbols: (string * position) list;
(** The list of entrypoints to support, or [] for all entrypoints. *)
args : string list;
(** The list of OCaml arguments to abstract over,
e.g the [x y] in [rule foo x y = ...] *)
clauses : clause_group list;
(** The list of clauses to match *)
}
(** An .lrgrep file is an header containing some OCaml code, one or more entries,
and a trailer with some other OCaml code. *)
type lexer_definition = {
header : ocaml_code;
rules : rule list;
trailer : ocaml_code;
}
(** {1 Helper and cmoning functions} *)
(** Convert a location to a Cmon record. *)
let cmon_position {Lexing. pos_fname; pos_bol; pos_cnum; pos_lnum} =
Cmon.(record [
"filename" , string pos_fname;
"line" , int pos_lnum;
"column" , int (pos_cnum - pos_bol);
"offset" , int pos_cnum;
])
(** Convert an OCaml code to a Cmon tuple. *)
let cmon_ocamlcode (location, code) =
Cmon.tuple [
cmon_position location;
Cmon.string code;
]
(** Convert a function and a position to a Cmon pair. *)
let cmon_positioned f =
Utils.Misc.cmon_pair f cmon_position
(** Convert an option to a Cmon value. *)
let cmon_option f = function
| None -> Cmon.constant "None"
| Some x -> Cmon.constructor "Some" (f x)
(** Convert a symbol to a Cmon value. *)
let rec cmon_symbol = function
| Name sym -> Cmon.constructor "Name" (Cmon.string sym)
| Apply (sym, args) -> Cmon.construct "Apply" [
Cmon.string sym;
Cmon.list (List.map cmon_symbol args);
]
(** Convert a capture to a Cmon value. *)
let cmon_capture cap =
cmon_option Cmon.string cap
(** Convert a wildcard symbol to a Cmon value. *)
let cmon_wild_symbol sym =
cmon_option cmon_symbol sym
(** Convert a filter symbol to a Cmon value. *)
let cmon_filter_symbol = function
| Skip -> Cmon.constant "Skip"
| Dot -> Cmon.constant "Dot"
| Find sym -> cmon_wild_symbol sym
let cmon_quantifier_kind = function
| Longest -> Cmon.constant "Longest"
| Shortest -> Cmon.constant "Shortest"
let cmon_usage_mark _ = Cmon.constant "<Usage.mark>"
let rec cmon_regular_term = function
| Atom (cap, sym, mark) ->
Cmon.construct "Atom" [cmon_capture cap; cmon_wild_symbol sym; cmon_usage_mark mark]
| Alternative res ->
Cmon.constructor "Alternative" (Cmon.list_map cmon_regular_expression res)
| Concat res ->
Cmon.constructor "Concat" (Cmon.list_map cmon_regular_expression res)
| Repetition {policy; expr} ->
Cmon.crecord "Repetition" [
"expr", cmon_regular_expression expr;
"policy", cmon_quantifier_kind policy;
]
| Reduce {capture; mark; policy; expr} ->
Cmon.crecord "Reduce" [
"capture", cmon_capture capture;
"mark", cmon_usage_mark mark;
"expr", cmon_regular_expression expr;
"policy", cmon_quantifier_kind policy;
]
| Filter {lhs; rhs} ->
Cmon.crecord "Filter" [
"lhs", cmon_option cmon_wild_symbol lhs;
"rhs", Cmon.list_map (cmon_positioned cmon_filter_symbol) rhs;
]
(** Convert a regular expression to a Cmon value. *)
and cmon_regular_expression re =
Cmon.record [
"desc", cmon_regular_term re.desc;
"position", cmon_position re.position;
]
(** Convert a clause action to a Cmon value. *)
let cmon_clause_action = function
| Unreachable pos -> Cmon.constructor "Unreachable" (cmon_position pos)
| Total code -> Cmon.constructor "Total" (cmon_ocamlcode code)
| Partial code -> Cmon.constructor "Partial" (cmon_ocamlcode code)
(** Convert a pattern to a Cmon value. *)
let cmon_pattern {expr; lookaheads} =
Cmon.record [
"expr", cmon_regular_expression expr;
"lookaheads", Cmon.list_map (cmon_positioned cmon_symbol) lookaheads;
]
(** Convert a clause to a Cmon value. *)
let cmon_clause {patterns; action} =
Cmon.crecord "Clause" [
"patterns", Cmon.list_map cmon_pattern patterns;
"action", cmon_clause_action action;
]
(** Convert a rule to a Cmon value. *)
let cmon_rule {error; startsymbols; name; args; clauses} =
Cmon.record [
"startsymbols", Cmon.list_map (cmon_positioned Cmon.string) startsymbols;
"error", cmon_positioned Cmon.bool error;
"name", Cmon.string name;
"args", Cmon.list_map Cmon.string args;
"clauses", Cmon.list_map (Cmon.list_map cmon_clause) clauses;
]
(** Convert a lexer definition to a Cmon value. *)
let cmon_definition {; rules; trailer} : Cmon.t =
Cmon.record [
"header", cmon_ocamlcode header;
"rules", Cmon.list (List.map cmon_rule rules);
"trailer", cmon_ocamlcode trailer;
]
(** The role of a captured value in a regular expression: captures only the
start or end location, captures the value (and its location) *)
type capture_kind = Start_loc | End_loc | Value
(** Print position for error or warning messages *)
let gnu_position (pos : Lexing.position) =
if pos = Lexing.dummy_pos then
"lrgrep"
else if pos.pos_cnum > -1 then
Printf.sprintf "%s:%d.%d" pos.pos_fname pos.pos_lnum (pos.pos_cnum - pos.pos_bol)
else if pos.pos_lnum > 0 then
Printf.sprintf "%s:%d" pos.pos_fname pos.pos_lnum
else
pos.pos_fname
(** Report a warning *)
let warn (pos : Lexing.position) fmt =
Printf.eprintf "%s: warning: " (gnu_position pos);
Printf.kfprintf (fun oc -> output_char oc '\n'; flush oc) stderr fmt
(** Report an error *)
let error (pos : Lexing.position) fmt =
Printf.eprintf "%s: error: " (gnu_position pos);
Printf.kfprintf (fun oc -> output_char oc '\n'; flush oc; exit 1) stderr fmt
let nonfatal_error (pos : Lexing.position) fmt =
Printf.eprintf "%s: error: " (gnu_position pos);
Printf.kfprintf (fun oc -> output_char oc '\n'; flush oc) stderr fmt