parser.ml 21.5 KB
Newer Older
1 2
#load "pa_extend.cmo";;

3 4
open Location
open Ast
5
open Ident
6
open Printf
7

8
(*
9
let ()  = Grammar.error_verbose := true
10
*)
11

12 13 14 15 16 17
let tloc (i,j) = (i.Lexing.pos_cnum,j.Lexing.pos_cnum)
let nopos = (Lexing.dummy_pos, Lexing.dummy_pos)


let mk loc x = Location.mk (tloc loc) x

18 19
exception Error of string
let error (i,j) s = Location.raise_loc i j (Error s)
20
let error loc s = error (tloc loc) s
21

22
let gram    = Grammar.gcreate Ulexer.lex
23

24 25 26 27 28 29 30 31 32 33 34
let id_dummy = U.mk "$$$"

let ident s =
  let b = Buffer.create (String.length s) in
  let rec aux i =
    if (i = String.length s) then Buffer.contents b
    else match s.[i] with
      | '\\' -> assert (s.[i+1] = '.'); Buffer.add_char b '.'; aux (i+2)
      | c -> Buffer.add_char b c; aux (i+1)
  in
  aux 0
35

36 37
let label s = U.mk (ident s)
let ident s = U.mk (ident s)
38

39
let prog    = Grammar.Entry.create gram "prog"
40
let top_phrases   = Grammar.Entry.create gram "toplevel phrases"
41 42 43
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"
44
let keyword = Grammar.Entry.create gram "keyword"
45
		
46 47
let lop pos = loc_of_pos (tloc pos)
let exp pos e = LocatedExpr (lop pos,e)
48

49 50 51 52 53
let rec multi_prod loc = function
  | [ x ] -> x
  | x :: l -> mk loc (Prod (x, multi_prod loc l))
  | [] -> assert false
      
54
let rec tuple = function
55
  | [ x ] -> x
56
  | x :: l -> Pair (x, tuple l)
57
  | [] -> assert false
58 59

let tuple_queue = 
60
  List.fold_right (fun x q -> Pair (x, q))
61 62


63
let char = mknoloc (Internal (Types.char Chars.any))
64
let string_regexp = Star (Elem char)
65
	       
66
let seq_of_string s =
67 68
  let s = Encodings.Utf8.mk s in
  let rec aux i j =
69 70
    if Encodings.Utf8.equal_index i j then []
    else let (c,i) = Encodings.Utf8.next s i in c :: (aux i j)
71
  in
72
  aux (Encodings.Utf8.start_index s) (Encodings.Utf8.end_index s)
73

74

75
let parse_char loc s =
76 77
  match seq_of_string s with
    | [ c ] -> c
78
    | _ -> error loc "Character litteral must have length 1"
79

80 81
let include_stack = ref []

82 83 84 85
let protect_exn f g =
  try let x = f () in g (); x
  with e -> g (); raise e

86 87 88 89
let localize_exn f = 
  try f ()
  with
  | Stdpp.Exc_located (_, (Location _ as e)) -> raise e
90 91
(*  | Stdpp.Exc_located ((i,j), e) -> raise_loc i j e *)
  | Stdpp.Exc_located ((i,j), e) -> raise_loc i.Lexing.pos_cnum j.Lexing.pos_cnum e
92

93 94 95 96
let is_fun_decl =
   Grammar.Entry.of_parser gram "[is_fun_decl]"
     (fun strm ->
       match Stream.npeek 3 strm with
97 98
	 | [ ("", "fun"); ("IDENT", _); ("", "(") ]
	 | [ ("IDENT", _) ; ("", "(") ; _ ] -> ()
99 100 101
	 | _ -> raise Stream.Failure
     )

102 103 104 105 106 107 108 109 110
let is_capture =
   Grammar.Entry.of_parser gram "[is_capture]"
     (fun strm ->
       match Stream.npeek 2 strm with
	 | [ ("IDENT", _) ; ("", "::") ; _ ] -> ()
	 | _ -> raise Stream.Failure
     )


111 112 113 114 115
let if_then_else cond e1 e2 = Match (cond, [pat_true,e1; pat_false,e2])
 
