parser.ml 10.4 KB
Newer Older
1 2 3
open Location
open Ast

4
(* let ()  = Grammar.error_verbose := true *)
5

6
let gram    = Grammar.gcreate (Lexer.gmake ())
7 8 9 10

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


11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
let prog    = Grammar.Entry.create gram "prog"
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"
		
let rec multi_prod loc = function
  | [ x ] -> x
  | x :: l -> mk loc (Prod (x, multi_prod loc l))
  | [] -> assert false
      
let rec tuple loc = function
  | [ x ] -> x
  | x :: l -> mk (x.loc) (Pair (x, tuple loc l))
  | [] -> assert false
      
let char = mk noloc (Internal (Types.char Chars.any))
28
let string_regexp = Star (Elem char)
29 30 31
	       
let cst_nil =  mk noloc (Cst (Types.Atom Sequence.nil_atom))
		 
32 33 34 35 36 37
let seq_of_string pos s =
  let (pos,_) = pos in
  let rec aux accu i = 
    if (i = 0) 
    then accu 
    else aux (((pos+i,pos+i+1),s.[i-1])::accu) (i-1) in
38 39
  aux [] (String.length s)

40 41 42 43 44 45 46 47
exception Error of string
let error loc s = raise (Location (loc, Error s))

let parse_char loc s =
  (* TODO: Unicode *)
  if String.length s <> 1 then
    error loc "Character litteral must have length 1";
  s.[0]
48

49
let char_list pos s = 
50
  let s = seq_of_string pos s in
51
  List.map (fun (loc,c) -> mk loc (Cst (Types.Char (Chars.Unichar.from_char c)))) s
52 53 54


EXTEND
55 56 57
  GLOBAL: prog expr pat regexp const;

  prog: [
58
    [ l = LIST0 [ p = phrase; ";;" -> mk loc p ]; EOI -> l ]
59 60 61
  ];

  phrase: [
62 63 64
    [ (p,e) = let_binding -> LetDecl (p,e)
    | (p,e1) = let_binding; "in"; e2 = expr LEVEL "top"->
        EvalStatement (mk loc (Match (e1,[p,e2])))
65 66
    | LIDENT "type"; x = UIDENT; "="; t = pat -> TypeDecl (x,t)
    | LIDENT "debug"; d = debug_directive -> Debug d
67 68
    ] | 
    [ e = expr -> EvalStatement e 
69 70 71 72 73
    ]
  ];

  debug_directive: [
    [ LIDENT "filter"; t = pat; p = pat -> `Filter(t,p)
74
    | LIDENT "accept"; p = pat -> `Accept p
75
    | LIDENT "compile"; t = pat; p = LIST1 pat -> `Compile (t,p)
76
    | LIDENT "normal_record"; t = pat -> `Normal_record t
77
    ]
78
  ];
79 80 81 82

  expr: [
    "top" RIGHTA
    [ "match"; e = SELF; "with"; b = branches -> mk loc (Match (e,b))
83 84 85 86 87
    | "try"; e = SELF; "with"; b = branches -> 
	let default = 
	  (mk noloc (Capture "x"),
	   mk noloc (Op ("raise",[mk noloc (Var "x")]))) in
	mk loc (Try (e,b@[default]))
88
    | "map"; e = SELF; "with"; b = branches -> mk loc (Map (e,b))
89 90
    | "transform"; e = SELF; "with"; b = branches -> 
	mk noloc (Op ("flatten", [mk loc (Map (e,b))]))
91
    | "fun"; (f,a,b) = fun_decl ->
92 93 94
	mk loc (Abstraction { fun_name = f; fun_iface = a; fun_body = b })
    | (p,e1) = let_binding; "in"; e2 = expr LEVEL "top"->
        mk loc (Match (e1,[p,e2]))
95 96
    | e = expr; ":"; p = pat ->
	mk loc (Forget (e,p))
97 98 99
    ]

    
100
    | 
101 102
    [ e1 = expr; op = ["+" | "-" | "@"]; e2 = expr -> mk loc (Op (op,[e1;e2]))
    ]
103
    |
104 105
    [ e1 = expr; op = ["*" | "/"]; e2 = expr -> mk loc (Op (op,[e1;e2]))  
    ]
106
    |
107 108
    [ e = expr;  "."; l = [LIDENT | UIDENT] -> 
	mk loc (Dot (e,Types.LabelPool.mk l)) 
109
    ]  
110
 
111
    |
112 113
    [ op = [ LIDENT "flatten"
	   | LIDENT "load_xml"
114
	   | LIDENT "print_xml"
115 116 117 118
	   | LIDENT "raise" 
	   | LIDENT "int_of"
	   ]; 
      e = expr -> mk loc (Op (op,[e]))
119 120 121
    | e1 = expr; e2 = expr -> mk loc (Apply (e1,e2))
    ]

122 123 124
    | "no_appl" 
    [ c = const -> mk loc (Cst c)
    | "("; l = LIST1 expr SEP ","; ")" -> tuple loc l
125 126 127
    | "[";  l = LIST0 seq_elem; e = OPT [ ";"; e = expr -> e ]; "]" ->
	let e = match e with Some e -> e | None -> cst_nil in
	let l = List.flatten l in
128
        tuple loc (l @ [e])
129 130 131 132
    | t = [ a = TAG -> 
	      mk loc (Cst (Types.Atom (Types.AtomPool.mk a)))
	  | "<"; e = expr LEVEL "no_appl" -> e ];
	a = expr_attrib_spec; ">"; c = expr ->
133 134
	tuple loc [t;a;c]
    | "{"; r = [ expr_record_spec | -> mk loc (RecordLitt []) ]; "}" -> r
135
    | s = STRING2 ->
136
	tuple loc (char_list loc s @ [cst_nil])
137
    | "!"; t = pat -> mk loc (DebugTyper t)
138 139 140 141
    | a = LIDENT -> mk loc (Var a)
    ]

  ];
