1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
30 module Ast = CicNotationPt
31 module Env = CicNotationEnv
33 exception Parse_error of string
34 exception Level_not_found of int
36 let level1_pattern_grammar =
37 Grammar.gcreate CicNotationLexer.level1_pattern_lexer
38 let level2_ast_grammar = Grammar.gcreate CicNotationLexer.level2_ast_lexer
39 let level2_meta_grammar = Grammar.gcreate CicNotationLexer.level2_meta_lexer
41 let min_precedence = 0
42 let max_precedence = 100
45 Grammar.Entry.create level1_pattern_grammar "level1_pattern"
46 let level2_ast = Grammar.Entry.create level2_ast_grammar "level2_ast"
47 let term = Grammar.Entry.create level2_ast_grammar "term"
48 let let_defs = Grammar.Entry.create level2_ast_grammar "let_defs"
49 let protected_binder_vars = Grammar.Entry.create level2_ast_grammar "protected_binder_vars"
50 let level2_meta = Grammar.Entry.create level2_meta_grammar "level2_meta"
54 Pervasives.int_of_string s
56 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
58 (** {2 Grammar extension} *)
60 let level_of precedence associativity =
61 if precedence < min_precedence || precedence > max_precedence then
62 raise (Level_not_found precedence);
64 match associativity with
66 | Gramext.LeftA -> "L"
67 | Gramext.RightA -> "R"
69 string_of_int precedence ^ assoc_string
71 let gram_symbol s = Gramext.Stoken ("SYMBOL", s)
72 let gram_ident s = Gramext.Stoken ("IDENT", s)
73 let gram_number s = Gramext.Stoken ("NUMBER", s)
74 let gram_keyword s = Gramext.Stoken ("", s)
75 let gram_term = function
76 | None -> Gramext.Sself
77 | Some (precedence, associativity) ->
78 Gramext.Snterml (Grammar.Entry.obj (term: 'a Grammar.Entry.e),level_of precedence associativity)
83 | `Symbol s -> gram_symbol s
84 | `Keyword s -> gram_keyword s
85 | `Number s -> gram_number s
89 | Binding of string * Env.value_type
90 | Env of (string * Env.value_type) list
92 let make_action action bindings =
93 let rec aux (vl : CicNotationEnv.t) =
95 [] -> Gramext.action (fun (loc: Ast.location) -> action vl loc)
96 | NoBinding :: tl -> Gramext.action (fun _ -> aux vl tl)
97 (* LUCA: DEFCON 3 BEGIN *)
98 | Binding (name, Env.TermType l) :: tl ->
101 aux ((name, (Env.TermType l, Env.TermValue v))::vl) tl)
102 | Binding (name, Env.StringType) :: tl ->
105 aux ((name, (Env.StringType, Env.StringValue v)) :: vl) tl)
106 | Binding (name, Env.NumType) :: tl ->
109 aux ((name, (Env.NumType, Env.NumValue v)) :: vl) tl)
110 | Binding (name, Env.OptType t) :: tl ->
112 (fun (v:'a option) ->
113 aux ((name, (Env.OptType t, Env.OptValue v)) :: vl) tl)
114 | Binding (name, Env.ListType t) :: tl ->
117 aux ((name, (Env.ListType t, Env.ListValue v)) :: vl) tl)
119 Gramext.action (fun (v:CicNotationEnv.t) -> aux (v @ vl) tl)
120 (* LUCA: DEFCON 3 END *)
122 aux [] (List.rev bindings)
128 | NoBinding :: tl -> aux acc tl
129 | Env names :: tl -> aux (List.rev names @ acc) tl
130 | Binding (name, ty) :: tl -> aux ((name, ty) :: acc) tl
134 (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
135 let extract_term_production pattern =
136 let rec aux = function
137 | Ast.AttributedTerm (_, t) -> aux t
138 | Ast.Literal l -> aux_literal l
139 | Ast.Layout l -> aux_layout l
140 | Ast.Magic m -> aux_magic m
141 | Ast.Variable v -> aux_variable v
143 prerr_endline (CicNotationPp.pp_term t);
147 | `Symbol s -> [NoBinding, gram_symbol s]
149 (* assumption: s will be registered as a keyword with the lexer *)
150 [NoBinding, gram_keyword s]
151 | `Number s -> [NoBinding, gram_number s]
152 and aux_layout = function
153 | Ast.Sub (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sub"] @ aux p2
154 | Ast.Sup (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sup"] @ aux p2
155 | Ast.Below (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\below"] @ aux p2
156 | Ast.Above (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\above"] @ aux p2
157 | Ast.Frac (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\frac"] @ aux p2
158 | Ast.Atop (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\atop"] @ aux p2
159 | Ast.Over (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\over"] @ aux p2
160 | Ast.Root (p1, p2) ->
161 [NoBinding, gram_symbol "\\root"] @ aux p2
162 @ [NoBinding, gram_symbol "\\of"] @ aux p1
163 | Ast.Sqrt p -> [NoBinding, gram_symbol "\\sqrt"] @ aux p
165 | Ast.Box (_, pl) -> List.flatten (List.map aux pl)
166 | Ast.Group pl -> List.flatten (List.map aux pl)
167 and aux_magic magic =
170 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
171 let action (env_opt : CicNotationEnv.t option) (loc : Ast.location) =
173 | Some env -> List.map Env.opt_binding_some env
174 | None -> List.map Env.opt_binding_of_name p_names
176 [ Env (List.map Env.opt_declaration p_names),
178 [ [ Gramext.Sopt (Gramext.srules [ p_atoms, p_action ]) ],
179 Gramext.action action ] ]
181 | Ast.List1 (p, _) ->
182 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
183 (* let env0 = List.map list_binding_of_name p_names in
184 let grow_env_entry env n v =
187 | (n', (ty, ListValue vl)) as entry ->
188 if n' = n then n', (ty, ListValue (v :: vl)) else entry
192 let grow_env env_i env =
194 (fun env (n, (_, v)) -> grow_env_entry env n v)
197 let action (env_list : CicNotationEnv.t list) (loc : Ast.location) =
198 CicNotationEnv.coalesce_env p_names env_list
202 | Ast.List0 (_, None) -> Gramext.Slist0 s
203 | Ast.List1 (_, None) -> Gramext.Slist1 s
204 | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l)
205 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l)
208 [ Env (List.map Env.list_declaration p_names),
210 [ [ gram_of_list (Gramext.srules [ p_atoms, p_action ]) ],
211 Gramext.action action ] ]
215 | Ast.NumVar s -> [Binding (s, Env.NumType), gram_number ""]
216 | Ast.TermVar (s,level) ->
217 [Binding (s, Env.TermType level), gram_term level]
218 | Ast.IdentVar s -> [Binding (s, Env.StringType), gram_ident ""]
219 | Ast.Ascription (p, s) -> assert false (* TODO *)
220 | Ast.FreshVar _ -> assert false
221 and inner_pattern p =
222 let p_bindings, p_atoms = List.split (aux p) in
223 let p_names = flatten_opt p_bindings in
225 make_action (fun (env : CicNotationEnv.t) (loc : Ast.location) -> env)
228 p_bindings, p_atoms, p_names, action
232 type rule_id = Grammar.token Gramext.g_symbol list
234 (* mapping: rule_id -> owned keywords. (rule_id, string list) Hashtbl.t *)
235 let owned_keywords = Hashtbl.create 23
237 let extend level1_pattern ~precedence ~associativity action =
238 let p_bindings, p_atoms =
239 List.split (extract_term_production level1_pattern)
241 let level = level_of precedence associativity in
242 (* let p_names = flatten_opt p_bindings in *)
245 [ Grammar.Entry.obj (term: 'a Grammar.Entry.e),
246 Some (Gramext.Level level),
251 (fun (env: CicNotationEnv.t) (loc: Ast.location) ->
255 let keywords = CicNotationUtil.keywords_of_term level1_pattern in
256 let rule_id = p_atoms in
257 List.iter CicNotationLexer.add_level2_ast_keyword keywords;
258 Hashtbl.add owned_keywords rule_id keywords; (* keywords may be [] *)
262 let atoms = rule_id in
264 let keywords = Hashtbl.find owned_keywords rule_id in
265 List.iter CicNotationLexer.remove_level2_ast_keyword keywords
266 with Not_found -> assert false);
267 Grammar.delete_rule term atoms
271 let parse_level1_pattern_ref = ref (fun _ -> assert false)
272 let parse_level2_ast_ref = ref (fun _ -> assert false)
273 let parse_level2_meta_ref = ref (fun _ -> assert false)
275 let fold_cluster binder terms ty body =
277 (fun term body -> Ast.Binder (binder, (term, ty), body))
278 terms body (* terms are names: either Ident or FreshVar *)
280 let fold_exists terms ty body =
283 let lambda = Ast.Binder (`Lambda, (term, ty), body) in
284 Ast.Appl [ Ast.Symbol ("exists", 0); lambda ])
287 let fold_binder binder pt_names body =
289 (fun (names, ty) body -> fold_cluster binder names ty body)
292 let return_term loc term = Ast.AttributedTerm (`Loc loc, term)
294 (* create empty precedence level for "term" *)
297 Gramext.action (fun _ ->
298 failwith "internal error, lexer generated a dummy token")
300 (* Needed since campl4 on "delete_rule" remove the precedence level if it gets
301 * empty after the deletion. The lexer never generate the Stoken below. *)
302 let dummy_prod = [ [ Gramext.Stoken ("DUMMY", "") ], dummy_action ] in
303 let mk_level_list first last =
304 let rec aux acc = function
305 | i when i < first -> acc
308 ((Some (string_of_int i ^ "N"), Some Gramext.NonA, dummy_prod)
309 :: (Some (string_of_int i ^ "L"), Some Gramext.LeftA, dummy_prod)
310 :: (Some (string_of_int i ^ "R"), Some Gramext.RightA, dummy_prod)
317 [ Grammar.Entry.obj (term: 'a Grammar.Entry.e),
319 mk_level_list min_precedence max_precedence ]
321 (* {{{ Grammar for concrete syntax patterns, notation level 1 *)
323 GLOBAL: level1_pattern;
325 level1_pattern: [ [ p = l1_pattern; EOI -> CicNotationUtil.boxify p ] ];
326 l1_pattern: [ [ p = LIST1 l1_simple_pattern -> p ] ];
328 [ s = SYMBOL -> `Symbol s
329 | k = QKEYWORD -> `Keyword k
330 | n = NUMBER -> `Number n
333 sep: [ [ "sep"; sep = literal -> sep ] ];
334 (* row_sep: [ [ "rowsep"; sep = literal -> sep ] ];
335 field_sep: [ [ "fieldsep"; sep = literal -> sep ] ]; *)
337 [ "list0"; p = l1_simple_pattern; sep = OPT sep -> Ast.List0 (p, sep)
338 | "list1"; p = l1_simple_pattern; sep = OPT sep -> Ast.List1 (p, sep)
339 | "opt"; p = l1_simple_pattern -> Ast.Opt p
343 [ IDENT "L" -> Gramext.LeftA
344 | IDENT "N" -> Gramext.NonA
345 | IDENT "R" -> Gramext.RightA
348 l1_pattern_variable: [
349 [ "term"; precedence = NUMBER; assoc = l1_associativity ; id = IDENT ->
350 Ast.TermVar (id, Some (int_of_string precedence,assoc))
351 | "number"; id = IDENT -> Ast.NumVar id
352 | "ident"; id = IDENT -> Ast.IdentVar id
357 [ p1 = SELF; SYMBOL "\\sub"; p2 = SELF ->
358 return_term loc (Ast.Layout (Ast.Sub (p1, p2)))
359 | p1 = SELF; SYMBOL "\\sup"; p2 = SELF ->
360 return_term loc (Ast.Layout (Ast.Sup (p1, p2)))
361 | p1 = SELF; SYMBOL "\\below"; p2 = SELF ->
362 return_term loc (Ast.Layout (Ast.Below (p1, p2)))
363 | p1 = SELF; SYMBOL "\\above"; p2 = SELF ->
364 return_term loc (Ast.Layout (Ast.Above (p1, p2)))
365 | p1 = SELF; SYMBOL "\\over"; p2 = SELF ->
366 return_term loc (Ast.Layout (Ast.Over (p1, p2)))
367 | p1 = SELF; SYMBOL "\\atop"; p2 = SELF ->
368 return_term loc (Ast.Layout (Ast.Atop (p1, p2)))
369 (* | "array"; p = SELF; csep = OPT field_sep; rsep = OPT row_sep ->
370 return_term loc (Array (p, csep, rsep)) *)
371 | SYMBOL "\\frac"; p1 = SELF; p2 = SELF ->
372 return_term loc (Ast.Layout (Ast.Frac (p1, p2)))
373 | SYMBOL "\\sqrt"; p = SELF -> return_term loc (Ast.Layout (Ast.Sqrt p))
374 | SYMBOL "\\root"; index = SELF; SYMBOL "\\of"; arg = SELF ->
375 return_term loc (Ast.Layout (Ast.Root (arg, index)))
376 | "hbox"; LPAREN; p = l1_pattern; RPAREN ->
377 return_term loc (Ast.Layout (Ast.Box ((Ast.H, false, false), p)))
378 | "vbox"; LPAREN; p = l1_pattern; RPAREN ->
379 return_term loc (Ast.Layout (Ast.Box ((Ast.V, false, false), p)))
380 | "hvbox"; LPAREN; p = l1_pattern; RPAREN ->
381 return_term loc (Ast.Layout (Ast.Box ((Ast.HV, false, false), p)))
382 | "hovbox"; LPAREN; p = l1_pattern; RPAREN ->
383 return_term loc (Ast.Layout (Ast.Box ((Ast.HOV, false, false), p)))
384 | "break" -> return_term loc (Ast.Layout Ast.Break)
385 (* | SYMBOL "\\SPACE" -> return_term loc (Layout Space) *)
386 | LPAREN; p = l1_pattern; RPAREN ->
387 return_term loc (CicNotationUtil.group p)
390 [ i = IDENT -> return_term loc (Ast.Variable (Ast.TermVar (i,None)))
391 | m = l1_magic_pattern -> return_term loc (Ast.Magic m)
392 | v = l1_pattern_variable -> return_term loc (Ast.Variable v)
393 | l = literal -> return_term loc (Ast.Literal l)
399 (* {{{ Grammar for ast magics, notation level 2 *)
403 [ IDENT "L" -> Gramext.LeftA
404 | IDENT "N" -> Gramext.NonA
405 | IDENT "R" -> Gramext.RightA
409 [ "term"; precedence = NUMBER; assoc = l2_associativity; id = IDENT ->
410 Ast.TermVar (id,Some (int_of_string precedence, assoc))
411 | "number"; id = IDENT -> Ast.NumVar id
412 | "ident"; id = IDENT -> Ast.IdentVar id
413 | "fresh"; id = IDENT -> Ast.FreshVar id
414 | "anonymous" -> Ast.TermVar ("_",None)
415 | id = IDENT -> Ast.TermVar (id,None)
419 [ "fold"; kind = [ "left" -> `Left | "right" -> `Right ];
420 base = level2_meta; "rec"; id = IDENT; recursive = level2_meta ->
421 Ast.Fold (kind, base, [id], recursive)
422 | "default"; some = level2_meta; none = level2_meta ->
423 Ast.Default (some, none)
424 | "if"; p_test = level2_meta;
425 "then"; p_true = level2_meta;
426 "else"; p_false = level2_meta ->
427 Ast.If (p_test, p_true, p_false)
432 [ magic = l2_magic -> Ast.Magic magic
433 | var = l2_variable -> Ast.Variable var
434 | blob = UNPARSED_AST ->
435 !parse_level2_ast_ref (Ulexing.from_utf8_string blob)
441 (* {{{ Grammar for ast patterns, notation level 2 *)
443 GLOBAL: level2_ast term let_defs protected_binder_vars;
444 level2_ast: [ [ p = term -> p ] ];
448 | "Type" -> `Type (CicUniv.fresh ())
449 | "CProp" -> `CProp (CicUniv.fresh ())
453 [ SYMBOL "\\subst"; (* to avoid catching frequent "a [1]" cases *)
456 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
463 [ s = SYMBOL "_" -> None
464 | p = term -> Some p ]
467 [ SYMBOL "["; substs = LIST0 meta_subst; SYMBOL "]" -> substs ]
469 possibly_typed_name: [
470 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
472 | arg = single_arg -> arg, None
473 | SYMBOL "_" -> Ast.Ident ("_", None), None
474 | LPAREN; SYMBOL "_"; SYMBOL ":"; typ = term; RPAREN ->
475 Ast.Ident ("_", None), Some typ
479 [ id = IDENT -> Ast.Pattern (id, None, [])
480 | LPAREN; id = IDENT; vars = LIST1 possibly_typed_name; RPAREN ->
481 Ast.Pattern (id, None, vars)
482 | id = IDENT; vars = LIST1 possibly_typed_name ->
483 Ast.Pattern (id, None, vars)
484 | SYMBOL "_" -> Ast.Wildcard
488 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
489 (* | SYMBOL <:unicode<exists>> |+ ∃ +| -> `Exists *)
490 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall
491 | SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda
495 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
496 SYMBOL ":"; ty = term; RPAREN ->
497 List.map (fun n -> Ast.Ident (n, None)) names, Some ty
498 | name = IDENT -> [Ast.Ident (name, None)], None
499 | blob = UNPARSED_META ->
500 let meta = !parse_level2_meta_ref (Ulexing.from_utf8_string blob) in
502 | Ast.Variable (Ast.FreshVar _) -> [meta], None
503 | Ast.Variable (Ast.TermVar ("_",_)) -> [Ast.Ident ("_", None)], None
504 | _ -> failwith "Invalid bound name."
508 [ name = IDENT -> Ast.Ident (name, None)
509 | blob = UNPARSED_META ->
510 let meta = !parse_level2_meta_ref (Ulexing.from_utf8_string blob) in
512 | Ast.Variable (Ast.FreshVar _)
513 | Ast.Variable (Ast.IdentVar _) -> meta
514 | Ast.Variable (Ast.TermVar ("_",_)) -> Ast.Ident ("_", None)
515 | _ -> failwith "Invalid index name."
522 index_name = OPT [ "on"; id = single_arg -> id ];
523 ty = OPT [ SYMBOL ":" ; p = term -> p ];
524 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
525 let rec position_of name p = function
527 | n :: _ when n = name -> Some p, p
528 | _ :: tl -> position_of name (p + 1) tl
530 let rec find_arg name n = function
532 Ast.fail loc (sprintf "Argument %s not found"
533 (CicNotationPp.pp_term name))
535 (match position_of name 0 l with
536 | None, len -> find_arg name (n + len) tl
537 | Some where, len -> n + where)
540 match index_name with
542 | Some index_name -> find_arg index_name 0 args
547 (function (names,ty) -> List.map (function x -> x,ty) names
550 args, (name, ty), body, index
557 l = LIST1 single_arg SEP SYMBOL "," -> l
558 | SYMBOL "_" -> [Ast.Ident ("_", None)] ];
559 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
562 protected_binder_vars: [
563 [ LPAREN; vars = binder_vars; RPAREN -> vars
566 maybe_protected_binder_vars: [
567 [ vars = binder_vars -> vars
568 | vars = protected_binder_vars -> vars
571 term: LEVEL "10N" [ (* let in *)
572 [ "let"; var = possibly_typed_name; SYMBOL <:unicode<def>> (* ≝ *);
573 p1 = term; "in"; p2 = term ->
574 return_term loc (Ast.LetIn (var, p1, p2))
575 | LETCOREC; defs = let_defs; "in";
577 return_term loc (Ast.LetRec (`CoInductive, defs, body))
578 | LETREC; defs = let_defs; "in";
580 return_term loc (Ast.LetRec (`Inductive, defs, body))
583 term: LEVEL "20R" (* binder *)
585 [ b = binder; (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term ->
586 return_term loc (fold_cluster b vars typ body)
587 | SYMBOL <:unicode<exists>> (* ∃ *);
588 (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term ->
589 return_term loc (fold_exists vars typ body)
592 term: LEVEL "70L" (* apply *)
594 [ p1 = term; p2 = term ->
595 let rec aux = function
596 | Ast.Appl (hd :: tl)
597 | Ast.AttributedTerm (_, Ast.Appl (hd :: tl)) ->
601 return_term loc (Ast.Appl (aux p1 @ [p2]))
604 term: LEVEL "90N" (* simple *)
606 [ id = IDENT -> return_term loc (Ast.Ident (id, None))
607 | id = IDENT; s = explicit_subst ->
608 return_term loc (Ast.Ident (id, Some s))
609 | s = CSYMBOL -> return_term loc (Ast.Symbol (s, 0))
610 | u = URI -> return_term loc (Ast.Uri (u, None))
611 | n = NUMBER -> return_term loc (Ast.Num (n, 0))
612 | IMPLICIT -> return_term loc (Ast.Implicit)
613 | PLACEHOLDER -> return_term loc Ast.UserInput
614 | m = META -> return_term loc (Ast.Meta (int_of_string m, []))
615 | m = META; s = meta_substs ->
616 return_term loc (Ast.Meta (int_of_string m, s))
617 | s = sort -> return_term loc (Ast.Sort s)
619 indty_ident = OPT [ "in"; id = IDENT -> id, None ];
620 outtyp = OPT [ "return"; ty = term -> ty ];
623 lhs = match_pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *);
628 return_term loc (Ast.Case (t, indty_ident, outtyp, patterns))
629 | LPAREN; p1 = term; SYMBOL ":"; p2 = term; RPAREN ->
630 return_term loc (Ast.Cast (p1, p2))
631 | LPAREN; p = term; RPAREN -> p
632 | blob = UNPARSED_META ->
633 !parse_level2_meta_ref (Ulexing.from_utf8_string blob)
639 (** {2 API implementation} *)
641 let exc_located_wrapper f =
645 | Stdpp.Exc_located (floc, Stream.Error msg) ->
646 raise (HExtlib.Localized (floc, Parse_error msg))
647 | Stdpp.Exc_located (floc, exn) ->
648 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
650 let parse_level1_pattern lexbuf =
652 (fun () -> Grammar.Entry.parse level1_pattern (Obj.magic lexbuf))
654 let parse_level2_ast lexbuf =
656 (fun () -> Grammar.Entry.parse level2_ast (Obj.magic lexbuf))
658 let parse_level2_meta lexbuf =
660 (fun () -> Grammar.Entry.parse level2_meta (Obj.magic lexbuf))
663 parse_level1_pattern_ref := parse_level1_pattern;
664 parse_level2_ast_ref := parse_level2_ast;
665 parse_level2_meta_ref := parse_level2_meta
667 let parse_term lexbuf =
669 (fun () -> (Grammar.Entry.parse term (Obj.magic lexbuf)))
673 let print_l2_pattern () =
674 Grammar.print_entry Format.std_formatter (Grammar.Entry.obj term);
675 Format.pp_print_flush Format.std_formatter ();
678 (* vim:set encoding=utf8 foldmethod=marker: *)