let logical_and e1 e2 = if_then_else e1 e2 cst_false
let logical_or e1 e2 = if_then_else e1 cst_true e2
let logical_not e = if_then_else e cst_false cst_true
116

117
let apply_op2_noloc op e1 e2 = Apply (Apply (Var (ident op), e1), e2)
118
let apply_op2 loc op e1 e2 = exp loc (apply_op2_noloc op e1 e2)
119
 
120 121
let set_ref e1 e2 = Apply (Dot (e1, U.mk "set"), e2)
let get_ref e = Apply (Dot (e, U.mk "get"), cst_nil)
122 123 124
let let_in e1 p e2 =  Match (e1, [p,e2])
let seq e1 e2 = let_in e1 pat_nil e2
let concat e1 e2 = apply_op2_noloc "@" e1 e2
125

126
EXTEND
127
  GLOBAL: top_phrases prog expr pat regexp keyword;
128 129

  top_phrases: [
130
    [ l = LIST0 phrase; ";;" -> List.flatten l  ]
131
  ];
132 133

  prog: [
134
    [ l = LIST0 [ p = phrase ; OPT ";;" -> p ]; EOI -> List.flatten l ]
135 136 137
  ];

  phrase: [
138 139 140 141
    [ (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"->
142
        [ mk loc (EvalStatement (exp loc (let_in e1 p e2))) ]
143
    | "type"; x = located_ident; "="; t = pat -> [ mk loc (TypeDecl (x,t)) ]
144 145
    | "using"; name = IDENT; "="; cu = [ IDENT | STRING2 ] ->
	[ mk loc (Using (U.mk name, U.mk cu)) ]
146 147 148
    | "open"; ids = LIST1 [ IDENT | keyword ] SEP "." -> 	  
	let ids = List.map (fun x -> ident x) ids in
	[ mk loc (Open ids) ]
149
    | "schema"; name = IDENT; "="; uri = STRING2 ->
150
	protect_op "schema";
151
        [ mk loc (SchemaDecl (U.mk name, uri)) ]
152 153 154 155 156 157 158 159 160 161 162 163
    | n = namespace_binding ->
	let d = match n with
	    | `Prefix (name,ns) ->  Namespace (name, ns)
	    | `Keep b -> KeepNs b in
	[ mk loc d ]
    | n = namespace_binding; "in"; e2 = expr LEVEL "top" ->
	let e = 
	  match n with
	    | `Prefix (name,ns) -> NamespaceIn (name, ns, e2)
	    | `Keep b -> KeepNsIn (b,e2)
	in
	[ mk loc (EvalStatement (exp loc e)) ]
164
    | "debug"; d = debug_directive -> [ mk loc (Directive (`Debug d)) ]
165 166 167 168 169 170 171 172
    | "#"; IDENT "verbose" -> [ mk loc (Directive `Verbose) ]
    | "#"; IDENT "silent" -> [ mk loc (Directive `Silent) ]
    | "#"; IDENT "utf8" -> Ulexer.enc := Ulexing.Utf8; [ ]
    | "#"; IDENT "latin1" -> Ulexer.enc := Ulexing.Latin1; [ ]
    | "#"; IDENT "ascii" -> Ulexer.enc := Ulexing.Ascii; [ ]
    | "#"; IDENT "quit" -> [ mk loc (Directive `Quit) ]
    | "#"; IDENT "env" -> [ mk loc (Directive `Env) ]
    | "#"; IDENT "print_type"; t = pat ->
173
        [ mk loc (Directive (`Print_type t)) ]
174 175 176
    | "#"; IDENT "dump_value"; e = expr -> [ mk loc (Directive (`Dump e)) ]
    | "#"; IDENT "reinit_ns" -> [ mk loc (Directive `Reinit_ns) ]
    | "#"; IDENT "help" -> [ mk loc (Directive `Help) ]
177
    | "#"; IDENT "builtins" -> [ mk loc (Directive `Builtins) ]
178
    | "include"; s = STRING2 ->
179 180 181 182
	let s = 
	  if Filename.is_relative s 
	  then Filename.concat (Location.current_dir ()) s
	  else s in
183 184
	protect_op "File inclusion";
	(* avoid looping; should issue an error ? *)
185 186
	(* it is possible to have looping with x/../x/../x/.. ....
	   Need to canonicalize filename *)
187 188 189 190
	if List.mem s !include_stack then [] 
	else (
	  include_stack := s :: !include_stack;
	  Location.push_source (`File s);
191 192
	  let saved_enc = !Ulexer.enc in
	  Ulexer.enc := Ulexing.Latin1;
193 194 195
	  protect_exn
	    (fun () ->
	       let chan = open_in s in
196 197 198
	       protect_exn
		 (fun () ->
		    let input = Stream.of_channel chan in
199
		    localize_exn (fun () -> Grammar.Entry.parse prog input))
200
		 (fun () -> close_in chan))
201
	    (fun () ->
202
	       Ulexer.enc := saved_enc;
203 204
	       Location.pop_source ();
	       include_stack := List.tl !include_stack)
205
	)
206
    ] | 
207
    [ e = expr -> [ mk loc (EvalStatement e) ]
208 209 210 211
    ]
  ];

  debug_directive: [
212 213 214 215 216
    [ IDENT "filter"; t = pat; p = pat -> `Filter(t,p)
    | IDENT "accept"; p = pat -> `Accept p
    | IDENT "compile"; t = pat; p = LIST1 pat -> `Compile (t,p)
    | IDENT "sample"; t = pat -> `Sample t
    | IDENT "subtype"; t1 = pat; t2 = pat -> `Subtype (t1,t2)
217
    | IDENT "single"; t = pat -> `Single t
218
    ]
219
  ];
220

221 222 223 224 225
  keyword: [
    [ a = 
	[ "map" | "match" | "with" | "try" | "xtransform"
	| "if" | "then"	| "else"
	| "transform" | "fun" | "in"
226
	| "let" | "type" | "debug" | "include"
227
        | "and" | "or" | "validate" | "schema" | "namespace" | "ref" | "alias"
228
	| "not" | "as" | "where" | "select" | "from"
229 230 231 232 233
	]
	-> a
    ]
  ];

234 235
  expr: [
    "top" RIGHTA
236 237
    [ "match"; e = SELF; "with"; b = branches -> 
	exp loc (Match (e,b))
238
    | "try"; e = SELF; "with"; b = branches -> 
239
	exp loc (Try (e,b))
240 241 242 243
    | "map"; e = SELF; "with"; b = branches -> 
	exp loc (Map (e,b))
    | "xtransform"; e = SELF; "with"; b = branches -> 
	exp loc (Xtrans (e,b))
244
    | "if"; e = SELF; "then"; e1 = SELF; "else"; e2 = SELF ->
245
	exp loc (if_then_else e e1 e2)
246
    | "transform"; e = SELF; "with"; b = branches -> 
247
	exp loc (Transform (e,b))
248
    | "validate"; e = SELF; "with"; (schema, typ) = schema_ref ->
249
        exp loc (Validate (e, [schema;typ]))
250 251 252 253
    | "select"; e = SELF; "from"; 
      l = LIST1 [ x = pat ; "in"; e = expr -> (x,e)] SEP "," ;
      cond = [ "where"; c = LIST1 [ expr ] SEP "and" -> c 
	     | -> [] ] -> exp loc (SelectFW (e,l,cond)) 
254
    | "fun"; (f,a,b) = fun_decl ->
255
	exp loc (Abstraction { fun_name = f; fun_iface = a; fun_body = b })
256
    | (_,p,e1) = let_binding; "in"; e2 = expr LEVEL "top"->
257
        exp loc (let_in e1 p e2)
258 259 260 261
    | n = namespace_binding; "in"; e2 = expr LEVEL "top" ->
	(match n with
	   | `Prefix (name,ns) -> exp loc (NamespaceIn (name, ns, e2))
	   | `Keep f -> exp loc (KeepNsIn (f,e2)))
262
    | e = expr; ":"; p = pat ->
263
	exp loc (Forget (e,p))
264 265
    | e = expr; ":"; "?"; p = pat ->
	exp loc (Check (e,p))
266
    | e1 = expr; ";"; e2 = expr ->
267
	exp loc (seq e1 e2) 
268 269
    | "ref"; p = pat; e = expr ->
	exp loc (Ref (e,p))
270
    | "not"; e = expr -> exp loc (logical_not e)
271 272
    ]
    |
273
    [ e1 = expr; ":="; e2 = expr -> exp loc (set_ref e1 e2)
274
    ]
275 276 277 278 279 280
    | 
    [ e1 = expr; op = ["=" | "<=" | "<<" | ">>" | ">=" ]; e2 = expr -> 
	let op = match op with
	  | "<<" -> "<"
	  | ">>" -> ">"
	  | s -> s in
281
	apply_op2 loc op e1 e2
282 283
    ]

284
    | 
285
    [ e1 = expr; op = ["+" | "-" | "@" ]; e2 = expr -> apply_op2 loc op e1 e2
286
    | e1 = expr; ["||" | "or"]; e2 = expr -> exp loc (logical_or e1 e2)
287
    | e = expr; "\\"; l = [IDENT | keyword ] -> 
288
	exp loc (RemoveField (e, label l)) 
289 290
    ]
    |
291
    [ e1 = expr; op = ["*"]; e2 = expr -> apply_op2 loc op e1 e2
292
    | e1 = expr; "&&"; e2 = expr -> exp loc (logical_and e1 e2)
293
    | e = expr; op = "/"; p = pat LEVEL "simple" ->
294
	(* transform e with <(Atom)>[($$$::t|_)*] -> [$$$] *)
295 296
	let tag = mk loc (Internal (Types.atom (Atoms.any))) in
	let att = mk loc (Internal Types.Record.any) in
297
	let any = mk loc (Internal Types.any) in
298
	let re = Star(Alt(SeqCapture(noloc,id_dummy,Elem p), Elem any)) in
299
	let ct = mk loc (Regexp re) in
300
        let p = mk loc (XmlT (tag, multi_prod loc [att;ct])) in
301 302 303 304 305 306 307
	exp loc (Transform (e,[p, Var id_dummy]))
    | e = expr; "/@"; a = [IDENT|keyword] ->
	(* transform e with <(Atom) {a=$$$}>_ -> [$$$] *)
        let tag = mk loc (Internal (Types.atom Atoms.any)) in
        let any = mk loc (Internal Types.any) in
        let att = mk loc (Record
			    (true, [(label a,
308
				     (mk loc (PatVar [id_dummy]),
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
				      None))])) in
        let p = mk loc (XmlT (tag, multi_prod loc [att;any])) in
        let t = (p, Pair (Var id_dummy,cst_nil)) in
        exp loc (Transform (e,[t]))
     | e = expr; "//" ; p = pat ->
	 (*
	   let $stack=ref [p*] [] in
	   let _ = xtransform e with $$$ & p -> $stack := !$stack @ $$$ in
	   !stack;; 
	 *)
	 let stk = U.mk "$stack" in
	 let assign = 
	   set_ref 
	     (Var stk)
	     (concat (get_ref (Var stk)) (Pair (Var id_dummy,cst_nil))) in
324
	 let capt = mk loc (And (mk loc (PatVar [U.mk "$$$"]),p)) in
325 326 327
	 let xt = Xtrans (e,[capt,assign]) in
	 let rf = Ref (cst_nil, mk loc (Regexp (Star(Elem p)))) in
	 let body = 
328
	   let_in rf (mk loc (PatVar [stk]))
329 330 331
	     (let_in xt (mk loc (Internal Types.any)) (get_ref (Var stk)))
	 in
	 exp loc body
332
    ]
333 334 335
    | [ 
      e1 = SELF; IDENT "div"; e2 = expr -> apply_op2 loc "/" e1 e2
    | e1 = SELF; IDENT "mod"; e2 = expr -> apply_op2 loc "mod" e1 e2
336
    | e1 = SELF; e2 = expr -> exp loc (Apply (e1,e2))
337 338
    ]

339
    | "no_appl" 
340

341 342 343 344 345 346
    [ e = expr;  "."; l = [IDENT | keyword ]; 
      tyargs = [ "with"; "{"; tyargs = LIST0 pat; "}" -> Some tyargs
      | -> None ] ->
	let e = Dot (e,label l) in
	match tyargs with None -> exp loc e | Some tyargs -> 
	  exp loc (TyArgs (e,tyargs))
347 348
    ]  
    | [ 
349
      "("; l = LIST1 expr SEP ","; ")" -> exp loc (tuple l)
350
    | "[";  l = LIST0 seq_elem; e = OPT [ ";"; e = expr -> e ]; 
351
      loc_end = ["]" -> loc] ->
352
	let e = match e with Some e -> e | None -> cst_nil in
353 354
        let e = exp loc_end e in
        let (_,loc_end) = loc_end in
355 356 357
	let l = List.fold_right 
		  (fun x q ->
		     match x with
358
		       | `String (loc,i,j,s) -> exp loc (String (i,j,s,q))
359
		       | `Elems ((loc,_),x) -> exp (loc,loc_end) (Pair(x,q))
360
		       | `Explode x -> concat x q
361 362 363
		  ) l e
	in
	exp loc l
364
    | "<"; t = [ "("; e = expr; ")" -> e
365
	       | a = tag -> exp loc a
366
	       ];
367
	a = expr_attrib_spec; ">"; c = expr ->
368
	  exp loc (Xml (t, Pair (a,c)))
369
    | "{"; r = expr_record_spec; "}" -> r
370
    | s = STRING2 ->
371
	let s = U.mk s in
372
	exp loc (String (U.start_index s, U.end_index s, s, cst_nil))
373
    | a = IDENT -> exp loc (Var (ident a))
374
    | "!"; e = expr -> exp loc (get_ref e)
375 376 377
    | i = INT -> exp loc (Integer (Intervals.V.mk i))
    | "`"; a = tag -> a
    | c = char -> exp loc (Char c)
378 379 380
    ]

  ];
381

382
  tag: [ [ a = [ IDENT | keyword ] -> exp loc (Atom (ident a)) ] ];
383 384

  tag_type: [
385
    [ "_" ->  mk loc (Internal (Types.atom Atoms.any))
386 387
    | a = [ IDENT | keyword ] -> mk loc (Cst (Atom (ident a)))
    | t = ANY_IN_NS -> mk loc (NsT (ident t)) 
388 389 390
    ]
  ];

391
  seq_elem: [
392
    [ x = STRING1 -> 
393
	let s = U.mk x in
394
	`String (loc, U.start_index s, U.end_index s, s)
395
    | e = expr LEVEL "no_appl" -> `Elems (loc,e)
396
    | "!"; e = expr LEVEL "no_appl" -> `Explode e
397 398
    ]
  ];
399 400
	
  namespace_binding: [
401 402 403 404
    [ "namespace"; r = [
	[ name = 
	    [ name = [ IDENT | keyword ]; "=" -> ident name
	    | -> U.mk "" ];
405
	  ns = ns_expr -> `Prefix (name,ns)
406 407 408
	| IDENT "on" -> `Keep true
	| IDENT "off" -> `Keep false ]
      ] -> r ]
409 410
  ];

411 412 413 414 415 416 417
  ns_expr: [
    [ uri = STRING2 -> `Uri (Ns.Uri.mk (ident uri))
    | ids = LIST1 [ IDENT | keyword ] SEP "." -> 	  
	let ids = List.map (fun x -> ident x) ids in
	`Path ids ]
  ];

418
  
419
  let_binding: [
420 421
    [ "let"; is_fun_decl; OPT "fun"; (f,a,b) = fun_decl ->
	let f = match f with Some x -> x | None -> assert false in
422
	let p = mk loc (PatVar [snd f]) in
423
	let abst = { fun_name = Some f; fun_iface = a; fun_body = b } in
424
        let e = exp loc (Abstraction abst) in
425
        (true,p,e)
426 427
    | "let"; p = pat; "="; e = expr -> (false,p,e)
    | "let"; p = pat; ":"; t = pat; "="; e = expr -> (false,p, Forget (e,t))
428 429
    | "let"; p = pat; ":"; "?"; t = pat; "="; e = expr -> 
	(false,p, Check (e,t))
430 431 432
    ] 
  ];

433
 fun_decl_after_lparen: [
434
(* need an hack to do this, because both productions would
435
   match   [ OPT IDENT; "("; pat ] .... *)
436 437 438 439 440 441
   [ 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) ]; 
442 443 444 445 446 447 448 449 450
	     ")";
	     others = LIST0 
			[ "(";
			  args = 
			    LIST1 
			      [ arg = pat; ":"; targ = pat -> (arg,targ) ]
			      SEP ",";
			  ")" -> args ];
	     ":"; tres = pat ; 
451
	     "="; body = expr ->
452
	       `Compact (targ1,args,others,tres,body)
453 454 455
	   ] ->
       match res with
	 | `Classic (p2,a,b) -> (p1,p2)::a,b
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
	 | `Compact (targ1,args,others,tres,body) ->
	     let mkfun args =
	       multi_prod nopos (List.map snd args),
	       multi_prod nopos (List.map fst args)
	     in
	     let (tres,body) =
	       List.fold_right
		 (fun args (tres,body) ->
		    let (targ,arg) = mkfun args in
		    let e = Abstraction 
			      { fun_name = None; fun_iface = [targ,tres]; 
				fun_body = [arg,body] } in
		    let t = mknoloc (Arrow (targ,tres)) in
		    (t,e)
		 )
		 others (tres,body) in
	     let (targ,arg) = mkfun ((p1,targ1) :: args) in
	     [(targ,tres)],[(arg,body)]
	      ] ];
475 476 477


 fun_decl: [
478
   [ f = OPT located_ident; "("; (a,b) = fun_decl_after_lparen ->
479
       (f,a,b)
480
   ]
481 482
 ];

483
 arrow: [
484
    [ t1 = pat LEVEL "no_arrow"; "->"; t2 = pat -> (t1,t2)]
485 486 487
  ];

  branches: [
488
    [ OPT "|"; l = LIST1 branch SEP "|" -> l ]
489 490 491
  ];

  branch: [
492
    [ p = pat LEVEL "no_arrow"; "->"; e = expr -> (p,e) ]
493 494 495 496
  ];

	  
  regexp: [ 
497 498 499 500 501
    [ x = regexp; "|"; y = regexp -> 
	match (x,y) with
	  | Elem x, Elem y -> Elem (mk loc (Or (x,y)))
	  | _ -> Alt (x,y) 
    ]
502
  | [ x = regexp; y = regexp -> Seq (x,y) ]
503 504 505 506 507
  | [ x = regexp; "&"; y = regexp ->
	match (x,y) with
	  | Elem x, Elem y -> Elem (mk loc (And (x,y)))
	  | _ -> error loc "Conjunction not allowed in regular expression"
    ]
508
  | [ a = IDENT; "::"; x = regexp -> SeqCapture (lop loc,ident a,x) ] 
509 510 511 512
  | [ x = regexp; "*" -> Star x
    | x = regexp; "*?" -> WeakStar x
    | x = regexp; "+" -> Seq (x, Star x)
    | x = regexp; "+?" -> Seq (x, WeakStar x)
513
    | x = regexp; "?" ->  Alt (x, Epsilon)
514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
    | x = regexp; "??" -> Alt (Epsilon, x) 
    | x = regexp; "**"; i = INT ->
	let rec aux i accu =
	  if (i = 0) then accu
	  else aux (pred i) (Seq (x, accu))
	in
	let i = 
	  try 
	    let i = int_of_string i in
	    if (i > 1024) then raise Exit else i
	      (* We cannot handle type that huge... *)
	  with Failure _ | Exit -> error loc "Repetition number too large"
	in
	if (i <= 0) then 
	  error loc "Repetition number must be a positive integer";
	aux i Epsilon
    ]
531
  | [ "("; x = LIST1 regexp SEP ","; ")" ->
532 533 534 535 536 537 538 539 540 541 542
	(match x with
	  | [ x ] -> x
	  | _ ->
	      let x = 
		List.map 
		  (function
		     | Elem x -> x
		     | _ -> error loc 
			 "Mixing regular expressions and products")
		  x in
	      Elem (multi_prod loc x))
543 544
    | "("; a = IDENT; ":="; c = expr; ")" -> 
	Elem (mk loc (Constant ((ident a,c))))
545
    | "/"; p = pat LEVEL "simple" -> Guard p
546
    | IDENT "PCDATA" -> string_regexp
547
    | i = STRING1; "--"; j = STRING1 ->
548 549
	let i = Chars.V.mk_int (parse_char loc i)
	and j = Chars.V.mk_int (parse_char loc j) in
550
        Elem (mk loc (Internal (Types.char (Chars.char_class i j))))
551
    |  s = STRING1 ->
552
	List.fold_right
553
	  (fun c accu -> 
554
	     let c = Chars.V.mk_int c in
555
	     let c = Chars.atom c in
556 557
	     Seq (Elem (mknoloc (Internal (Types.char c))), accu))
	  (seq_of_string s)
558 559
	  Epsilon ]
    | [ e = pat LEVEL "simple" -> Elem e
560 561 562
    ]
  ];

563
  schema_ref: [
564
    [ schema = IDENT; "."; typ = [ IDENT | keyword ] -> (U.mk schema, ident typ)
565 566 567
    ]
  ];

568
  located_ident: [ [ a = [IDENT|keyword] -> (lop loc,ident a) ] ];
569

570
  pat: [ 
571
      [ x = pat; "where"; 
572 573
        b = LIST1 [ (la,a) = located_ident; "="; y = pat -> 
		      (la,a,y) ] SEP "and"
574
            -> mk loc (Recurs (x,b)) ]
575
    | RIGHTA [ x = pat; "->"; y = pat -> mk loc (Arrow (x,y))
576 577
             | x = pat; "@"; y = pat -> mk loc (Concat (x,y))
             | x = pat; "+"; y = pat -> mk loc (Merge (x,y)) ]
578
    | "no_arrow" [ x = pat; "|"; y = pat -> mk loc (Or (x,y)) ] 
579
    | "simple" [ x = pat; "&"; y = pat -> mk loc (And (x,y)) 
580
	       | x = pat; "\\"; y = pat -> mk loc (Diff (x,y)) ]
581
    | 
582
      [ "{"; r = record_spec; "}" -> r
583 584
      | "ref"; p = pat ->
	  let get_fun = mk loc (Arrow (pat_nil, p)) 
585 586 587
	  and set_fun = mk loc (Arrow (p, pat_nil))in
	  let fields = 
	    [ label "get", (get_fun, None); label "set", (set_fun, None) ] in
588
	  mk loc (Record (false, fields))
589
      | "_" -> mk loc (Internal Types.any)
590
      | "("; a = IDENT; ":="; c = expr; ")" -> 
591
	  mk loc (Constant (ident a,c))
592 593
      | "!"; a = IDENT ->
	  mk loc (Internal (Types.abstract (Types.Abstract.atom a)))
594 595 596
      | ids = LIST1 [ IDENT | keyword ] SEP "." ->
	  let ids = List.map (fun x -> ident x) ids in
	  mk loc (PatVar ids)
597
      | i = INT ; "--"; j = INT -> 
598 599
          let i =  Intervals.V.mk i 
	  and j =  Intervals.V.mk j in
600 601
          mk loc (Internal (Types.interval (Intervals.bounded i j)))
      | i = INT -> 
602
          let i =  Intervals.V.mk i  in
603
          mk loc (Internal (Types.interval (Intervals.atom i)))
604
      | "*"; "--"; j = INT ->
605
	  let j =  Intervals.V.mk j in
606
          mk loc (Internal (Types.interval (Intervals.left j)))
607
      | i = INT; "--"; "*" ->
608
	  let i = Intervals.V.mk i in
609
          mk loc (Internal (Types.interval (Intervals.right i)))
610 611
      | i = char ->
          mk loc (Internal (Types.char (Chars.char_class i i)))
612
      | i = char ; "--"; j = char ->
613
          mk loc (Internal (Types.char (Chars.char_class i j)))
614
      | "`"; c = tag_type -> c
615 616
      | "("; l = LIST1 pat SEP ","; ")" -> multi_prod loc l
      | "["; r = [ r = regexp -> r | -> Epsilon ];
617 618 619 620 621 622 623 624 625 626
             q = [ ";"; q = pat -> Some q
                 | -> None ]; 
             "]" -> 
	       let r = match q with
		 | Some q -> 	
		     let any = mk loc (Internal (Types.any)) in
		     Seq(r,Seq(Guard q, Star (Elem any)))
		 | None -> r
	       in
	       mk loc (Regexp r)
627
      | "<"; t =
628 629
            [ x = tag_type -> x
            | "("; t = pat; ")" -> t ];
630
	a = attrib_spec; ">"; c = pat ->
631
          mk loc (XmlT (t, multi_prod loc [a;c]))
632
      | s = STRING2 ->
633 634 635 636 637 638
	  let s = 
	    List.map 
	      (fun c -> 
		 mknoloc (Internal
			     (Types.char
				(Chars.atom
639
				   (Chars.V.mk_int c))))) 
640 641
	      (seq_of_string s) in
	  let s = s @ [mknoloc (Internal (Sequence.nil_type))] in
642
	  multi_prod loc s
643 644 645 646
      ]
    
  ];

