chore(*): remove remaining references to by+ and begin+
This commit is contained in:
parent
b7b4b6d838
commit
f55e456c84
4 changed files with 5 additions and 11 deletions
|
@ -9,7 +9,7 @@
|
||||||
|
|
||||||
(defconst lean-keywords1
|
(defconst lean-keywords1
|
||||||
'("import" "prelude" "tactic_hint" "protected" "private" "noncomputable" "definition" "renaming"
|
'("import" "prelude" "tactic_hint" "protected" "private" "noncomputable" "definition" "renaming"
|
||||||
"hiding" "exposing" "parameter" "parameters" "begin" "begin+" "proof" "qed" "conjecture" "constant" "constants"
|
"hiding" "exposing" "parameter" "parameters" "begin" "proof" "qed" "conjecture" "constant" "constants"
|
||||||
"hypothesis" "lemma" "corollary" "variable" "variables" "premise" "premises" "theory"
|
"hypothesis" "lemma" "corollary" "variable" "variables" "premise" "premises" "theory"
|
||||||
"print" "theorem" "proposition" "example" "abbreviation" "abstract"
|
"print" "theorem" "proposition" "example" "abbreviation" "abstract"
|
||||||
"open" "as" "export" "override" "axiom" "axioms" "inductive" "with" "structure" "record" "universe" "universes"
|
"open" "as" "export" "override" "axiom" "axioms" "inductive" "with" "structure" "record" "universe" "universes"
|
||||||
|
@ -26,11 +26,6 @@
|
||||||
"lean keywords ending with 'word' (not symbol)")
|
"lean keywords ending with 'word' (not symbol)")
|
||||||
(defconst lean-keywords1-regexp
|
(defconst lean-keywords1-regexp
|
||||||
(eval `(rx word-start (or ,@lean-keywords1) word-end)))
|
(eval `(rx word-start (or ,@lean-keywords1) word-end)))
|
||||||
(defconst lean-keywords2
|
|
||||||
'("by+" "begin+")
|
|
||||||
"lean keywords ending with 'symbol'")
|
|
||||||
(defconst lean-keywords2-regexp
|
|
||||||
(eval `(rx word-start (or ,@lean-keywords2) symbol-end)))
|
|
||||||
(defconst lean-constants
|
(defconst lean-constants
|
||||||
'("#" "@" "!" "->" "∼" "↔" "/" "==" "=" ":=" "<->" "/\\" "\\/" "∧" "∨"
|
'("#" "@" "!" "->" "∼" "↔" "/" "==" "=" ":=" "<->" "/\\" "\\/" "∧" "∨"
|
||||||
"≠" "<" ">" "≤" "≥" "¬" "<=" ">=" "⁻¹" "⬝" "▸" "+" "*" "-" "/" "λ"
|
"≠" "<" ">" "≤" "≥" "¬" "<=" ">=" "⁻¹" "⬝" "▸" "+" "*" "-" "/" "λ"
|
||||||
|
@ -170,7 +165,6 @@
|
||||||
(,(rx (or "∘if")) . 'font-lock-constant-face)
|
(,(rx (or "∘if")) . 'font-lock-constant-face)
|
||||||
;; Keywords
|
;; Keywords
|
||||||
("\\(set_option\\)[ \t]*\\([^ \t\n]*\\)" (2 'font-lock-constant-face))
|
("\\(set_option\\)[ \t]*\\([^ \t\n]*\\)" (2 'font-lock-constant-face))
|
||||||
(,lean-keywords2-regexp . 'font-lock-keyword-face)
|
|
||||||
(,lean-keywords1-regexp . 'font-lock-keyword-face)
|
(,lean-keywords1-regexp . 'font-lock-keyword-face)
|
||||||
(,(rx word-start (group "example") ".") (1 'font-lock-keyword-face))
|
(,(rx word-start (group "example") ".") (1 'font-lock-keyword-face))
|
||||||
(,(rx (or "∎")) . 'font-lock-keyword-face)
|
(,(rx (or "∎")) . 'font-lock-keyword-face)
|
||||||
|
|
|
@ -568,7 +568,7 @@ static expr parse_obtain(parser & p, unsigned, expr const *, pos_info const & po
|
||||||
// When from_term is not just a constant or local constant, we compile obtain as:
|
// When from_term is not just a constant or local constant, we compile obtain as:
|
||||||
//
|
//
|
||||||
// have H : _, from from_term,
|
// have H : _, from from_term,
|
||||||
// (by+ exact (obtain ps, from H, goal_term)) H
|
// (by exact (obtain ps, from H, goal_term)) H
|
||||||
//
|
//
|
||||||
// Motivation, we want "from_term" (and its type) to be elaborated before processing the
|
// Motivation, we want "from_term" (and its type) to be elaborated before processing the
|
||||||
// obtain-expression
|
// obtain-expression
|
||||||
|
|
|
@ -90,7 +90,7 @@ static char const * g_decreasing_unicode = "↓";
|
||||||
void init_token_table(token_table & t) {
|
void init_token_table(token_table & t) {
|
||||||
pair<char const *, unsigned> builtin[] =
|
pair<char const *, unsigned> builtin[] =
|
||||||
{{"fun", 0}, {"Pi", 0}, {"let", 0}, {"in", 0}, {"at", 0}, {"have", 0}, {"assert", 0}, {"suppose", 0}, {"show", 0}, {"suffices", 0}, {"obtain", 0},
|
{{"fun", 0}, {"Pi", 0}, {"let", 0}, {"in", 0}, {"at", 0}, {"have", 0}, {"assert", 0}, {"suppose", 0}, {"show", 0}, {"suffices", 0}, {"obtain", 0},
|
||||||
{"if", 0}, {"then", 0}, {"else", 0}, {"by", 0}, {"by+", 0}, {"hiding", 0}, {"replacing", 0}, {"renaming", 0},
|
{"if", 0}, {"then", 0}, {"else", 0}, {"by", 0}, {"hiding", 0}, {"replacing", 0}, {"renaming", 0},
|
||||||
{"from", 0}, {"(", g_max_prec}, {")", 0}, {"{", g_max_prec}, {"}", 0}, {"_", g_max_prec},
|
{"from", 0}, {"(", g_max_prec}, {")", 0}, {"{", g_max_prec}, {"}", 0}, {"_", g_max_prec},
|
||||||
{"[", g_max_prec}, {"]", 0}, {"⦃", g_max_prec}, {"⦄", 0}, {".{", 0}, {"Type", g_max_prec},
|
{"[", g_max_prec}, {"]", 0}, {"⦃", g_max_prec}, {"⦄", 0}, {".{", 0}, {"Type", g_max_prec},
|
||||||
{"{|", g_max_prec}, {"|}", 0}, {"(:", g_max_prec}, {":)", 0},
|
{"{|", g_max_prec}, {"|}", 0}, {"(:", g_max_prec}, {":)", 0},
|
||||||
|
@ -99,7 +99,7 @@ void init_token_table(token_table & t) {
|
||||||
{".", 0}, {":", 0}, {"::", 0}, {"calc", 0}, {"rewrite", 0}, {"xrewrite", 0}, {"krewrite", 0},
|
{".", 0}, {":", 0}, {"::", 0}, {"calc", 0}, {"rewrite", 0}, {"xrewrite", 0}, {"krewrite", 0},
|
||||||
{"esimp", 0}, {"fold", 0}, {"unfold", 0}, {"note", 0}, {"with_options", 0}, {"with_attributes", 0}, {"with_attrs", 0},
|
{"esimp", 0}, {"fold", 0}, {"unfold", 0}, {"note", 0}, {"with_options", 0}, {"with_attributes", 0}, {"with_attrs", 0},
|
||||||
{"generalize", 0}, {"as", 0}, {":=", 0}, {"--", 0}, {"#", 0}, {"#tactic", 0},
|
{"generalize", 0}, {"as", 0}, {":=", 0}, {"--", 0}, {"#", 0}, {"#tactic", 0},
|
||||||
{"(*", 0}, {"/-", 0}, {"begin", g_max_prec}, {"begin+", g_max_prec}, {"abstract", g_max_prec},
|
{"(*", 0}, {"/-", 0}, {"begin", g_max_prec}, {"abstract", g_max_prec},
|
||||||
{"proof", g_max_prec}, {"qed", 0}, {"@@", g_max_prec}, {"@", g_max_prec},
|
{"proof", g_max_prec}, {"qed", 0}, {"@@", g_max_prec}, {"@", g_max_prec},
|
||||||
{"sorry", g_max_prec}, {"+", g_plus_prec}, {g_cup, g_cup_prec}, {"->", g_arrow_prec},
|
{"sorry", g_max_prec}, {"+", g_plus_prec}, {g_cup, g_cup_prec}, {"->", g_arrow_prec},
|
||||||
{"?(", g_max_prec}, {"⌞", g_max_prec}, {"⌟", 0}, {"match", 0},
|
{"?(", g_max_prec}, {"⌞", g_max_prec}, {"⌟", 0}, {"match", 0},
|
||||||
|
|
|
@ -24,7 +24,7 @@ syn case match
|
||||||
" keywords
|
" keywords
|
||||||
syn keyword leanKeyword import prelude tactic_hint protected private noncomputable
|
syn keyword leanKeyword import prelude tactic_hint protected private noncomputable
|
||||||
syn keyword leanKeyword definition renaming hiding exposing parameter parameters
|
syn keyword leanKeyword definition renaming hiding exposing parameter parameters
|
||||||
syn keyword leanKeyword begin "begin+" proof qed conjecture constant constants hypothesis lemma
|
syn keyword leanKeyword begin proof qed conjecture constant constants hypothesis lemma
|
||||||
syn keyword leanKeyword corollary variable variables premise premises theory print theorem proposition
|
syn keyword leanKeyword corollary variable variables premise premises theory print theorem proposition
|
||||||
syn keyword leanKeyword example abbreviation abstract open as export override axiom axioms inductive
|
syn keyword leanKeyword example abbreviation abstract open as export override axiom axioms inductive
|
||||||
syn keyword leanKeyword with structure record universe universes alias help environment options
|
syn keyword leanKeyword with structure record universe universes alias help environment options
|
||||||
|
|
Loading…
Reference in a new issue