-
Notifications
You must be signed in to change notification settings - Fork 125
/
surfaceAstXmlPattern.ml
280 lines (259 loc) · 10.3 KB
/
surfaceAstXmlPattern.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
(*
Copyright © 2011 MLstate
This file is part of OPA.
OPA is free software: you can redistribute it and/or modify it under the
terms of the GNU Affero General Public License, version 3, as published by
the Free Software Foundation.
OPA is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for
more details.
You should have received a copy of the GNU Affero General Public License
along with OPA. If not, see <http://www.gnu.org/licenses/>.
*)
(**
*)
(* depends *)
module List = BaseList
(* HACK : please, clean-up in opa lang *)
module Parser_utils = OpaParserUtils
open SurfaceAst
module C = SurfaceAstCons.StringCons
module I = Opacapi
let fresh_name = Parser_utils.fresh_name
let (!) = C.E.ident
let (&) = C.E.applys
let option_bind e (pat,expr) =
C.E.match_opt e
(C.P.none (), C.E.none ())
(C.P.some pat, expr)
let pattern_of_opt = function
| None -> C.P.any ()
| Some name -> C.P.ident name
let try_parse_opt () =
C.E.dot !"Parser" "try_parse_opt"
let try_parse () =
C.E.dot !"Parser" "try_parse"
let flatten_and_discard_whitespace_list () =
C.E.dot !"Xml_parser" "flatten_and_discard_whitespace_list"
(*
let may_be_compatible patterns1 patterns2 =
match patterns1, patterns2 with
| [], _
| _, [] -> assert false (* cannot parse empty sequences *)
| p1 :: _, p2 :: _ ->
match p1, p2 with
| XmlNode _, XmlParser _ -> false
| XmlParser _, XmlNode _ -> false
| XmlNode ({namespace=(ns1,_);name=(n1,_)},_,_),
XmlNode ({namespace=(ns2,_);name=(n2,_)},_,_) ->
ns1 = ns2 && n1 = n2
| XmlAny, _
| _, XmlAny
| XmlExpr _, _
| _, XmlExpr _ -> true
| XmlParser _, XmlParser _ ->
true (* FIXME: actually, we should regroup these two parsers
* into one, so that trx can compile it possibly in a smarter way *)
*)
let process_attribute name (attr,name_opt,attr_check) content =
let expr = !I.Xml.find_attr & [!name; attr.namespace; Parser_utils.string2 attr.name] in
let bound_ident =
match name_opt with
| None -> C.P.ident ~label:(snd attr.name) (fst attr.name)
| Some bound_name -> C.P.ident bound_name in
let attrParser parser_ =
let val_name = Parser_utils.fresh_name ~name:"value" () in
let match_attr content =
C.E.match_opt expr
(C.P.none (), C.E.none ())
(C.P.some (C.P.ident val_name), content) in
let match_attr_val =
C.E.match_opt (try_parse () & [parser_; !val_name])
(C.P.none (), C.E.none ())
(C.P.some bound_ident, content) in
match_attr match_attr_val
in
match attr_check with
| XmlAttrStringParser se ->
(* convert the string to a parser (no more magic for that) *)
attrParser (!I.Parser.of_string & [se])
| XmlAttrParser parser_ -> attrParser parser_
| XmlExists ->
C.E.match_opt expr
(C.P.none (), C.E.none ())
(C.P.some (C.P.any ()), content)
| XmlName ->
C.E.match_opt expr
(C.P.none (), C.E.none ())
(C.P.some bound_ident, content)
let process_attributes (name:string) list content =
List.fold_right (fun attr_node acc ->
process_attribute name attr_node acc
) list content
let error_suffix_anonymous_parser annot =
let context = OpaError.Context.annot annot in
OpaError.error context (
"You cannot have a @{<bright>suffix@} on a tag.@\n"^^
"@[<2>@{<bright>Hint@}:@\nPlease use an @{<bright>anonymous@} parser instead.@]@\n"
)
let rec process_named_pattern named_pattern l tl acc =
match (named_pattern : _ xml_named_pattern) with
| (name, XmlLetIn (bindings, subpattern), suffix) ->
C.E.letand bindings (process_named_pattern (name, subpattern, suffix) l tl acc)
| (name, XmlAny, suffix) ->
( match suffix with
| None ->
C.E.match_ !l
[ C.P.nil (), C.E.none ()
; C.P.hd_tl (pattern_of_opt name) (C.P.var tl), acc ]
| Some (Xml_star,_) ->
let acc = C.E.letin tl (C.E.nil ()) acc in
( match name with
| None -> acc
| Some name -> C.E.letin name !l acc
)
| Some (Xml_plus,_) ->
let acc = C.E.letin tl (C.E.nil ()) acc in
C.E.match_ !l
[ C.P.nil (), C.E.none ()
; C.P.hd_tl (C.P.any ()) (C.P.any ()),
(match name with
| None -> acc
| Some name -> C.E.letin name !l acc)]
| Some (Xml_question,_) ->
let i = fresh_name ~name:"question" () in
let v =
C.E.match_ !l
[ C.P.nil (), C.E.tuple_2 (C.E.none ()) (C.E.nil ())
; C.P.hd_tl (C.P.ident "hd") (C.P.ident "tl"), C.E.tuple_2 (C.E.some !"hd") !"tl"] in
C.E.letin i v
(C.E.match_ !i
[ C.P.tuple_2 (pattern_of_opt name) (C.P.ident tl), acc ])
| Some (Xml_number e,_) ->
C.E.match_opt (C.E.applys !I.List.split_at_opt [e;!l])
(C.P.none (), C.E.none ())
(C.P.some (C.P.tuple_2 (pattern_of_opt name) (C.P.ident tl)), acc)
| Some (Xml_range (e1,e2),_) ->
C.E.match_opt (C.E.applys !I.List.split_between [!l;e1;e2])
(C.P.none (), C.E.none ())
(C.P.some (C.P.tuple_2 (pattern_of_opt name) (C.P.ident tl)), acc)
)
| (name, XmlExpr e, suffix) ->
let res =
match suffix with
| None -> C.E.applys e [!l]
| Some (Xml_star,_) -> C.E.applys !I.Xml.match_star [e; !l]
| Some (Xml_plus,_) -> C.E.applys !I.Xml.match_plus [e; !l]
| Some (Xml_question,_) -> C.E.applys !I.Xml.match_question [e; !l]
| Some (Xml_number e1,_) -> C.E.applys !I.Xml.match_number [e; e1; !l]
| Some (Xml_range (e1,e2),_) -> C.E.applys !I.Xml.match_range [e; e1; e2; !l] in
C.E.match_opt res
(C.P.none (), C.E.none ())
(C.P.some (C.P.tuple_2 (pattern_of_opt name) (C.P.ident tl)), acc)
| (_name,XmlNode (tag,attr,children),suffix) -> (
match suffix with
| None ->
let mkstring (string,label) = C.P.string ~label string in
let attrs = fresh_name ~name:"attrs" () in
let args = fresh_name ~name:"args" () in
let ns = fresh_name ~name:"ns" () in
let k e =
C.E.match_ !l
[ C.P.hd_tl (
C.P.coerce_name
(C.P.record [ "namespace", C.P.var ns
; "tag", mkstring tag.name
; "args", (if attr = [] then C.P.any () else C.P.var attrs)
; "content", (if children = [] then C.P.any () else C.P.var args)
; "specific_attributes", C.P.any ()])
Opacapi.Types.xml
) (C.P.ident tl), e
; C.P.any (), C.E.none () ] in
let k e =
k (
C.E.if_ (C.E.applys !I.(==) [tag.namespace; C.E.var ns])
e
(C.E.none ())
) in
k (
if children = [] then (
process_attributes attrs attr
acc
) else (
let last_name = fresh_name ~name:"dontcare" () in
process_attributes attrs attr
(C.E.letin args (flatten_and_discard_whitespace_list () & [!args])
(process_named_patterns args children last_name
acc))
)
)
| Some (_suffix,annot) ->
(* instance of error: xml_parser <mlk> <mlk/>* </> -> {}
* happens because in xml_parser <mlk> <mlk a=_/>* </>, what should be the type of a?
* each nesting inside a star/plus/... could create a list, but it isn't
* done and it hasn't been asked for *)
error_suffix_anonymous_parser annot
)
| (_, XmlParser _, Some (_suffix,annot)) ->
(* same problem as above, XmlParser may bind variables *)
error_suffix_anonymous_parser annot
| (name, XmlParser items, None) ->
assert (name = None); (* see the parser *)
let item = List.hd items in
let trx_expr =
(Trx_ast.Expr
[({ Trx_ast.seq_items = items
; Trx_ast.seq_code = Some acc },
Parser_utils.nlabel item)], Parser_utils.nlabel item) in
let p = fresh_name ~name:"p" () in
let res = fresh_name ~name:"res" () in
C.E.match_ !l
[ C.P.hd_tl
(C.P.coerce_name (C.P.record ["text", C.P.var res]) Opacapi.Types.xml)
(C.P.var tl),
C.E.letin p (SurfaceAstTrx.translate_rule trx_expr)
(try_parse_opt () & [C.E.var p; C.E.var res])
; C.P.any (), C.E.none () ]
and process_named_patterns name named_patterns last_name e : (_,_) expr =
let acc, _ =
List.fold_right_i
(fun (named_pattern : _ xml_named_pattern) i (acc,tl) ->
let l = if i = 0 then name else fresh_name ~name:"l" () in
(process_named_pattern named_pattern l tl acc,l)
) named_patterns (e,last_name) in
acc
(* FIXME: imcompatible patterns could be merged in one pattern
* xml_parser
* | <mlk/> -> ...
* | <poi/> -> ...
* could be compiled to
* match xmls with
* | [<mlk/>|rest] -> ...
* | [<poi/>|rest] -> ... /* no backtracking possible between those two cases */
* | _ -> ...
*)
let process_rule name (patterns,e) : (_,_) expr =
let last_name = fresh_name ~name:"last_name" () in
let res = C.E.some (C.E.tuple_2 e (C.E.ident last_name)) in
process_named_patterns name patterns last_name res
let process_rules name l =
let last_none = C.E.none () in
List.fold_right_i
(fun rule_ i acc ->
let n = fresh_name ~name:(Printf.sprintf "case_%d" i) () in
if acc == last_none then
process_rule name rule_ (* avoid a stupid match *)
else
C.E.letin n (process_rule name rule_)
(C.E.match_opt !n
(C.P.none (), acc)
(C.P.ident "res", !"res"))) l last_none
let process_parser _e rules =
#<If:SA_XML_PATTERN>
Format.printf "%a@." OpaPrint.string#expr _e
#<End>;
let xmls = fresh_name ~name:"xmls" () in
let body = process_rules xmls rules in
let body = Parser_utils.around_xmlns body in
C.E.lambda_var xmls body