142 143

  seq_elem: [
144
    [ x = STRING1 -> char_list loc x
145 146 147
    | e = expr LEVEL "no_appl" -> [e]
    ]
  ];
148 149 150
	  
  let_binding: [
    [ "let"; p = pat; "="; e = expr -> (p,e)
151
    | "let"; p = pat; ":"; t = pat; "="; e = expr -> (p, mk noloc (Forget (e,t)))
152 153 154 155 156 157
    | "let"; "fun"; (f,a,b) = fun_decl ->
	let p = match f with 
	  | Some x -> mk loc (Capture x)
	  | _ -> failwith "Function name mandatory in let fun declarations"
	in
	let abst = { fun_name = f; fun_iface = a; fun_body = b } in
158
        let e = mk loc (Abstraction abst) in
159
        (p,e);
160 161 162
    ] 
  ];

163
 fun_decl: [
164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
(* need an hack to do this, because both productions would
   match   [ OPT LIDENT; "("; pat ] .... *)
   [ f = OPT LIDENT; "("; 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) -> f,(p1,p2)::a,b
	| `Compact (targ1,args,tres,body) ->
	    let args = (p1,targ1) :: args in
	    let targ = multi_prod noloc (List.map snd args) in
	    let arg = multi_prod noloc (List.map fst args) in
	    let b = [arg, body] in
	    let a = [targ,tres] in
	    (f,a,b)
185 186 187
  ]
 ];

188
 arrow: [
189
    [ t1 = pat LEVEL "no_arrow"; "->"; t2 = pat -> (t1,t2)]
190 191 192
  ];

  branches: [
193
    [ OPT "|"; l = LIST1 branch SEP "|" -> l ]
194 195 196
  ];

  branch: [
197
    [ p = pat LEVEL "no_arrow"; "->"; e = expr -> (p,e) ]
198 199 200 201 202 203 204 205 206 207 208
  ];

	  
  regexp: [ 
    [ x = regexp; "|"; y = regexp -> Alt (x,y) ]
  | [ x = regexp; y = regexp -> Seq (x,y) ]
  | [ a = LIDENT; "::"; x = regexp -> SeqCapture (a,x) ]
  | [ x = regexp; "*" -> Star x
    | x = regexp; "*?" -> WeakStar x
    | x = regexp; "+" -> Seq (x, Star x)
    | x = regexp; "+?" -> Seq (x, WeakStar x)
209
    | x = regexp; "?" ->  Alt (x, Epsilon)
210 211
    | x = regexp; "??" -> Alt (Epsilon, x) ]
  | [ "("; x = regexp; ")" -> x
212
    | UIDENT "PCDATA" -> string_regexp
213 214 215
    | i = STRING1; "--"; j = STRING1 ->
	let i = Chars.Unichar.from_char (parse_char loc i)
	and j = Chars.Unichar.from_char (parse_char loc j) in
216
        Elem (mk loc (Internal (Types.char (Chars.char_class i j))))
217 218
    |  s = STRING1 ->
	let s = seq_of_string loc s in
219
	List.fold_right
220
	  (fun (loc,c) accu -> 
221 222 223 224
	     let c = Chars.Unichar.from_char c in
	     let c = Chars.atom c in
	     Seq (Elem (mk loc (Internal (Types.char c))), accu))
	  s
225
	  Epsilon 
226 227 228 229 230 231 232 233 234
    | e = pat LEVEL "simple" -> Elem e
    ]
  ];

  pat: [ 
      [ x = pat; "where"; 
        b = LIST1 [ a = UIDENT; "="; y = pat -> (a,y)] SEP "and"
            -> mk loc (Recurs (x,b)) ]
    | RIGHTA [ x = pat; "->"; y = pat -> mk loc (Arrow (x,y)) ]
235
    | "no_arrow" [ x = pat; "|"; y = pat -> mk loc (Or (x,y)) ] 
236 237 238
    | "simple" [ x = pat; "&"; y = pat -> mk loc (And (x,y,true)) 
(*	       | x = pat; ":"; y = pat -> mk loc (And (x,y,false))   *)
	       | x = pat; "-"; y = pat -> mk loc (Diff (x,y)) ]
239 240 241 242 243 244 245
    | 
      [ "{"; r = record_spec; "}" -> r
      | LIDENT "_" -> mk loc (Internal Types.any)
      | a = LIDENT -> mk loc (Capture a)
      | "("; a = LIDENT; ":="; c = const; ")" -> mk loc (Constant (a,c))
      | a = UIDENT -> mk loc (PatVar a)
      | i = INT ; "--"; j = INT -> 
246 247
          let i = Big_int.big_int_of_string i 
	  and j = Big_int.big_int_of_string j in
248 249 250 251
          mk loc (Internal (Types.interval (Intervals.bounded i j)))
      | i = INT -> 
          let i = Big_int.big_int_of_string i  in
          mk loc (Internal (Types.interval (Intervals.atom i)))
252
      | "*"; "--"; j = INT ->
253 254
	  let j = Big_int.big_int_of_string j in
          mk loc (Internal (Types.interval (Intervals.left j)))
255
      | i = INT; "--"; "*" ->
256 257
	  let i = Big_int.big_int_of_string i in
          mk loc (Internal (Types.interval (Intervals.right i)))
258 259
      | i = char ->
          mk loc (Internal (Types.char (Chars.char_class i i)))
260
      | i = char ; "--"; j = char ->
261
          mk loc (Internal (Types.char (Chars.char_class i j)))
262 263 264 265
      | 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 
266
                 | -> mk noloc (Internal (Sequence.nil_type)) ]; 
267
             "]" -> mk loc (Regexp (r,q))
268 269 270 271 272 273 274 275
      | t = [
	  [ "<"; LIDENT "_" -> mk loc (Internal (Types.atom (Atoms.any)))
	  | a = TAG -> 
	      mk loc 
	      (Internal (Types.atom (Atoms.atom (Types.AtomPool.mk a)))) ]
	| [ "<"; t = pat -> t ]
	];
	a = attrib_spec; ">"; c = pat ->
276
          multi_prod loc [t;a;c]
277 278
      | s = STRING2 ->
	  let s = seq_of_string loc s in
279
	  let s = List.map 
280
		    (fun (loc,c) -> 
281 282 283 284 285 286
		       mk loc (Internal
				 (Types.char
				    (Chars.atom
				       (Chars.Unichar.from_char c))))) s in
	  let s = s @ [mk loc (Internal (Sequence.nil_type))] in
	  multi_prod loc s
287 288 289 290 291
      ]
    
  ];

  record_spec:
292 293
    [ [ r = LIST0 [ l = [LIDENT | UIDENT]; "=";
                  o = [ "?" -> true | -> false]; 
294
                  x = pat ->
295
                    mk loc (Record (Types.LabelPool.mk l,o,x))
296 297
                ] SEP ";" ->
        match r with
298
          | [] -> mk loc (Internal Types.Record.any)
299
          | h::t -> List.fold_left (fun t1 t2 -> mk loc (And (t1,t2,true))) h t
300 301
      ] ];
  
302 303
  char:
    [ 
304
      [ c = STRING1 -> Chars.Unichar.from_char (parse_char loc c)
305 306 307 308
      | "!"; i = INT -> Chars.Unichar.from_int (int_of_string i) ]
    ];
     

309 310
  const:
    [ 
311
      [ i = INT -> Types.Integer (Big_int.big_int_of_string i)
312
      | "`"; a = [LIDENT | UIDENT] -> Types.Atom (Types.AtomPool.mk a)
313
      | c = char -> Types.Char c ]
314 315 316 317 318 319 320 321
    ];


  attrib_spec:
    [ [ r = record_spec -> r | "("; t = pat; ")" -> t ] ];

  expr_record_spec:
    [ [ r = LIST1
322 323
	      [ l = [LIDENT | UIDENT]; "="; x = expr -> 
		  (Types.LabelPool.mk l,x) ] 
324 325 326 327 328 329 330 331 332 333 334 335
	      SEP ";" ->
	  mk loc (RecordLitt r)
      ] ];
  
  expr_attrib_spec:
    [ [ r = expr_record_spec -> r ]
    | [ e = expr LEVEL "no_appl" -> e 
      | -> mk loc (RecordLitt []) 
      ] 
    ];
END

336 337 338 339 340
let pat'  = Grammar.Entry.create gram "type/pattern expression"
EXTEND GLOBAL: pat pat';
  pat': [  [ p = pat; EOI -> p ] ];
END

341
let pat = Grammar.Entry.parse pat
342 343
and expr = Grammar.Entry.parse expr
and prog = Grammar.Entry.parse prog
344

345
module From_string = struct
346
  let pat s = Grammar.Entry.parse pat' (Stream.of_string s)
347 348
  let expr s = expr (Stream.of_string s)
end
349