647 648
  or_else : [ [ OPT [ "else"; y = pat -> y ]  ] ];

649
  opt_field_pat: [ [ OPT [ "=";
650
                  o = [ "?" -> true | -> false]; 
651 652 653
                  x = pat;  y = or_else -> (o,x,y) ] ] ];

  record_spec:
654
    [ [ r = LIST0 [ l = [IDENT | keyword ]; f = opt_field_pat; OPT ";" ->
655 656
		      let (o,x,y) =
			match f with
657
			  | None -> (false, mknoloc (PatVar [ident l]), None)
658 659 660 661
			  | Some z -> z
		      in
		      let x = if o then mk loc (Optional x) else x in
		      (label l, (x,y))
662 663
                  ]; op = [ ".." -> true | -> false ] ->
	  mk loc (Record (op,r))
664 665
      ] ];
  
666 667
  char:
    [ 
668
      [ c = STRING1 -> Chars.V.mk_int (parse_char loc c) ]
669 670 671
    ];
     

672 673 674 675
  attrib_spec: [
    [ r = record_spec -> r
    | "("; t = pat; ")" -> t 
    ] ];
676

677 678
  opt_field_expr: [ [ OPT [ "="; x = expr LEVEL "no_appl" -> x ] ] ];

679
  expr_record_spec:
