1 (* Copyright (C) 2004, 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/
29 prerr_endline "<NEW_TEXTUAL_PARSER>";
31 prerr_endline "</NEW_TEXTUAL_PARSER>"
34 (** if set to true each number will have a different insance number and can
35 * thus be interpreted differently than others *)
36 let use_fresh_num_instances = false
38 (** does the lexer return COMMENT tokens? *)
39 let return_comments = false
43 open DisambiguateTypes
45 exception Parse_error of Token.flocation * string
47 let cic_lexer = CicTextualLexer2.cic_lexer ~comments:return_comments ()
49 let fresh_num_instance =
51 if use_fresh_num_instances then
52 (fun () -> incr n; !n)
56 let choice_of_uri uri =
57 let term = CicUtil.term_of_uri uri in
58 (uri, (fun _ _ _ -> term))
60 let grammar = Grammar.gcreate cic_lexer
62 let term = Grammar.Entry.create grammar "term"
63 let term0 = Grammar.Entry.create grammar "term0"
64 let tactic = Grammar.Entry.create grammar "tactic"
65 let tactical = Grammar.Entry.create grammar "tactical"
66 let tactical0 = Grammar.Entry.create grammar "tactical0"
67 let command = Grammar.Entry.create grammar "command"
68 let alias_spec = Grammar.Entry.create grammar "alias_spec"
69 let macro = Grammar.Entry.create grammar "macro"
70 let script = Grammar.Entry.create grammar "script"
71 let statement = Grammar.Entry.create grammar "statement"
72 let statements = Grammar.Entry.create grammar "statements"
74 let return_term loc term = CicAst.AttributedTerm (`Loc loc, term)
77 let (x, y) = CicAst.loc_of_floc floc in
78 failwith (Printf.sprintf "Error at characters %d - %d: %s" x y msg)
80 let name_of_string = function
81 | "_" -> Cic.Anonymous
84 let string_of_name = function
85 | Cic.Anonymous -> "_"
88 let int_opt = function
90 | Some lexeme -> Some (int_of_string lexeme)
94 Pervasives.int_of_string s
96 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
98 (** the uri of an inductive type (a ".ind" uri) is not meaningful without an
99 * xpointer. Still, it's likely that an user who wrote "cic:/blabla/foo.ind"
100 * actually meant "cic:/blabla/foo.ind#xpointer(1/1)", i.e. the first inductive
101 * type in a block of mutual inductive types.
103 * This function performs the expansion foo.ind -> foo#xpointer..., if needed
105 let ind_expansion uri =
106 let len = String.length uri in
107 if len >= 4 && String.sub uri (len - 4) 4 = ".ind" then
108 uri ^ "#xpointer(1/1)"
112 let mk_binder_ast binder typ vars body =
115 let name = name_of_string var in
116 CicAst.Binder (binder, (name, typ), body))
120 GLOBAL: term term0 statement statements;
125 with Failure _ -> raise (Parse_error (loc, "integer literal expected"))
129 [ s = SYMBOL "_" -> None
130 | t = term -> Some t ]
133 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
134 | SYMBOL <:unicode<exists>> (* ∃ *) -> `Exists
135 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall ]
137 binder_high: [ [ SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda ] ];
142 | "CProp" -> `CProp ]
145 [ PAREN "("; i = IDENT; SYMBOL ":"; typ = term; PAREN ")" ->
146 (Cic.Name i, Some typ)
147 | i = IDENT -> (Cic.Name i, None)
151 [ SYMBOL "\\subst"; (* to avoid catching frequent "a [1]" cases *)
154 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
160 substituted_name: [ (* a subs.name is an explicit substitution subject *)
161 [ s = IDENT; subst = OPT subst -> CicAst.Ident (s, subst)
162 | s = URI; subst = OPT subst -> CicAst.Uri (ind_expansion s, subst)
165 name: [ (* as substituted_name with no explicit substitution *)
166 [ s = [ IDENT | SYMBOL ] -> s ]
169 [ n = name -> (n, [])
170 | PAREN "("; head = name; vars = LIST1 typed_name; PAREN ")" ->
178 PAREN "(" ; names = LIST1 IDENT SEP SYMBOL ",";
179 SYMBOL ":"; ty = term; PAREN ")" ->
181 | name = IDENT -> [name],None
183 index_name = OPT [ IDENT "on"; idx = IDENT -> idx ];
184 ty = OPT [ SYMBOL ":" ; t = term -> t ];
185 SYMBOL <:unicode<def>> (* ≝ *);
187 let rec list_of_binder binder ty final_term = function
190 CicAst.Binder (binder, (Cic.Name name, Some ty),
191 list_of_binder binder ty final_term tl)
193 let rec binder_of_arg_list binder final_term = function
196 list_of_binder binder ty
197 (binder_of_arg_list binder final_term tl) l
202 names,Some ty -> names,ty
203 | names,None -> names,CicAst.Implicit
205 let t1' = binder_of_arg_list `Lambda t1 args in
209 | Some ty -> Some (binder_of_arg_list `Pi ty args)
211 let rec get_position_of name n = function
217 (get_position_of name (n+1) tl)
219 let rec find_arg name n = function
220 | [] -> (fail loc (sprintf "Argument %s not found" name))
222 let (got,len) = get_position_of name 0 l in
224 | None -> (find_arg name (n+len) tl)
225 | Some where -> n + where)
228 (match index_name with
230 | (Some name) -> find_arg name 0 args)
232 ((Cic.Name name,ty'), t1', index)
235 constructor: [ [ name = IDENT; SYMBOL ":"; typ = term -> (name, typ) ] ];
237 [ vars = LIST1 IDENT SEP SYMBOL ",";
238 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
239 | PAREN "("; vars = LIST1 IDENT SEP SYMBOL ",";
240 typ = OPT [ SYMBOL ":"; t = term -> t ]; PAREN ")" -> (vars, typ)
243 term0: [ [ t = term; EOI -> return_term loc t ] ];
246 [ "let"; var = typed_name;
247 SYMBOL <:unicode<def>> (* ≝ *);
248 t1 = term; "in"; t2 = term ->
249 return_term loc (CicAst.LetIn (var, t1, t2))
250 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
251 defs = let_defs; "in"; body = term ->
252 return_term loc (CicAst.LetRec (ind_kind, defs, body))
256 b = binder_low; (vars, typ) = binder_vars; SYMBOL "."; body = term ->
257 let binder = mk_binder_ast b typ vars body in
258 return_term loc binder
259 | b = binder_high; (vars, typ) = binder_vars; SYMBOL "."; body = term ->
260 let binder = mk_binder_ast b typ vars body in
261 return_term loc binder
262 | t1 = term; SYMBOL <:unicode<to>> (* → *); t2 = term ->
263 return_term loc (CicAst.Binder (`Pi, (Cic.Anonymous, Some t1), t2))
265 | "logic_add" LEFTA [ (* nothing here by default *) ]
266 | "logic_mult" LEFTA [ (* nothing here by default *) ]
267 | "logic_inv" NONA [ (* nothing here by default *) ]
269 [ t1 = term; SYMBOL "="; t2 = term ->
270 return_term loc (CicAst.Appl [CicAst.Symbol ("eq", 0); t1; t2])
272 | "add" LEFTA [ (* nothing here by default *) ]
273 | "mult" LEFTA [ (* nothing here by default *) ]
274 | "power" LEFTA [ (* nothing here by default *) ]
275 | "inv" NONA [ (* nothing here by default *) ]
277 [ t1 = term; t2 = term ->
278 let rec aux = function
279 | CicAst.Appl (hd :: tl) -> aux hd @ tl
282 CicAst.Appl (aux t1 @ [t2])
285 [ sort = sort -> CicAst.Sort sort
286 | n = substituted_name -> return_term loc n
287 | i = NUM -> return_term loc (CicAst.Num (i, (fresh_num_instance ())))
288 | IMPLICIT -> return_term loc CicAst.Implicit
289 | PLACEHOLDER -> return_term loc CicAst.UserInput
292 PAREN "["; substs = LIST0 meta_subst SEP SYMBOL ";" ; PAREN "]" ->
297 int_of_string (String.sub m 1 (String.length m - 1))
298 with Failure "int_of_string" ->
299 fail loc ("Invalid meta variable number: " ^ m)
301 return_term loc (CicAst.Meta (index, substs))
302 | outtyp = OPT [ PAREN "["; typ = term; PAREN "]" -> typ ];
304 indty_ident = OPT ["in" ; id = IDENT -> id ];
308 lhs = pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *); rhs = term
310 ((lhs: CicAst.case_pattern), rhs)
314 (CicAst.Case (t, indty_ident, outtyp, patterns))
315 | PAREN "("; t1 = term; SYMBOL ":"; t2 = term; PAREN ")" ->
316 return_term loc (CicAst.Appl [CicAst.Symbol ("cast", 0); t1; t2])
317 | PAREN "("; t = term; PAREN ")" -> return_term loc t
321 [ where = OPT [ "in"; ident = IDENT -> ident ] -> where ]
323 tactic_term: [ [ t = term -> t ] ];
325 [ PAREN "["; idents = LIST0 IDENT SEP SYMBOL ";"; PAREN "]" -> idents ]
328 [ PAREN "["; idents = LIST1 IDENT SEP SYMBOL ";"; PAREN "]" -> idents ]
331 [ [ IDENT "reduce" ] -> `Reduce
332 | [ IDENT "simplify" ] -> `Simpl
333 | [ IDENT "whd" ] -> `Whd
334 | [ IDENT "normalize" ] -> `Normalize ]
337 [ [ IDENT "absurd" ]; t = tactic_term ->
338 TacticAst.Absurd (loc, t)
339 | [ IDENT "apply" ]; t = tactic_term ->
340 TacticAst.Apply (loc, t)
341 | [ IDENT "assumption" ] ->
342 TacticAst.Assumption loc
343 | [ IDENT "auto" ] ; num = OPT [ i = NUM -> int_of_string i ] ->
344 TacticAst.Auto (loc,num)
345 | [ IDENT "change" ];
346 t1 = tactic_term; "with"; t2 = tactic_term;
347 where = tactic_where ->
348 TacticAst.Change (loc, t1, t2, where)
349 (* TODO Change_pattern *)
350 | [ IDENT "contradiction" ] ->
351 TacticAst.Contradiction loc
354 TacticAst.Cut (loc, t)
355 | [ IDENT "decompose" ];
356 principles = ident_list1; where = IDENT ->
357 TacticAst.Decompose (loc, where, principles)
358 | [ IDENT "discriminate" ];
360 TacticAst.Discriminate (loc, hyp)
361 | [ IDENT "elimType" ]; t = tactic_term ->
362 TacticAst.ElimType (loc, t)
365 using = OPT [ "using"; using = tactic_term -> using ] ->
366 TacticAst.Elim (loc, t1, using)
367 | [ IDENT "exact" ]; t = tactic_term ->
368 TacticAst.Exact (loc, t)
369 | [ IDENT "exists" ] ->
372 kind = reduction_kind; t = tactic_term ->
373 TacticAst.Fold (loc, kind, t)
374 | [ IDENT "fourier" ] ->
375 TacticAst.Fourier loc
376 | IDENT "goal"; n = NUM -> TacticAst.Goal (loc, int_of_string n)
377 | [ IDENT "injection" ]; ident = IDENT ->
378 TacticAst.Injection (loc, ident)
379 | [ IDENT "intros" ];
380 num = OPT [ num = int -> num ];
381 idents = OPT ident_list0 ->
382 let idents = match idents with None -> [] | Some idents -> idents in
383 TacticAst.Intros (loc, num, idents)
384 | [ IDENT "intro" ] ->
385 TacticAst.Intros (loc, Some 1, [])
386 | [ IDENT "left" ] -> TacticAst.Left loc
388 where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
389 TacticAst.LetIn (loc, t, where)
390 | kind = reduction_kind;
392 "in"; pat = [ IDENT "goal" -> `Goal | IDENT "hyp" -> `Everywhere ] ->
395 terms = LIST0 term SEP SYMBOL "," ->
396 (match (pat, terms) with
397 | None, [] -> TacticAst.Reduce (loc, kind, None)
398 | None, terms -> TacticAst.Reduce (loc, kind, Some (terms, `Goal))
399 | Some pat, [] -> fail loc "Missing term [list]"
400 | Some pat, terms -> TacticAst.Reduce (loc, kind, Some (terms, pat)))
401 | kind = reduction_kind; where = IDENT ; IDENT "at" ; pat = term ->
402 TacticAst.ReduceAt (loc, kind, where, pat)
403 | [ IDENT "reflexivity" ] ->
404 TacticAst.Reflexivity loc
405 | [ IDENT "replace" ];
406 t1 = tactic_term; "with"; t2 = tactic_term ->
407 TacticAst.Replace (loc, t1, t2)
408 | [ IDENT "rewrite" ; IDENT "left" ] ; t = term ->
409 TacticAst.Rewrite (loc,`Left, t, None)
410 | [ IDENT "rewrite" ; IDENT "right" ] ; t = term ->
411 TacticAst.Rewrite (loc,`Right, t, None)
412 (* TODO Replace_pattern *)
413 | [ IDENT "right" ] -> TacticAst.Right loc
414 | [ IDENT "ring" ] -> TacticAst.Ring loc
415 | [ IDENT "split" ] -> TacticAst.Split loc
416 | [ IDENT "symmetry" ] ->
417 TacticAst.Symmetry loc
418 | [ IDENT "transitivity" ];
420 TacticAst.Transitivity (loc, t)
425 [ tacticals = LIST1 NEXT SEP SYMBOL ";" ->
426 TacticAst.Seq (loc, tacticals)
430 PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" ->
431 (TacticAst.Then (loc, tac, tacs))
434 [ [ IDENT "do" ]; count = int; tac = tactical ->
435 TacticAst.Do (loc, count, tac)
436 | [ IDENT "repeat" ]; tac = tactical ->
437 TacticAst.Repeat (loc, tac)
441 PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" ->
442 TacticAst.Tries (loc, tacs)
443 | IDENT "try"; tac = NEXT ->
444 TacticAst.Try (loc, tac)
445 | IDENT "fail" -> TacticAst.Fail loc
446 | IDENT "id" -> TacticAst.IdTac loc
447 | PAREN "("; tac = tactical; PAREN ")" -> tac
448 | tac = tactic -> TacticAst.Tactic (loc, tac)
452 [ [ IDENT "definition" ] -> `Definition
453 | [ IDENT "fact" ] -> `Fact
454 | [ IDENT "lemma" ] -> `Lemma
455 | [ IDENT "remark" ] -> `Remark
456 | [ IDENT "theorem" ] -> `Theorem
460 fst_name = IDENT; params = LIST0 [
461 PAREN "("; names = LIST1 IDENT SEP SYMBOL ","; SYMBOL ":";
462 typ = term; PAREN ")" -> (names, typ) ];
463 SYMBOL ":"; fst_typ = term; SYMBOL <:unicode<def>>; OPT SYMBOL "|";
464 fst_constructors = LIST0 constructor SEP SYMBOL "|";
467 name = IDENT; SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>;
468 OPT SYMBOL "|"; constructors = LIST0 constructor SEP SYMBOL "|" ->
469 (name, true, typ, constructors) ] SEP "with" -> types
473 (fun (names, typ) acc ->
474 (List.map (fun name -> (name, typ)) names) @ acc)
477 let fst_ind_type = (fst_name, true, fst_typ, fst_constructors) in
478 let tl_ind_types = match tl with None -> [] | Some types -> types in
479 let ind_types = fst_ind_type :: tl_ind_types in
484 [ [ IDENT "quit" ] -> TacticAst.Quit loc
485 (* | [ IDENT "abort" ] -> TacticAst.Abort loc *)
486 | [ IDENT "print" ]; name = QSTRING -> TacticAst.Print (loc, name)
487 (* | [ IDENT "undo" ]; steps = OPT NUM ->
488 TacticAst.Undo (loc, int_opt steps)
489 | [ IDENT "redo" ]; steps = OPT NUM ->
490 TacticAst.Redo (loc, int_opt steps) *)
491 | [ IDENT "check" ]; t = term ->
492 TacticAst.Check (loc, t)
493 | [ IDENT "hint" ] -> TacticAst.Hint loc
494 | [ IDENT "whelp"; "match" ] ; t = term ->
495 TacticAst.WMatch (loc,t)
496 | [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
497 TacticAst.WInstance (loc,t)
498 | [ IDENT "whelp"; IDENT "locate" ] ; id = IDENT ->
499 TacticAst.WLocate (loc,id)
500 | [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
501 TacticAst.WElim (loc, t)
502 | [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
503 TacticAst.WHint (loc,t)
504 | [ IDENT "print" ]; name = QSTRING -> TacticAst.Print (loc, name)
509 [ IDENT "id"; id = QSTRING; SYMBOL "="; uri = QSTRING ->
510 let alpha = "[a-zA-Z]" in
511 let num = "[0-9]+" in
512 let ident_cont = "\\("^alpha^"\\|"^num^"\\|_\\|\\\\\\)" in
513 let ident = "\\("^alpha^ident_cont^"*\\|_"^ident_cont^"+\\)" in
514 let rex = Str.regexp ("^"^ident^"$") in
515 if Str.string_match rex id 0 then
517 ("^\\(cic:/\\|theory:/\\)"^ident^
518 "\\(/"^ident^"+\\)*\\(\\."^ident^"\\)+"^
519 "\\(#xpointer("^ num^"\\(/"^num^"\\)+)\\)?$")
521 if Str.string_match rex uri 0 then
522 TacticAst.Ident_alias (id, uri)
524 raise (Parse_error (loc,sprintf "Not a valid uri: %s" uri))
526 raise (Parse_error (loc,sprintf "Not a valid identifier: %s" id))
527 | IDENT "symbol"; symbol = QSTRING;
528 instance = OPT [ PAREN "("; IDENT "instance"; n = NUM; PAREN ")" -> n ];
529 SYMBOL "="; dsc = QSTRING ->
531 match instance with Some i -> int_of_string i | None -> 0
533 TacticAst.Symbol_alias (symbol, instance, dsc)
535 instance = OPT [ PAREN "("; IDENT "instance"; n = NUM; PAREN ")" -> n ];
536 SYMBOL "="; dsc = QSTRING ->
538 match instance with Some i -> int_of_string i | None -> 0
540 TacticAst.Number_alias (instance, dsc)
545 [ IDENT "set" ]; n = QSTRING; v = QSTRING ->
546 TacticAst.Set (loc, n, v)
547 | [ IDENT "qed" ] -> TacticAst.Qed loc
548 | flavour = theorem_flavour; name = OPT IDENT; SYMBOL ":"; typ = term;
549 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
550 TacticAst.Theorem (loc, flavour, name, typ, body)
551 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
555 | ((Cic.Name name,Some ty),_,_) :: _ -> name,ty
556 | ((Cic.Name name,None),_,_) :: _ ->
557 fail loc ("No type given for " ^ name)
560 let body = CicAst.Ident (name,None) in
561 TacticAst.Theorem(loc, `Definition, Some name, ty,
562 Some (CicAst.LetRec (ind_kind, defs, body)))
564 | [ IDENT "inductive" ]; spec = inductive_spec ->
565 let (params, ind_types) = spec in
566 TacticAst.Inductive (loc, params, ind_types)
567 | [ IDENT "coinductive" ]; spec = inductive_spec ->
568 let (params, ind_types) = spec in
569 let ind_types = (* set inductive flags to false (coinductive) *)
570 List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
573 TacticAst.Inductive (loc, params, ind_types)
574 | [ IDENT "coercion" ] ; name = IDENT ->
575 TacticAst.Coercion (loc, CicAst.Ident (name,Some []))
576 | [ IDENT "coercion" ] ; name = URI ->
577 TacticAst.Coercion (loc, CicAst.Uri (name,Some []))
578 | [ IDENT "alias" ]; spec = alias_spec ->
579 TacticAst.Alias (loc, spec)
583 [ cmd = command; SYMBOL "." -> TacticAst.Command (loc, cmd)
584 | tac = tactical; SYMBOL "." -> TacticAst.Tactical (loc, tac)
585 | mac = macro; SYMBOL "." -> TacticAst.Macro (loc, mac)
590 [ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
591 TacticAst.Code (loc, ex)
593 TacticAst.Note (loc, str)
598 [ ex = executable -> TacticAst.Executable (loc,ex)
599 | com = comment -> TacticAst.Comment (loc, com)
603 [ l = LIST0 [ statement ] -> l
608 let exc_located_wrapper f =
612 | Stdpp.Exc_located (floc, Stream.Error msg) ->
613 raise (Parse_error (floc, msg))
614 | Stdpp.Exc_located (floc, exn) ->
615 raise (Parse_error (floc, (Printexc.to_string exn)))
617 let parse_term stream =
618 exc_located_wrapper (fun () -> (Grammar.Entry.parse term0 stream))
619 let parse_statement stream =
620 exc_located_wrapper (fun () -> (Grammar.Entry.parse statement stream))
621 let parse_statements stream =
622 exc_located_wrapper (fun () -> (Grammar.Entry.parse statements stream))
627 (** {2 Interface for gTopLevel} *)
629 module EnvironmentP3 =
635 let aliases_grammar = Grammar.gcreate cic_lexer
636 let aliases = Grammar.Entry.create aliases_grammar "aliases"
641 (fun domain_item (dsc, _) acc ->
643 match domain_item with
645 TacticAstPp.pp_alias (TacticAst.Ident_alias (id, dsc)) ^ "."
646 | Symbol (symb, i) ->
647 TacticAstPp.pp_alias (TacticAst.Symbol_alias (symb, i, dsc))
650 TacticAstPp.pp_alias (TacticAst.Number_alias (i, dsc)) ^ "."
655 String.concat "\n" (List.sort compare aliases)
659 aliases: [ (* build an environment from an aliases list *)
660 [ aliases = LIST0 alias; EOI ->
662 (fun env (domain_item, codomain_item) ->
663 Environment.add domain_item codomain_item env)
664 Environment.empty aliases
667 alias: [ (* return a pair <domain_item, codomain_item> from an alias *)
670 [ IDENT "id"; id = IDENT; SYMBOL "="; uri = URI ->
671 (Id id, choice_of_uri uri)
672 | IDENT "symbol"; symbol = QSTRING;
673 PAREN "("; IDENT "instance"; instance = NUM; PAREN ")";
674 SYMBOL "="; dsc = QSTRING ->
675 (Symbol (symbol, int_of_string instance),
676 DisambiguateChoices.lookup_symbol_by_dsc symbol dsc)
678 PAREN "("; IDENT "instance"; instance = NUM; PAREN ")";
679 SYMBOL "="; dsc = QSTRING ->
680 (Num (int_of_string instance),
681 DisambiguateChoices.lookup_num_by_dsc dsc)
691 (fun () -> Grammar.Entry.parse aliases (Stream.of_string s))
694 (* vim:set encoding=utf8: *)