parser.ml 15.8 KB
Newer Older
1 2
open Location
open Ast
3
open Ident
4
open Printf
5

6
(*
7
let ()  = Grammar.error_verbose := true
8
*)
9

10

11 12
let gram    = Grammar.gcreate (Wlexer.lexer Wlexer.token Wlexer.latin1_engine)

13 14 15 16
let true_atom = Atoms.mk_ascii "true"
let false_atom = Atoms.mk_ascii "false"
let true_type = Types.atom (Atoms.atom true_atom)
let false_type = Types.atom (Atoms.atom false_atom)
17

18 19
let parse_ident = Encodings.Utf8.mk_latin1

20 21
let id_dummy = ident (U.mk "$$$")
let atom s = Atoms.mk (parse_ident s)
22
let label s = LabelPool.mk (parse_ident s)
23
let ident s = ident (parse_ident s)
24

25
let prog    = Grammar.Entry.create gram "prog"
26
let top_phrases   = Grammar.Entry.create gram "toplevel phrases"
27 28 29 30 31
let expr    = Grammar.Entry.create gram "expression"
let pat     = Grammar.Entry.create gram "type/pattern expression"
let regexp  = Grammar.Entry.create gram "type/pattern regexp"
let const   = Grammar.Entry.create gram "scalar constant"
		
32 33
let exp pos e = LocatedExpr (loc_of_pos pos,e)

34 35 36 37 38
let rec multi_prod loc = function
  | [ x ] -> x
  | x :: l -> mk loc (Prod (x, multi_prod loc l))
  | [] -> assert false
      
39
let rec tuple = function
40
  | [ x ] -> x
41
  | x :: l -> Pair (x, tuple l)
42
  | [] -> assert false
43 44

let tuple_queue = 
45
  List.fold_right (fun x q -> Pair (x, q))
46 47


48
let char = mknoloc (Internal (Types.char Chars.any))
49
let string_regexp = Star (Elem char)
50
	       
51
let cst_nil =  Cst (Types.Atom Sequence.nil_atom)
52
		 
53
let seq_of_string pos s =
54
  let s =  Encodings.Utf8.mk s in
55
  let (pos,_) = pos in
56 57 58
  let rec aux pos i j =
    if Encodings.Utf8.equal_index i j then []
    else
59
      let (len,i) = Encodings.Utf8.next s i in
60
      let (c,i) = Encodings.Utf8.next s i in
61
      ((pos,pos+len),c) :: (aux (pos + len) i j)
62
  in
63
  aux (pos+1) (Encodings.Utf8.start_index s) (Encodings.Utf8.end_index s)
64

65 66 67 68 69 70 71 72 73 74 75 76 77 78
let get_string s =
  let s = Encodings.Utf8.mk s in
  let b = Buffer.create 32 in
  let rec aux i j =
    if Encodings.Utf8.equal_index i j then ()
    else
      let (len,i) = Encodings.Utf8.next s i in
      let (c,i) = Encodings.Utf8.next s i in
      Encodings.Utf8.store b c;
      aux i j
  in
  aux (Encodings.Utf8.start_index s) (Encodings.Utf8.end_index s);
  Buffer.contents b

79
exception Error of string
80
let error (i,j) s = Location.raise_loc i j (Error s)
81

82 83 84
let make_record loc r =
  LabelMap.from_list (fun _ _ -> error loc "Duplicated record field") r

85
let parse_char loc s =
86 87
  let s = seq_of_string loc s in
  match s with
88
    | [ loc,c ] -> c
89
    | _ -> error loc "Character litteral must have length 1"
90

91 92
let char_list loc s = 
  let s = seq_of_string loc s in
93
  List.map (fun (loc,c) -> exp loc (Cst (Types.Char (Chars.mk_int c)))) s
94

95 96
let include_stack = ref []

97 98 99 100
let protect_exn f g =
  try let x = f () in g (); x
  with e -> g (); raise e