680
    [ [ r = LIST0
681
	      [ l = [IDENT | keyword ]; 
682
		x = opt_field_expr; OPT ";" ->
683
		  let x = match x with Some x -> x | None ->  Var (ident l) in
684
		  (label l,x) ] 
685
	  ->
686
	  exp loc (RecordLitt r)
687
      ] ];
688

689 690 691 692
  expr_attrib_spec: [
    [ e = expr_record_spec -> e
    | "("; e = expr; ")" -> e 
    ] ];
693 694
END

695 696 697
module Hook = struct
  let expr = expr
  let pat = pat
698
  let keyword = keyword
699 700
end

701
let pat = Grammar.Entry.parse pat
702 703
and expr = Grammar.Entry.parse expr
and prog = Grammar.Entry.parse prog
704 705
and top_phrases = Grammar.Entry.parse top_phrases

706
let sync () = 
707
  match !Ulexer.lexbuf with
708 709 710
    | None -> ()
    | Some lb ->
	let rec aux () =
711
	  match !Ulexer.last_tok with
712 713
	    | ("",";;") | ("EOI","") -> ()
	    | _ -> 
714
		Ulexer.last_tok := fst (Ulexer.token lb); 
715 716 717
		aux ()
	in
	aux ()
718 719 720 721

let sync () =
  try sync ()
  with Ulexing.Error -> ()