1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
|
(************************************************************************)
(* * The Coq Proof Assistant / The Coq Development Team *)
(* v * Copyright INRIA, CNRS and contributors *)
(* <O___,, * (see version control and CREDITS file for authors & dates) *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(* * (see LICENSE file for the text of the license) *)
(************************************************************************)
(* Merge with metasyntax? *)
open Constrexpr
open Notation_gram
(** {6 Declare the parsing rules and entries of a (possibly uninterpreted) notation } *)
val declare_notation_grammar : notation -> notation_grammar -> unit
val grammar_of_notation : notation -> notation_grammar
(** raise [Not_found] if not declared *)
val declare_notation_non_terminals : notation -> Extend.constr_entry_key list -> unit
val non_terminals_of_notation : notation -> Extend.constr_entry_key list
(** [longest_common_prefix ntn] looks among notations [ntn'] already
registered with [declare_notation_non_terminals ntn'] for the one
that shares the longest common prefix with [ntn], if any returns
[Some (ntn', k)] where [k] is the number of nonterminal symbols in
the common prefix between [ntn] and [ntn']. *)
val longest_common_prefix : notation -> (notation * int) option
(** Returns notations with defined parsing/printing rules *)
val get_defined_notations : unit -> notation list
|
