open Printf
exception Parse_error of Token.flocation * string
+exception Level_not_found of int
-module NotationLexer =
-struct
- type te = string * string
- let lexer = CicNotationLexer.notation_lexer
-end
-module NotationGrammar = Grammar.GMake (NotationLexer)
-
-let level1_pattern = NotationGrammar.Entry.create "level1_pattern"
-let level2_pattern = NotationGrammar.Entry.create "level2_pattern"
-let level3_interpretation = NotationGrammar.Entry.create "level3_interpretation"
-let notation = NotationGrammar.Entry.create "notation" (* level1 <-> level 2 *)
+let grammar = Grammar.gcreate CicNotationLexer.notation_lexer
+
+let level1_pattern = Grammar.Entry.create grammar "level1_pattern"
+let level2_pattern = Grammar.Entry.create grammar "level2_pattern"
+let level3_term = Grammar.Entry.create grammar "level3_term"
+let l2_pattern = Grammar.Entry.create grammar "l2_pattern"
+let notation = Grammar.Entry.create grammar "notation" (* level1 <-> level 2 *)
let interpretation =
- NotationGrammar.Entry.create "interpretation" (* level2 <-> level 3 *)
+ Grammar.Entry.create grammar "interpretation" (* level2 <-> level 3 *)
let return_term loc term = ()
(fun (names, ty) body -> fold_cluster binder names ty body)
pt_names body
-GEXTEND NotationGrammar
- GLOBAL: level1_pattern level2_pattern level3_interpretation notation
- interpretation;
+let return_term loc term = AttributedTerm (`Loc loc, term)
+
+EXTEND
+ GLOBAL: level1_pattern level2_pattern level3_term
+ l2_pattern
+ notation interpretation;
(* {{{ Grammar for concrete syntax patterns, notation level 1 *)
- level1_pattern: [ [ p = l1_pattern -> boxify p ] ];
+ level1_pattern: [ [ p = l1_pattern; EOI -> boxify p ] ];
l1_pattern: [ [ p = LIST0 l1_simple_pattern -> p ] ];
literal: [
[ s = SYMBOL -> `Symbol s
];
l1_simple_pattern:
[ "layout" LEFTA
- [ p1 = SELF; SYMBOL "\\SUB"; p2 = SELF -> Layout (Sub (p1, p2))
- | p1 = SELF; SYMBOL "\\SUP"; p2 = SELF -> Layout (Sup (p1, p2))
- | p1 = SELF; SYMBOL "\\BELOW"; p2 = SELF -> Layout (Below (p1, p2))
- | p1 = SELF; SYMBOL "\\ABOVE"; p2 = SELF -> Layout (Above (p1, p2))
+ [ p1 = SELF; SYMBOL "\\SUB"; p2 = SELF ->
+ return_term loc (Layout (Sub (p1, p2)))
+ | p1 = SELF; SYMBOL "\\SUP"; p2 = SELF ->
+ return_term loc (Layout (Sup (p1, p2)))
+ | p1 = SELF; SYMBOL "\\BELOW"; p2 = SELF ->
+ return_term loc (Layout (Below (p1, p2)))
+ | p1 = SELF; SYMBOL "\\ABOVE"; p2 = SELF ->
+ return_term loc (Layout (Above (p1, p2)))
| SYMBOL "["; p1 = l1_pattern; SYMBOL "\\OVER"; p2 = l1_pattern;
SYMBOL "]" ->
- Layout (Frac (boxify p1, boxify p2))
+ return_term loc (Layout (Over (boxify p1, boxify p2)))
| SYMBOL "["; p1 = l1_pattern; SYMBOL "\\ATOP"; p2 = l1_pattern;
SYMBOL "]" ->
- Layout (Atop (boxify p1, boxify p2))
+ return_term loc (Layout (Atop (boxify p1, boxify p2)))
(* | SYMBOL "\\ARRAY"; p = SELF; csep = OPT field_sep; rsep = OPT row_sep ->
- Array (p, csep, rsep) *)
- | SYMBOL "\\FRAC"; p1 = SELF; p2 = SELF -> Layout (Frac (p1, p2))
- | SYMBOL "\\SQRT"; p = SELF -> Layout (Sqrt p)
+ return_term loc (Array (p, csep, rsep)) *)
+ | SYMBOL "\\FRAC"; p1 = SELF; p2 = SELF ->
+ return_term loc (Layout (Frac (p1, p2)))
+ | SYMBOL "\\SQRT"; p = SELF -> return_term loc (Layout (Sqrt p))
| SYMBOL "\\ROOT"; index = l1_pattern; SYMBOL "\\OF"; arg = SELF ->
- Layout (Root (arg, Layout (Box (H, index))))
+ return_term loc (Layout (Root (arg, Layout (Box (H, index)))))
| SYMBOL "\\HBOX"; SYMBOL "["; p = l1_pattern; SYMBOL "]" ->
- Layout (Box (H, p))
+ return_term loc (Layout (Box (H, p)))
| SYMBOL "\\VBOX"; SYMBOL "["; p = l1_pattern; SYMBOL "]" ->
- Layout (Box (V, p))
- | SYMBOL "\\BREAK" -> Layout Break
- | SYMBOL "["; p = l1_pattern; SYMBOL "]" -> Layout (Box (H, p))
+ return_term loc (Layout (Box (V, p)))
+ | SYMBOL "\\BREAK" -> return_term loc (Layout Break)
+ | SYMBOL "["; p = l1_pattern; SYMBOL "]" ->
+ return_term loc (boxify p)
| SYMBOL "["; p = l1_pattern; SYMBOL "\\AS"; id = IDENT; SYMBOL "]" ->
- Variable (Ascription (Layout (Box (H, p)), id))
+ return_term loc (Variable (Ascription (Layout (Box (H, p)), id)))
]
| "simple" NONA
- [ m = l1_magic_pattern -> Magic m
- | v = l1_pattern_variable -> Variable v
+ [ m = l1_magic_pattern -> return_term loc (Magic m)
+ | v = l1_pattern_variable -> return_term loc (Variable v)
+ | l = literal -> return_term loc (Literal l)
]
];
(* }}} *)
(* {{{ Grammar for ast patterns, notation level 2 *)
- level2_pattern: [ [ p = l2_pattern -> p ] ];
+ level2_pattern: [ [ p = l2_pattern; EOI -> p ] ];
sort: [
[ SYMBOL "\\PROP" -> `Prop
| SYMBOL "\\SET" -> `Set
]
];
l2_pattern:
- [ "letin" NONA
+ [ "0" [ ]
+ | "10" NONA (* let in *)
[ IDENT "let"; var = possibly_typed_name; SYMBOL <:unicode<def>> (* ≝ *);
p1 = l2_pattern; "in"; p2 = l2_pattern ->
- LetIn (var, p1, p2)
+ return_term loc (LetIn (var, p1, p2))
| IDENT "let"; k = induction_kind; defs = let_defs; IDENT "in";
body = l2_pattern ->
- LetRec (k, defs, body)
+ return_term loc (LetRec (k, defs, body))
]
- | "binder" RIGHTA
+ | "20" RIGHTA (* binder *)
[ b = binder; names = bound_names; SYMBOL "."; body = l2_pattern ->
- fold_binder b names body
+ return_term loc (fold_binder b names body)
]
- | "extension"
- [ ]
- | "apply" LEFTA
+ | "30" [ ]
+ | "40" [ ]
+ | "50" [ ]
+ | "60" [ ]
+ | "70" LEFTA (* apply *)
[ p1 = l2_pattern; p2 = l2_pattern ->
let rec aux = function
- | Appl (hd :: tl) -> aux hd @ tl
+ | Appl (hd :: tl)
+ | AttributedTerm (_, Appl (hd :: tl)) ->
+ aux hd @ tl
| term -> [term]
in
- Appl (aux p1 @ [p2])
+ return_term loc (Appl (aux p1 @ [p2]))
]
- | "simple" NONA
- [ id = IDENT -> Ident (id, None)
- | id = IDENT; s = explicit_subst -> Ident (id, Some s)
- | u = URI -> Uri (u, None)
- | n = NUMBER -> Num (n, 0)
- | IMPLICIT -> Implicit
- | m = META -> Meta (int_of_string m, [])
- | m = META; s = meta_subst -> Meta (int_of_string m, s)
- | s = sort -> Sort s
- | s = SYMBOL -> Symbol (s, 0)
+ | "80" [ ]
+ | "90" NONA (* simple *)
+ [ id = IDENT -> return_term loc (Ident (id, None))
+ | id = IDENT; s = explicit_subst -> return_term loc (Ident (id, Some s))
+ | u = URI -> return_term loc (Uri (u, None))
+ | n = NUMBER -> prerr_endline "number"; return_term loc (Num (n, 0))
+ | IMPLICIT -> return_term loc (Implicit)
+ | m = META -> return_term loc (Meta (int_of_string m, []))
+ | m = META; s = meta_subst -> return_term loc (Meta (int_of_string m, s))
+ | s = sort -> return_term loc (Sort s)
| outtyp = OPT [ SYMBOL "["; ty = l2_pattern; SYMBOL "]" -> ty ];
IDENT "match"; t = l2_pattern;
indty_ident = OPT [ SYMBOL ":"; id = IDENT -> id ];
lhs, rhs
] SEP SYMBOL "|";
SYMBOL "]" ->
- Case (t, indty_ident, outtyp, patterns)
+ return_term loc (Case (t, indty_ident, outtyp, patterns))
| SYMBOL "("; p1 = l2_pattern; SYMBOL ":"; p2 = l2_pattern; SYMBOL ")" ->
- Appl [ Symbol ("cast", 0); p1; p2 ]
+ return_term loc (Appl [ Symbol ("cast", 0); p1; p2 ])
| SYMBOL "("; p = l2_pattern; SYMBOL ")" -> p
- | v = l2_pattern_variable -> Variable v
- | m = l2_magic_pattern -> Magic m
+ | v = l2_pattern_variable -> return_term loc (Variable v)
+ | m = l2_magic_pattern -> return_term loc (Magic m)
]
+ | "100" [ ]
];
(* }}} *)
(* {{{ Grammar for interpretation, notation level 3 *)
- level3_interpretation: [ [ i = interpretation -> () ] ];
argument: [
- [ i = IDENT -> ()
- | SYMBOL <:unicode<eta>> (* η *); SYMBOL "."; a = SELF -> ()
- | SYMBOL <:unicode<eta>> (* η *); i = IDENT; SYMBOL "."; a = SELF -> ()
+ [ id = IDENT -> IdentArg id
+ | SYMBOL <:unicode<eta>> (* η *); SYMBOL "."; a = SELF -> EtaArg (None, a)
+ | SYMBOL <:unicode<eta>> (* η *); id = IDENT; SYMBOL "."; a = SELF ->
+ EtaArg (Some id, a)
]
];
- l3_term: [
- [ u = URI -> ()
- | a = argument -> ()
- | SYMBOL "("; terms = LIST1 SELF; SYMBOL ")" -> ()
+ level3_term: [
+ [ u = URI -> UriPattern u
+ | a = argument -> ArgPattern a
+ | SYMBOL "("; terms = LIST1 SELF; SYMBOL ")" ->
+ (match terms with
+ | [] -> assert false
+ | [term] -> term
+ | terms -> ApplPattern terms)
]
];
(* }}} *)
];
interpretation: [
[ IDENT "interpretation"; s = SYMBOL; args = LIST1 argument; IDENT "as";
- t = l3_term ->
+ t = level3_term ->
()
]
];
raise (Parse_error (floc, (Printexc.to_string exn)))
let parse_syntax_pattern stream =
- exc_located_wrapper
- (fun () ->
- (NotationGrammar.Entry.parse level1_pattern
- (NotationGrammar.parsable stream)))
+ exc_located_wrapper (fun () -> Grammar.Entry.parse level1_pattern stream)
let parse_ast_pattern stream =
- exc_located_wrapper
- (fun () ->
- (NotationGrammar.Entry.parse level2_pattern
- (NotationGrammar.parsable stream)))
+ exc_located_wrapper (fun () -> Grammar.Entry.parse level2_pattern stream)
let parse_interpretation stream =
- exc_located_wrapper
- (fun () ->
- (NotationGrammar.Entry.parse level3_interpretation
- (NotationGrammar.parsable stream)))
+ exc_located_wrapper (fun () -> Grammar.Entry.parse level3_term stream)
+
+(** {2 Grammar extension} *)
+
+type associativity_kind = [ `Left | `Right | `None ]
+
+let symbol s = Gramext.Stoken ("SYMBOL", s)
+let ident s = Gramext.Stoken ("IDENT", s)
+let number s = Gramext.Stoken ("NUMBER", s)
+let term = Gramext.Sself
+
+type env_type = (string * (value_type * value)) list
+
+let rec pp_value =
+ function
+ | TermValue _ -> "@TERM@"
+ | StringValue s -> sprintf "\"%s\"" s
+ | NumValue n -> n
+ | OptValue (Some v) -> "Some " ^ pp_value v
+ | OptValue None -> "None"
+ | ListValue l -> sprintf "[%s]" (String.concat "; " (List.map pp_value l))
+
+let rec pp_value_type =
+ function
+ | TermType -> "Term"
+ | StringType -> "String"
+ | NumType -> "Number"
+ | OptType t -> "Maybe " ^ pp_value_type t
+ | ListType l -> "List " ^ pp_value_type l
+
+let pp_env env =
+ String.concat "; "
+ (List.map
+ (fun (name, (ty, value)) ->
+ sprintf "%s : %s = %s" name (pp_value_type ty) (pp_value value))
+ env)
+
+let make_action action bindings =
+ let rec aux (vl : env_type) =
+ function
+ [] ->
+ prerr_endline "aux: make_action";
+ Gramext.action (fun (loc: location) -> action vl loc)
+ | None :: tl ->
+ prerr_endline "aux: none";
+ Gramext.action (fun _ -> aux vl tl)
+ (* LUCA: DEFCON 3 BEGIN *)
+ | Some (name, TermType) :: tl ->
+ prerr_endline "aux: term";
+ Gramext.action
+ (fun (v:term) -> aux ((name, (TermType, (TermValue v)))::vl) tl)
+ | Some (name, StringType) :: tl ->
+ prerr_endline "aux: string";
+ Gramext.action
+ (fun (v:string) ->
+ aux ((name, (StringType, (StringValue v))) :: vl) tl)
+ | Some (name, NumType) :: tl ->
+ prerr_endline "aux: num";
+ Gramext.action
+ (fun (v:string) -> aux ((name, (NumType, (NumValue v))) :: vl) tl)
+ | Some (name, OptType t) :: tl ->
+ prerr_endline "aux: opt";
+ Gramext.action
+ (fun (v:'a option) ->
+ aux ((name, (OptType t, (OptValue v))) :: vl) tl)
+ | Some (name, ListType t) :: tl ->
+ prerr_endline "aux: list";
+ Gramext.action
+ (fun (v:'a list) ->
+ aux ((name, (ListType t, (ListValue v))) :: vl) tl)
+ (* LUCA: DEFCON 3 END *)
+ in
+ aux [] (List.rev bindings)
+
+let flatten_opt =
+ let rec aux acc =
+ function
+ [] -> List.rev acc
+ | None::tl -> aux acc tl
+ | Some hd::tl -> aux (hd::acc) tl
+ in
+ aux []
+
+ (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
+let extract_term_production pattern =
+ let rec aux = function
+ | Literal l -> aux_literal l
+ | Layout l -> aux_layout l
+ | Magic m -> aux_magic m
+ | Variable v -> aux_variable v
+ | _ -> assert false
+ and aux_literal = function
+ | `Symbol s -> [None, symbol s]
+ | `Keyword s -> [None, ident s]
+ | `Number s -> [None, number s]
+ and aux_layout = function
+ | Sub (p1, p2) -> aux p1 @ [None, symbol "\\SUB"] @ aux p2
+ | Sup (p1, p2) -> aux p1 @ [None, symbol "\\SUP"] @ aux p2
+ | Below (p1, p2) -> aux p1 @ [None, symbol "\\BELOW"] @ aux p2
+ | Above (p1, p2) -> aux p1 @ [None, symbol "\\ABOVE"] @ aux p2
+ | Frac (p1, p2) -> aux p1 @ [None, symbol "\\FRAC"] @ aux p2
+ | Atop (p1, p2) -> aux p1 @ [None, symbol "\\ATOP"] @ aux p2
+ | Over (p1, p2) -> aux p1 @ [None, symbol "\\OVER"] @ aux p2
+ | Root (p1, p2) ->
+ [None, symbol "\\ROOT"] @ aux p2 @ [None, symbol "\\OF"] @ aux p1
+ | Sqrt p -> [None, symbol "\\SQRT"] @ aux p
+ | Break -> []
+ | Box (_, pl) -> List.flatten (List.map aux pl)
+ and aux_magic = function
+ | Opt p ->
+ let p_bindings, p_atoms = List.split (aux p) in
+ let p_names = flatten_opt p_bindings in
+ [ None,
+ Gramext.srules
+ [ [ Gramext.Sopt
+ (Gramext.srules
+ [ p_atoms,
+ (make_action
+ (fun (env : env_type) (loc : location) ->
+ prerr_endline "inner opt action";
+ env)
+ p_bindings)])],
+ Gramext.action
+ (fun (env_opt : env_type option) (loc : location) ->
+ match env_opt with
+ Some env ->
+ prerr_endline "opt action (Some _)";
+ List.map
+ (fun (name, (typ, v)) ->
+ (name, (OptType typ, OptValue (Some v))))
+ env
+ | None ->
+ prerr_endline "opt action (None)";
+ List.map
+ (fun (name, typ) ->
+ (name, (OptType typ, OptValue None)))
+ p_names) ]]
+ | _ -> assert false
+ and aux_variable = function
+ | NumVar s -> [Some (s, NumType), number ""]
+ | TermVar s -> [Some (s, TermType), term]
+ | IdentVar s -> [Some (s, StringType), ident ""]
+ | Ascription (p, s) -> assert false (* TODO *)
+ | FreshVar _ -> assert false
+ in
+ aux pattern
+
+let level_of_int precedence =
+ (* TODO "mod" test to be removed as soon as we add all 100 levels *)
+ if precedence mod 10 <> 0 || precedence < 0 || precedence > 100 then
+ raise (Level_not_found precedence);
+ string_of_int precedence
+
+type rule_id = Token.t Gramext.g_symbol list
+
+let extend level1_pattern ?(precedence = 0) ?associativity action =
+ let p_bindings, p_atoms =
+ List.split (extract_term_production level1_pattern)
+ in
+ let level = level_of_int precedence in
+ let p_names = flatten_opt p_bindings in
+ let entry = Grammar.Entry.obj (l2_pattern: 'a Grammar.Entry.e) in
+ let _ =
+ prerr_endline (string_of_int (List.length p_bindings));
+ Grammar.extend
+ [ entry, Some (Gramext.Level level),
+ [ Some level, (* TODO should we put None here? *)
+ associativity,
+ [ p_atoms,
+ (make_action
+ (fun (env: env_type) (loc: location) -> (action env loc))
+ p_bindings) ]]]
+ in
+ p_atoms
+
+let delete atoms = Grammar.delete_rule l2_pattern atoms
+
+let print_l2_pattern () =
+ Grammar.print_entry Format.std_formatter (Grammar.Entry.obj l2_pattern);
+ Format.pp_print_flush Format.std_formatter ();
+ flush stdout
(* vim:set encoding=utf8 foldmethod=marker: *)
projects / helm.git / blobdiff