101 102 103 104 105 106 107 108 109
let is_fun_decl =
   Grammar.Entry.of_parser gram "[is_fun_decl]"
     (fun strm ->
       match Stream.npeek 3 strm with
	 | [ ("", "fun"); ("LIDENT", _); ("", "(") ]
	 | [ ("LIDENT", _) ; ("", "(") ; _ ] -> ()
	 | _ -> raise Stream.Failure
     )

110
let dot_RE = Pcre.regexp "\\."
111

112
EXTEND
113 114 115
  GLOBAL: top_phrases prog expr pat regexp const;

  top_phrases: [
116
    [ l = LIST0 phrase; ";;" -> List.flatten l  ]
117
  ];
118 119

  prog: [
120
    [ l = LIST0 [ p = phrase ; OPT ";;" -> p ]; EOI -> List.flatten l ]
121 122 123
  ];

  phrase: [
124 125 126 127
    [ (f,p,e) = let_binding -> 
	if f then [ mk loc (FunDecl e) ] else
	  [ mk loc (LetDecl (p,e)) ]
    | (_,p,e1) = let_binding; "in"; e2 = expr LEVEL "top"->
128
        [ mk loc (EvalStatement (exp loc (Match (e1,[p,e2])))) ]
129 130
    | "type"; x = UIDENT; "="; t = pat -> [ mk loc (TypeDecl (x,t)) ]
    | "type"; x = LIDENT -> error loc "Type identifiers must be capitalized"
131 132 133 134
    | "schema"; name = UIDENT; "="; uri = STRING2 ->
        let schema_doc = Schema_xml.pxp_tree_of (get_string uri) in
        let schema = Schema_parser.parse_schema schema_doc in
        [ mk loc (SchemaDecl (name, schema))]
135
    | "debug"; d = debug_directive -> [ mk loc (Debug d) ]
136 137
    | DIRECTIVE "#quit" -> [ mk loc (Directive `Quit) ]
    | DIRECTIVE "#env" -> [ mk loc (Directive `Env) ]
138
    | "include"; s = STRING2 ->
139
	let s = get_string s in
140 141 142 143
	let s = 
	  if Filename.is_relative s 
	  then Filename.concat (Location.current_dir ()) s
	  else s in
144 145
	protect_op "File inclusion";
	(* avoid looping; should issue an error ? *)
146 147
	(* it is possible to have looping with x/../x/../x/.. ....
	   Need to canonicalize filename *)
148 149 150 151
	if List.mem s !include_stack then [] 
	else (
	  include_stack := s :: !include_stack;
	  Location.push_source (`File s);
152 153 154
	  protect_exn
	    (fun () ->
	       let chan = open_in s in
155 156 157 158 159
	       protect_exn
		 (fun () ->
		    let input = Stream.of_channel chan in
		    Grammar.Entry.parse prog input)
		 (fun () -> close_in chan))
160 161 162
	    (fun () ->
	       Location.pop_source ();
	       include_stack := List.tl !include_stack)
163
	)
164
    ] | 
165
    [ e = expr -> [ mk loc (EvalStatement e) ]
166 167 168 169 170
    ]
  ];

  debug_directive: [
    [ LIDENT "filter"; t = pat; p = pat -> `Filter(t,p)
171
    | LIDENT "accept"; p = pat -> `Accept p
172
    | LIDENT "compile"; t = pat; p = LIST1 pat -> `Compile (t,p)
173
    | LIDENT "sample"; t = pat -> `Sample t
174
    | LIDENT "subtype"; t1 = pat; t2 = pat -> `Subtype (t1,t2)
175
    ]
176
  ];
177

178 179 180 181 182
  keyword: [
    [ a = 
	[ "map" | "match" | "with" | "try" | "xtransform"
	| "if" | "then"	| "else"
	| "transform" | "fun" | "in"
183
	| "let" | "type" | "debug" | "include"
184
        | "and" | "validate" | "schema"
185 186 187 188 189
	]
	-> a
    ]
  ];

190 191
  expr: [
    "top" RIGHTA
192 193
    [ "match"; e = SELF; "with"; b = branches -> 
	exp loc (Match (e,b))
194
    | "try"; e = SELF; "with"; b = branches -> 
195
	exp loc (Try (e,b))
196 197 198 199
    | "map"; e = SELF; "with"; b = branches -> 
	exp loc (Map (e,b))
    | "xtransform"; e = SELF; "with"; b = branches -> 
	exp loc (Xtrans (e,b))
200
    | "if"; e = SELF; "then"; e1 = SELF; "else"; e2 = SELF ->
201 202
	let p1 = mk loc (Internal true_type)
	and p2 = mk loc (Internal false_type) in
203
	exp loc (Match (e, [p1,e1; p2,e2]))
204
    | "transform"; e = SELF; "with"; b = branches -> 
205
	exp loc (Transform (e,b))
206 207 208
    | "validate"; e = SELF; "with"; schema = UIDENT; "#";
      typ = [ UIDENT | LIDENT | keyword ] ->
        exp loc (Validate (e, schema, typ))
209
    | "fun"; (f,a,b) = fun_decl ->
210
	exp loc (Abstraction { fun_name = f; fun_iface = a; fun_body = b })
211
    | (_,p,e1) = let_binding; "in"; e2 = expr LEVEL "top"->
212
        exp loc (Match (e1,[p,e2]))
213
    | e = expr; ":"; p = pat ->
214
	exp loc (Forget (e,p))
215 216 217
    ]

    
218 219 220 221 222 223
    | 
    [ e1 = expr; op = ["=" | "<=" | "<<" | ">>" | ">=" ]; e2 = expr -> 
	let op = match op with
	  | "<<" -> "<"
	  | ">>" -> ">"
	  | s -> s in
224
	exp loc (Op (op,[e1;e2]))
225 226
    ]

227
    | 
228
    [ e1 = expr; op = ["+" | "-" | "@" ]; e2 = expr -> 
229
	exp loc (Op (op,[e1;e2]))
230
    | e = expr; "\\"; l = [LIDENT | UIDENT | keyword ] -> 
231
	exp loc (RemoveField (e, label l)) 
232 233
    ]
    |
234
    [ e1 = expr; op = ["*"]; e2 = expr -> exp loc (Op (op,[e1;e2]))  
235 236 237 238 239
    | e = expr; op = "/"; p = pat ->

	let tag = mk loc (Internal (Types.atom (Atoms.any))) in
	let att = mk loc (Internal Types.Record.any) in
	let any = mk loc (Internal (Types.any)) in
240
	let re = Star(Alt(SeqCapture(id_dummy,Elem p), Elem any)) in
241 242
	let ct = mk loc (Regexp (re,any)) in
        let p = mk loc (XmlT (tag, multi_prod loc [att;ct])) in
243
	let b = (p,  Var id_dummy) in
244
	exp loc (Transform (e,[b]))
245
    ]
246
    |
247
    [ e = expr;  "."; l = [LIDENT | UIDENT | keyword ] -> 
248
	exp loc (Dot (e, label l)) 
249
    ]  
250
 
251
    |
252 253
    [ op = [ LIDENT "flatten"
	   | LIDENT "load_xml"
254
	   | LIDENT "load_file" | LIDENT "load_file_utf8"
255
	   | LIDENT "load_html"
256
	   | LIDENT "print_xml" | LIDENT "print_xml_utf8"
257
	   | LIDENT "print"
258
	   | LIDENT "int_of"
259
	   | LIDENT "string_of"
260
	   | LIDENT "atom_of"
261
	   | LIDENT "raise"
262
	   ]; 
263
      e = expr -> exp loc (Op (op,[e]))
264
    | op = [ LIDENT "dump_to_file" | LIDENT "dump_to_file_utf8" ];
265 266 267 268
      e1 = expr LEVEL "no_appl"; e2 = expr -> exp loc (Op (op, [e1;e2])) 
    | e1 = SELF; LIDENT "div"; e2 = expr -> exp loc (Op ("/", [e1;e2]))
    | e1 = SELF; LIDENT "mod"; e2 = expr -> exp loc (Op ("mod", [e1;e2]))
    | e1 = SELF; e2 = expr -> exp loc (Apply (e1,e2))
269 270
    ]

271
    | "no_appl" 
272 273
    [ c = const -> exp loc (Cst c)
    | "("; l = LIST1 expr SEP ","; ")" -> exp loc (tuple l)
274 275
    | "[";  l = LIST0 seq_elem; e = OPT [ ";"; e = expr -> e ]; "]" ->
	let e = match e with Some e -> e | None -> cst_nil in
276 277 278 279 280 281 282 283
	let l = List.fold_right 
		  (fun x q ->
		     match x with
		       | `Elems l -> tuple_queue l q
		       | `Explode x -> Op ("@",[x;q])
		  ) l e
	in
	exp loc l
284 285
    | "<"; t = [ "("; e = expr; ")" -> e
	       | a = [ LIDENT | UIDENT | keyword ] -> 
286
		   exp loc (Cst (Types.Atom (atom a))) ];
287
	a = expr_attrib_spec; ">"; c = expr ->
288 289
	exp loc (Xml (t, Pair (a,c)))
    | "{"; r = [ expr_record_spec | -> exp loc (RecordLitt LabelMap.empty) ]; "}" -> r
290
    | s = STRING2 ->
291
	exp loc (tuple (char_list loc s @ [cst_nil]))
292
    | a = LIDENT -> exp loc (Var (ident a))
293 294 295
    ]

  ];
296 297

  seq_elem: [
298 299 300
    [ x = STRING1 -> `Elems (char_list loc x)
    | e = expr LEVEL "no_appl" -> `Elems [e]
    | "!"; e = expr LEVEL "no_appl" -> `Explode e
301 302
    ]
  ];
303 304
	  
  let_binding: [
305 306 307 308
    [ "let"; is_fun_decl; OPT "fun"; (f,a,b) = fun_decl ->
	let f = match f with Some x -> x | None -> assert false in
	let p = mk loc (Capture f) in
	let abst = { fun_name = Some f; fun_iface = a; fun_body = b } in
309
        let e = exp loc (Abstraction abst) in
310
        (true,p,e)
311 312
    | "let"; p = pat; "="; e = expr -> (false,p,e)
    | "let"; p = pat; ":"; t = pat; "="; e = expr -> (false,p, Forget (e,t))
313 314 315
    ] 
  ];

316
 fun_decl_after_lparen: [
317 318
(* need an hack to do this, because both productions would
   match   [ OPT LIDENT; "("; pat ] .... *)
319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
   [ p1 = pat LEVEL "no_arrow";
     res = [ "->"; p2 = pat;
	     a = [ ";"; a = LIST0 arrow SEP ";" -> a | -> [] ];
	     ")"; b = branches -> `Classic (p2,a,b)
	   | ":"; targ1 = pat;
	     args = LIST0 [ ","; arg = pat; ":"; targ = pat -> (arg,targ) ]; 
	     ")"; ":"; tres = pat ; 
	     "="; body = expr ->
	       `Compact (targ1,args,tres,body)
	   ] ->
       match res with
	 | `Classic (p2,a,b) -> (p1,p2)::a,b
	 | `Compact (targ1,args,tres,body) ->
	     let args = (p1,targ1) :: args in
	     let targ = multi_prod nopos (List.map snd args) in
	     let arg = multi_prod nopos (List.map fst args) in
	     let b = [arg, body] in
	     let a = [targ,tres] in
	     (a,b) ] ];


 fun_decl: [
   [ f = OPT [ x = LIDENT -> ident x]; "("; (a,b) = fun_decl_after_lparen ->
342
	    (f,a,b)
343
   ]
344 345
 ];

346
 arrow: [
347
    [ t1 = pat LEVEL "no_arrow"; "->"; t2 = pat -> (t1,t2)]
348 349 350
  ];

  branches: [
351
    [ OPT "|"; l = LIST1 branch SEP "|" -> l ]
352 353 354
  ];

  branch: [
355
    [ p = pat LEVEL "no_arrow"; "->"; e = expr -> (p,e) ]
356 357 358 359
  ];

	  
  regexp: [ 
360 361 362 363 364
    [ x = regexp; "|"; y = regexp -> 
	match (x,y) with
	  | Elem x, Elem y -> Elem (mk loc (Or (x,y)))
	  | _ -> Alt (x,y) 
    ]
365
  | [ x = regexp; y = regexp -> Seq (x,y) ]
366
  | [ a = LIDENT; "::"; x = regexp -> SeqCapture (ident a,x) ]
367 368 369 370
  | [ x = regexp; "*" -> Star x
    | x = regexp; "*?" -> WeakStar x
    | x = regexp; "+" -> Seq (x, Star x)
    | x = regexp; "+?" -> Seq (x, WeakStar x)
371
    | x = regexp; "?" ->  Alt (x, Epsilon)
372 373
    | x = regexp; "??" -> Alt (Epsilon, x) ]
  | [ "("; x = regexp; ")" -> x
374
    | "("; a = LIDENT; ":="; c = const; ")" -> 
375
	Elem (mk loc (Constant ((ident a,c))))
376
    | UIDENT "PCDATA" -> string_regexp
377
    | i = STRING1; "--"; j = STRING1 ->
378 379
	let i = Chars.mk_int (parse_char loc i)
	and j = Chars.mk_int (parse_char loc j) in
380
        Elem (mk loc (Internal (Types.char (Chars.char_class i j))))
381 382
    |  s = STRING1 ->
	let s = seq_of_string loc s in
383
	List.fold_right
384
	  (fun (loc,c) accu -> 
385
	     let c = Chars.mk_int c in
386 387 388
	     let c = Chars.atom c in
	     Seq (Elem (mk loc (Internal (Types.char c))), accu))
	  s
389
	  Epsilon 
390 391 392 393 394
    | e = pat LEVEL "simple" -> Elem e
    ]
  ];

  pat: [ 
395
      [ x = pat; LIDENT "where"; 
396 397 398
        b = LIST1 [ a = UIDENT; "="; y = pat -> (a,y)
		  | LIDENT -> error loc "Type/pattern identifiers must be capitalized"
		  ] SEP "and"
399 400
            -> mk loc (Recurs (x,b)) ]
    | RIGHTA [ x = pat; "->"; y = pat -> mk loc (Arrow (x,y)) ]
401
    | "no_arrow" [ x = pat; "|"; y = pat -> mk loc (Or (x,y)) ] 
402
    | "simple" [ x = pat; "&"; y = pat -> mk loc (And (x,y)) 
403
	       | x = pat; "\\"; y = pat -> mk loc (Diff (x,y)) ]
404
    | 
405 406
      [ "{"; r = record_spec; "}" -> mk loc (Record (true,r))
      | "{|"; r = record_spec; "|}" -> mk loc (Record (false,r))
407
      | LIDENT "_" -> mk loc (Internal Types.any)
408
      | a = LIDENT -> mk loc (Capture (ident a))
409
      | "("; a = LIDENT; ":="; c = const; ")" -> 
410
	  mk loc (Constant (ident a,c))
411 412 413 414 415 416 417 418 419 420 421
      | schema = UIDENT; "#"; typ = [ UIDENT | LIDENT | keyword ];
        k = OPT [ "as"; k = [ "element" | "type" | "attribute" ] -> k ] ->
          let kind =
            match k with
            | None -> `Any
            | Some "element" -> `Element
            | Some "type" -> `Type
            | Some "attribute" -> `Attribute
            | _ -> assert false
          in
          mk loc (SchemaVar (kind, schema, typ))
422 423
      | a = UIDENT -> mk loc (PatVar a)
      | i = INT ; "--"; j = INT -> 
424 425
          let i =  Intervals.mk i 
	  and j =  Intervals.mk j in
426 427
          mk loc (Internal (Types.interval (Intervals.bounded i j)))
      | i = INT -> 
428
          let i =  Intervals.mk i  in
429
          mk loc (Internal (Types.interval (Intervals.atom i)))
430
      | "*"; "--"; j = INT ->
431
	  let j =  Intervals.mk j in
432
          mk loc (Internal (Types.interval (Intervals.left j)))
433
      | i = INT; "--"; "*" ->
434
	  let i = Intervals.mk i in
435
          mk loc (Internal (Types.interval (Intervals.right i)))
436 437
      | i = char ->
          mk loc (Internal (Types.char (Chars.char_class i i)))
438
      | i = char ; "--"; j = char ->
439
          mk loc (Internal (Types.char (Chars.char_class i j)))
440 441 442 443
      | c = const -> mk loc (Internal (Types.constant c))
      | "("; l = LIST1 pat SEP ","; ")" -> multi_prod loc l
      | "["; r = [ r = regexp -> r | -> Epsilon ];
             q = [ ";"; q = pat -> q 
444
                 | -> mknoloc (Internal (Sequence.nil_type)) ]; 
445
             "]" -> mk loc (Regexp (r,q))
446 447
      | "<"; t =
        [ x = [ LIDENT | UIDENT | keyword ] ->
448
	    let a = if x = "_" then Atoms.any else Atoms.atom (atom x) in
449 450
	    mk loc (Internal (Types.atom a))
	| "("; t = pat; ")" -> t ];
451
	a = attrib_spec; ">"; c = pat ->
452
          mk loc (XmlT (t, multi_prod loc [a;c]))
453 454
      | s = STRING2 ->
	  let s = seq_of_string loc s in
455
	  let s = List.map 
456
		    (fun (loc,c) -> 
457 458 459
		       mk loc (Internal
				 (Types.char
				    (Chars.atom
460
				       (Chars.mk_int c))))) s in
461 462
	  let s = s @ [mk loc (Internal (Sequence.nil_type))] in
	  multi_prod loc s
463 464 465 466 467
      ]
    
  ];

  record_spec:
468
    [ [ r = LIST0 [ l = [LIDENT | UIDENT | keyword ]; "=";
469
                  o = [ "?" -> true | -> false]; 
470 471
                  x = pat -> 
		    let x = if o then mk loc (Optional x) else x in
472
		    (label l, x)
473
                ] SEP ";" ->
474
	  make_record loc r
475 476
      ] ];
  
477 478
  char:
    [ 
479
      [ c = STRING1 -> Chars.mk_int (parse_char loc c) ]
480 481 482
    ];
     

483 484
  const:
    [ 
485
      [ i = INT -> Types.Integer (Intervals.mk i)
486
      | "`"; a = [LIDENT | UIDENT | keyword ] -> Types.Atom (atom a)
487
      | c = char -> Types.Char c ]
488 489 490 491
    ];


  attrib_spec:
492
    [ [ r = record_spec -> mk loc (Record (true,r)) 
493 494 495 496
      | "("; t = pat; ")" -> t 
      | "{"; r = record_spec; "}" -> mk loc (Record (true,r))
      | "{|"; r = record_spec; "|}" -> mk loc (Record (false,r))
      ] ];
497 498 499

  expr_record_spec:
    [ [ r = LIST1
500
	      [ l = [LIDENT | UIDENT | keyword ]; "="; x = expr -> 
501
		  (label l,x) ] 
502
	      SEP ";" ->
503
	  exp loc (RecordLitt (make_record loc r))
504 505 506 507 508
      ] ];
  
  expr_attrib_spec:
    [ [ r = expr_record_spec -> r ]
    | [ e = expr LEVEL "no_appl" -> e 
509
      | -> exp loc (RecordLitt (LabelMap.empty)) 
510 511 512 513
      ] 
    ];
END

514
let pat = Grammar.Entry.parse pat
515 516
and expr = Grammar.Entry.parse expr
and prog = Grammar.Entry.parse prog
517 518
and top_phrases = Grammar.Entry.parse top_phrases

519 520 521 522 523 524 525 526 527 528 529 530
let sync () = 
  match !Wlexer.lexbuf with
    | None -> ()
    | Some lb ->
	let rec aux () =
	  match !Wlexer.last_tok with
	    | ("",";;") | ("EOI","") -> ()
	    | _ -> 
		Wlexer.last_tok := Wlexer.token Wlexer.latin1_engine lb; 
		aux ()
	in
	aux ()