|
1 # -*- coding: utf-8 -*- |
|
2 """ |
|
3 pygments.lexers.theorem |
|
4 ~~~~~~~~~~~~~~~~~~~~~~~ |
|
5 |
|
6 Lexers for theorem-proving languages. |
|
7 |
|
8 :copyright: Copyright 2006-2017 by the Pygments team, see AUTHORS. |
|
9 :license: BSD, see LICENSE for details. |
|
10 """ |
|
11 |
|
12 import re |
|
13 |
|
14 from pygments.lexer import RegexLexer, default, words |
|
15 from pygments.token import Text, Comment, Operator, Keyword, Name, String, \ |
|
16 Number, Punctuation, Generic |
|
17 |
|
18 __all__ = ['CoqLexer', 'IsabelleLexer', 'LeanLexer'] |
|
19 |
|
20 |
|
21 class CoqLexer(RegexLexer): |
|
22 """ |
|
23 For the `Coq <http://coq.inria.fr/>`_ theorem prover. |
|
24 |
|
25 .. versionadded:: 1.5 |
|
26 """ |
|
27 |
|
28 name = 'Coq' |
|
29 aliases = ['coq'] |
|
30 filenames = ['*.v'] |
|
31 mimetypes = ['text/x-coq'] |
|
32 |
|
33 keywords1 = ( |
|
34 # Vernacular commands |
|
35 'Section', 'Module', 'End', 'Require', 'Import', 'Export', 'Variable', |
|
36 'Variables', 'Parameter', 'Parameters', 'Axiom', 'Hypothesis', |
|
37 'Hypotheses', 'Notation', 'Local', 'Tactic', 'Reserved', 'Scope', |
|
38 'Open', 'Close', 'Bind', 'Delimit', 'Definition', 'Let', 'Ltac', |
|
39 'Fixpoint', 'CoFixpoint', 'Morphism', 'Relation', 'Implicit', |
|
40 'Arguments', 'Set', 'Unset', 'Contextual', 'Strict', 'Prenex', |
|
41 'Implicits', 'Inductive', 'CoInductive', 'Record', 'Structure', |
|
42 'Canonical', 'Coercion', 'Theorem', 'Lemma', 'Corollary', |
|
43 'Proposition', 'Fact', 'Remark', 'Example', 'Proof', 'Goal', 'Save', |
|
44 'Qed', 'Defined', 'Hint', 'Resolve', 'Rewrite', 'View', 'Search', |
|
45 'Show', 'Print', 'Printing', 'All', 'Graph', 'Projections', 'inside', |
|
46 'outside', 'Check', 'Global', 'Instance', 'Class', 'Existing', |
|
47 'Universe', 'Polymorphic', 'Monomorphic', 'Context' |
|
48 ) |
|
49 keywords2 = ( |
|
50 # Gallina |
|
51 'forall', 'exists', 'exists2', 'fun', 'fix', 'cofix', 'struct', |
|
52 'match', 'end', 'in', 'return', 'let', 'if', 'is', 'then', 'else', |
|
53 'for', 'of', 'nosimpl', 'with', 'as', |
|
54 ) |
|
55 keywords3 = ( |
|
56 # Sorts |
|
57 'Type', 'Prop', |
|
58 ) |
|
59 keywords4 = ( |
|
60 # Tactics |
|
61 'pose', 'set', 'move', 'case', 'elim', 'apply', 'clear', 'hnf', 'intro', |
|
62 'intros', 'generalize', 'rename', 'pattern', 'after', 'destruct', |
|
63 'induction', 'using', 'refine', 'inversion', 'injection', 'rewrite', |
|
64 'congr', 'unlock', 'compute', 'ring', 'field', 'replace', 'fold', |
|
65 'unfold', 'change', 'cutrewrite', 'simpl', 'have', 'suff', 'wlog', |
|
66 'suffices', 'without', 'loss', 'nat_norm', 'assert', 'cut', 'trivial', |
|
67 'revert', 'bool_congr', 'nat_congr', 'symmetry', 'transitivity', 'auto', |
|
68 'split', 'left', 'right', 'autorewrite', 'tauto', 'setoid_rewrite', |
|
69 'intuition', 'eauto', 'eapply', 'econstructor', 'etransitivity', |
|
70 'constructor', 'erewrite', 'red', 'cbv', 'lazy', 'vm_compute', |
|
71 'native_compute', 'subst', |
|
72 ) |
|
73 keywords5 = ( |
|
74 # Terminators |
|
75 'by', 'done', 'exact', 'reflexivity', 'tauto', 'romega', 'omega', |
|
76 'assumption', 'solve', 'contradiction', 'discriminate', |
|
77 'congruence', |
|
78 ) |
|
79 keywords6 = ( |
|
80 # Control |
|
81 'do', 'last', 'first', 'try', 'idtac', 'repeat', |
|
82 ) |
|
83 # 'as', 'assert', 'begin', 'class', 'constraint', 'do', 'done', |
|
84 # 'downto', 'else', 'end', 'exception', 'external', 'false', |
|
85 # 'for', 'fun', 'function', 'functor', 'if', 'in', 'include', |
|
86 # 'inherit', 'initializer', 'lazy', 'let', 'match', 'method', |
|
87 # 'module', 'mutable', 'new', 'object', 'of', 'open', 'private', |
|
88 # 'raise', 'rec', 'sig', 'struct', 'then', 'to', 'true', 'try', |
|
89 # 'type', 'val', 'virtual', 'when', 'while', 'with' |
|
90 keyopts = ( |
|
91 '!=', '#', '&', '&&', r'\(', r'\)', r'\*', r'\+', ',', '-', r'-\.', |
|
92 '->', r'\.', r'\.\.', ':', '::', ':=', ':>', ';', ';;', '<', '<-', |
|
93 '<->', '=', '>', '>]', r'>\}', r'\?', r'\?\?', r'\[', r'\[<', r'\[>', |
|
94 r'\[\|', ']', '_', '`', r'\{', r'\{<', r'\|', r'\|]', r'\}', '~', '=>', |
|
95 r'/\\', r'\\/', r'\{\|', r'\|\}', |
|
96 u'Π', u'λ', |
|
97 ) |
|
98 operators = r'[!$%&*+\./:<=>?@^|~-]' |
|
99 prefix_syms = r'[!?~]' |
|
100 infix_syms = r'[=<>@^|&+\*/$%-]' |
|
101 primitives = ('unit', 'nat', 'bool', 'string', 'ascii', 'list') |
|
102 |
|
103 tokens = { |
|
104 'root': [ |
|
105 (r'\s+', Text), |
|
106 (r'false|true|\(\)|\[\]', Name.Builtin.Pseudo), |
|
107 (r'\(\*', Comment, 'comment'), |
|
108 (words(keywords1, prefix=r'\b', suffix=r'\b'), Keyword.Namespace), |
|
109 (words(keywords2, prefix=r'\b', suffix=r'\b'), Keyword), |
|
110 (words(keywords3, prefix=r'\b', suffix=r'\b'), Keyword.Type), |
|
111 (words(keywords4, prefix=r'\b', suffix=r'\b'), Keyword), |
|
112 (words(keywords5, prefix=r'\b', suffix=r'\b'), Keyword.Pseudo), |
|
113 (words(keywords6, prefix=r'\b', suffix=r'\b'), Keyword.Reserved), |
|
114 # (r'\b([A-Z][\w\']*)(\.)', Name.Namespace, 'dotted'), |
|
115 (r'\b([A-Z][\w\']*)', Name), |
|
116 (r'(%s)' % '|'.join(keyopts[::-1]), Operator), |
|
117 (r'(%s|%s)?%s' % (infix_syms, prefix_syms, operators), Operator), |
|
118 (r'\b(%s)\b' % '|'.join(primitives), Keyword.Type), |
|
119 |
|
120 (r"[^\W\d][\w']*", Name), |
|
121 |
|
122 (r'\d[\d_]*', Number.Integer), |
|
123 (r'0[xX][\da-fA-F][\da-fA-F_]*', Number.Hex), |
|
124 (r'0[oO][0-7][0-7_]*', Number.Oct), |
|
125 (r'0[bB][01][01_]*', Number.Bin), |
|
126 (r'-?\d[\d_]*(.[\d_]*)?([eE][+\-]?\d[\d_]*)', Number.Float), |
|
127 |
|
128 (r"'(?:(\\[\\\"'ntbr ])|(\\[0-9]{3})|(\\x[0-9a-fA-F]{2}))'", |
|
129 String.Char), |
|
130 (r"'.'", String.Char), |
|
131 (r"'", Keyword), # a stray quote is another syntax element |
|
132 |
|
133 (r'"', String.Double, 'string'), |
|
134 |
|
135 (r'[~?][a-z][\w\']*:', Name), |
|
136 ], |
|
137 'comment': [ |
|
138 (r'[^(*)]+', Comment), |
|
139 (r'\(\*', Comment, '#push'), |
|
140 (r'\*\)', Comment, '#pop'), |
|
141 (r'[(*)]', Comment), |
|
142 ], |
|
143 'string': [ |
|
144 (r'[^"]+', String.Double), |
|
145 (r'""', String.Double), |
|
146 (r'"', String.Double, '#pop'), |
|
147 ], |
|
148 'dotted': [ |
|
149 (r'\s+', Text), |
|
150 (r'\.', Punctuation), |
|
151 (r'[A-Z][\w\']*(?=\s*\.)', Name.Namespace), |
|
152 (r'[A-Z][\w\']*', Name.Class, '#pop'), |
|
153 (r'[a-z][a-z0-9_\']*', Name, '#pop'), |
|
154 default('#pop') |
|
155 ], |
|
156 } |
|
157 |
|
158 def analyse_text(text): |
|
159 if text.startswith('(*'): |
|
160 return True |
|
161 |
|
162 |
|
163 class IsabelleLexer(RegexLexer): |
|
164 """ |
|
165 For the `Isabelle <http://isabelle.in.tum.de/>`_ proof assistant. |
|
166 |
|
167 .. versionadded:: 2.0 |
|
168 """ |
|
169 |
|
170 name = 'Isabelle' |
|
171 aliases = ['isabelle'] |
|
172 filenames = ['*.thy'] |
|
173 mimetypes = ['text/x-isabelle'] |
|
174 |
|
175 keyword_minor = ( |
|
176 'and', 'assumes', 'attach', 'avoids', 'binder', 'checking', |
|
177 'class_instance', 'class_relation', 'code_module', 'congs', |
|
178 'constant', 'constrains', 'datatypes', 'defines', 'file', 'fixes', |
|
179 'for', 'functions', 'hints', 'identifier', 'if', 'imports', 'in', |
|
180 'includes', 'infix', 'infixl', 'infixr', 'is', 'keywords', 'lazy', |
|
181 'module_name', 'monos', 'morphisms', 'no_discs_sels', 'notes', |
|
182 'obtains', 'open', 'output', 'overloaded', 'parametric', 'permissive', |
|
183 'pervasive', 'rep_compat', 'shows', 'structure', 'type_class', |
|
184 'type_constructor', 'unchecked', 'unsafe', 'where', |
|
185 ) |
|
186 |
|
187 keyword_diag = ( |
|
188 'ML_command', 'ML_val', 'class_deps', 'code_deps', 'code_thms', |
|
189 'display_drafts', 'find_consts', 'find_theorems', 'find_unused_assms', |
|
190 'full_prf', 'help', 'locale_deps', 'nitpick', 'pr', 'prf', |
|
191 'print_abbrevs', 'print_antiquotations', 'print_attributes', |
|
192 'print_binds', 'print_bnfs', 'print_bundles', |
|
193 'print_case_translations', 'print_cases', 'print_claset', |
|
194 'print_classes', 'print_codeproc', 'print_codesetup', |
|
195 'print_coercions', 'print_commands', 'print_context', |
|
196 'print_defn_rules', 'print_dependencies', 'print_facts', |
|
197 'print_induct_rules', 'print_inductives', 'print_interps', |
|
198 'print_locale', 'print_locales', 'print_methods', 'print_options', |
|
199 'print_orders', 'print_quot_maps', 'print_quotconsts', |
|
200 'print_quotients', 'print_quotientsQ3', 'print_quotmapsQ3', |
|
201 'print_rules', 'print_simpset', 'print_state', 'print_statement', |
|
202 'print_syntax', 'print_theorems', 'print_theory', 'print_trans_rules', |
|
203 'prop', 'pwd', 'quickcheck', 'refute', 'sledgehammer', 'smt_status', |
|
204 'solve_direct', 'spark_status', 'term', 'thm', 'thm_deps', 'thy_deps', |
|
205 'try', 'try0', 'typ', 'unused_thms', 'value', 'values', 'welcome', |
|
206 'print_ML_antiquotations', 'print_term_bindings', 'values_prolog', |
|
207 ) |
|
208 |
|
209 keyword_thy = ('theory', 'begin', 'end') |
|
210 |
|
211 keyword_section = ('header', 'chapter') |
|
212 |
|
213 keyword_subsection = ( |
|
214 'section', 'subsection', 'subsubsection', 'sect', 'subsect', |
|
215 'subsubsect', |
|
216 ) |
|
217 |
|
218 keyword_theory_decl = ( |
|
219 'ML', 'ML_file', 'abbreviation', 'adhoc_overloading', 'arities', |
|
220 'atom_decl', 'attribute_setup', 'axiomatization', 'bundle', |
|
221 'case_of_simps', 'class', 'classes', 'classrel', 'codatatype', |
|
222 'code_abort', 'code_class', 'code_const', 'code_datatype', |
|
223 'code_identifier', 'code_include', 'code_instance', 'code_modulename', |
|
224 'code_monad', 'code_printing', 'code_reflect', 'code_reserved', |
|
225 'code_type', 'coinductive', 'coinductive_set', 'consts', 'context', |
|
226 'datatype', 'datatype_new', 'datatype_new_compat', 'declaration', |
|
227 'declare', 'default_sort', 'defer_recdef', 'definition', 'defs', |
|
228 'domain', 'domain_isomorphism', 'domaindef', 'equivariance', |
|
229 'export_code', 'extract', 'extract_type', 'fixrec', 'fun', |
|
230 'fun_cases', 'hide_class', 'hide_const', 'hide_fact', 'hide_type', |
|
231 'import_const_map', 'import_file', 'import_tptp', 'import_type_map', |
|
232 'inductive', 'inductive_set', 'instantiation', 'judgment', 'lemmas', |
|
233 'lifting_forget', 'lifting_update', 'local_setup', 'locale', |
|
234 'method_setup', 'nitpick_params', 'no_adhoc_overloading', |
|
235 'no_notation', 'no_syntax', 'no_translations', 'no_type_notation', |
|
236 'nominal_datatype', 'nonterminal', 'notation', 'notepad', 'oracle', |
|
237 'overloading', 'parse_ast_translation', 'parse_translation', |
|
238 'partial_function', 'primcorec', 'primrec', 'primrec_new', |
|
239 'print_ast_translation', 'print_translation', 'quickcheck_generator', |
|
240 'quickcheck_params', 'realizability', 'realizers', 'recdef', 'record', |
|
241 'refute_params', 'setup', 'setup_lifting', 'simproc_setup', |
|
242 'simps_of_case', 'sledgehammer_params', 'spark_end', 'spark_open', |
|
243 'spark_open_siv', 'spark_open_vcg', 'spark_proof_functions', |
|
244 'spark_types', 'statespace', 'syntax', 'syntax_declaration', 'text', |
|
245 'text_raw', 'theorems', 'translations', 'type_notation', |
|
246 'type_synonym', 'typed_print_translation', 'typedecl', 'hoarestate', |
|
247 'install_C_file', 'install_C_types', 'wpc_setup', 'c_defs', 'c_types', |
|
248 'memsafe', 'SML_export', 'SML_file', 'SML_import', 'approximate', |
|
249 'bnf_axiomatization', 'cartouche', 'datatype_compat', |
|
250 'free_constructors', 'functor', 'nominal_function', |
|
251 'nominal_termination', 'permanent_interpretation', |
|
252 'binds', 'defining', 'smt2_status', 'term_cartouche', |
|
253 'boogie_file', 'text_cartouche', |
|
254 ) |
|
255 |
|
256 keyword_theory_script = ('inductive_cases', 'inductive_simps') |
|
257 |
|
258 keyword_theory_goal = ( |
|
259 'ax_specification', 'bnf', 'code_pred', 'corollary', 'cpodef', |
|
260 'crunch', 'crunch_ignore', |
|
261 'enriched_type', 'function', 'instance', 'interpretation', 'lemma', |
|
262 'lift_definition', 'nominal_inductive', 'nominal_inductive2', |
|
263 'nominal_primrec', 'pcpodef', 'primcorecursive', |
|
264 'quotient_definition', 'quotient_type', 'recdef_tc', 'rep_datatype', |
|
265 'schematic_corollary', 'schematic_lemma', 'schematic_theorem', |
|
266 'spark_vc', 'specification', 'subclass', 'sublocale', 'termination', |
|
267 'theorem', 'typedef', 'wrap_free_constructors', |
|
268 ) |
|
269 |
|
270 keyword_qed = ('by', 'done', 'qed') |
|
271 keyword_abandon_proof = ('sorry', 'oops') |
|
272 |
|
273 keyword_proof_goal = ('have', 'hence', 'interpret') |
|
274 |
|
275 keyword_proof_block = ('next', 'proof') |
|
276 |
|
277 keyword_proof_chain = ( |
|
278 'finally', 'from', 'then', 'ultimately', 'with', |
|
279 ) |
|
280 |
|
281 keyword_proof_decl = ( |
|
282 'ML_prf', 'also', 'include', 'including', 'let', 'moreover', 'note', |
|
283 'txt', 'txt_raw', 'unfolding', 'using', 'write', |
|
284 ) |
|
285 |
|
286 keyword_proof_asm = ('assume', 'case', 'def', 'fix', 'presume') |
|
287 |
|
288 keyword_proof_asm_goal = ('guess', 'obtain', 'show', 'thus') |
|
289 |
|
290 keyword_proof_script = ( |
|
291 'apply', 'apply_end', 'apply_trace', 'back', 'defer', 'prefer', |
|
292 ) |
|
293 |
|
294 operators = ( |
|
295 '::', ':', '(', ')', '[', ']', '_', '=', ',', '|', |
|
296 '+', '-', '!', '?', |
|
297 ) |
|
298 |
|
299 proof_operators = ('{', '}', '.', '..') |
|
300 |
|
301 tokens = { |
|
302 'root': [ |
|
303 (r'\s+', Text), |
|
304 (r'\(\*', Comment, 'comment'), |
|
305 (r'\{\*', Comment, 'text'), |
|
306 |
|
307 (words(operators), Operator), |
|
308 (words(proof_operators), Operator.Word), |
|
309 |
|
310 (words(keyword_minor, prefix=r'\b', suffix=r'\b'), Keyword.Pseudo), |
|
311 |
|
312 (words(keyword_diag, prefix=r'\b', suffix=r'\b'), Keyword.Type), |
|
313 |
|
314 (words(keyword_thy, prefix=r'\b', suffix=r'\b'), Keyword), |
|
315 (words(keyword_theory_decl, prefix=r'\b', suffix=r'\b'), Keyword), |
|
316 |
|
317 (words(keyword_section, prefix=r'\b', suffix=r'\b'), Generic.Heading), |
|
318 (words(keyword_subsection, prefix=r'\b', suffix=r'\b'), Generic.Subheading), |
|
319 |
|
320 (words(keyword_theory_goal, prefix=r'\b', suffix=r'\b'), Keyword.Namespace), |
|
321 (words(keyword_theory_script, prefix=r'\b', suffix=r'\b'), Keyword.Namespace), |
|
322 |
|
323 (words(keyword_abandon_proof, prefix=r'\b', suffix=r'\b'), Generic.Error), |
|
324 |
|
325 (words(keyword_qed, prefix=r'\b', suffix=r'\b'), Keyword), |
|
326 (words(keyword_proof_goal, prefix=r'\b', suffix=r'\b'), Keyword), |
|
327 (words(keyword_proof_block, prefix=r'\b', suffix=r'\b'), Keyword), |
|
328 (words(keyword_proof_decl, prefix=r'\b', suffix=r'\b'), Keyword), |
|
329 |
|
330 (words(keyword_proof_chain, prefix=r'\b', suffix=r'\b'), Keyword), |
|
331 (words(keyword_proof_asm, prefix=r'\b', suffix=r'\b'), Keyword), |
|
332 (words(keyword_proof_asm_goal, prefix=r'\b', suffix=r'\b'), Keyword), |
|
333 |
|
334 (words(keyword_proof_script, prefix=r'\b', suffix=r'\b'), Keyword.Pseudo), |
|
335 |
|
336 (r'\\<\w*>', Text.Symbol), |
|
337 |
|
338 (r"[^\W\d][.\w']*", Name), |
|
339 (r"\?[^\W\d][.\w']*", Name), |
|
340 (r"'[^\W\d][.\w']*", Name.Type), |
|
341 |
|
342 (r'\d[\d_]*', Name), # display numbers as name |
|
343 (r'0[xX][\da-fA-F][\da-fA-F_]*', Number.Hex), |
|
344 (r'0[oO][0-7][0-7_]*', Number.Oct), |
|
345 (r'0[bB][01][01_]*', Number.Bin), |
|
346 |
|
347 (r'"', String, 'string'), |
|
348 (r'`', String.Other, 'fact'), |
|
349 ], |
|
350 'comment': [ |
|
351 (r'[^(*)]+', Comment), |
|
352 (r'\(\*', Comment, '#push'), |
|
353 (r'\*\)', Comment, '#pop'), |
|
354 (r'[(*)]', Comment), |
|
355 ], |
|
356 'text': [ |
|
357 (r'[^*}]+', Comment), |
|
358 (r'\*\}', Comment, '#pop'), |
|
359 (r'\*', Comment), |
|
360 (r'\}', Comment), |
|
361 ], |
|
362 'string': [ |
|
363 (r'[^"\\]+', String), |
|
364 (r'\\<\w*>', String.Symbol), |
|
365 (r'\\"', String), |
|
366 (r'\\', String), |
|
367 (r'"', String, '#pop'), |
|
368 ], |
|
369 'fact': [ |
|
370 (r'[^`\\]+', String.Other), |
|
371 (r'\\<\w*>', String.Symbol), |
|
372 (r'\\`', String.Other), |
|
373 (r'\\', String.Other), |
|
374 (r'`', String.Other, '#pop'), |
|
375 ], |
|
376 } |
|
377 |
|
378 |
|
379 class LeanLexer(RegexLexer): |
|
380 """ |
|
381 For the `Lean <https://github.com/leanprover/lean>`_ |
|
382 theorem prover. |
|
383 |
|
384 .. versionadded:: 2.0 |
|
385 """ |
|
386 name = 'Lean' |
|
387 aliases = ['lean'] |
|
388 filenames = ['*.lean'] |
|
389 mimetypes = ['text/x-lean'] |
|
390 |
|
391 flags = re.MULTILINE | re.UNICODE |
|
392 |
|
393 keywords1 = ( |
|
394 'import', 'abbreviation', 'opaque_hint', 'tactic_hint', 'definition', |
|
395 'renaming', 'inline', 'hiding', 'exposing', 'parameter', 'parameters', |
|
396 'conjecture', 'hypothesis', 'lemma', 'corollary', 'variable', 'variables', |
|
397 'theorem', 'axiom', 'inductive', 'structure', 'universe', 'alias', |
|
398 'help', 'options', 'precedence', 'postfix', 'prefix', 'calc_trans', |
|
399 'calc_subst', 'calc_refl', 'infix', 'infixl', 'infixr', 'notation', 'eval', |
|
400 'check', 'exit', 'coercion', 'end', 'private', 'using', 'namespace', |
|
401 'including', 'instance', 'section', 'context', 'protected', 'expose', |
|
402 'export', 'set_option', 'add_rewrite', 'extends', 'open', 'example', |
|
403 'constant', 'constants', 'print', 'opaque', 'reducible', 'irreducible', |
|
404 ) |
|
405 |
|
406 keywords2 = ( |
|
407 'forall', 'fun', 'Pi', 'obtain', 'from', 'have', 'show', 'assume', |
|
408 'take', 'let', 'if', 'else', 'then', 'by', 'in', 'with', 'begin', |
|
409 'proof', 'qed', 'calc', 'match', |
|
410 ) |
|
411 |
|
412 keywords3 = ( |
|
413 # Sorts |
|
414 'Type', 'Prop', |
|
415 ) |
|
416 |
|
417 operators = ( |
|
418 u'!=', u'#', u'&', u'&&', u'*', u'+', u'-', u'/', u'@', u'!', u'`', |
|
419 u'-.', u'->', u'.', u'..', u'...', u'::', u':>', u';', u';;', u'<', |
|
420 u'<-', u'=', u'==', u'>', u'_', u'|', u'||', u'~', u'=>', u'<=', u'>=', |
|
421 u'/\\', u'\\/', u'∀', u'Π', u'λ', u'↔', u'∧', u'∨', u'≠', u'≤', u'≥', |
|
422 u'¬', u'⁻¹', u'⬝', u'▸', u'→', u'∃', u'ℕ', u'ℤ', u'≈', u'×', u'⌞', |
|
423 u'⌟', u'≡', u'⟨', u'⟩', |
|
424 ) |
|
425 |
|
426 punctuation = (u'(', u')', u':', u'{', u'}', u'[', u']', u'⦃', u'⦄', |
|
427 u':=', u',') |
|
428 |
|
429 tokens = { |
|
430 'root': [ |
|
431 (r'\s+', Text), |
|
432 (r'/-', Comment, 'comment'), |
|
433 (r'--.*?$', Comment.Single), |
|
434 (words(keywords1, prefix=r'\b', suffix=r'\b'), Keyword.Namespace), |
|
435 (words(keywords2, prefix=r'\b', suffix=r'\b'), Keyword), |
|
436 (words(keywords3, prefix=r'\b', suffix=r'\b'), Keyword.Type), |
|
437 (words(operators), Name.Builtin.Pseudo), |
|
438 (words(punctuation), Operator), |
|
439 (u"[A-Za-z_\u03b1-\u03ba\u03bc-\u03fb\u1f00-\u1ffe\u2100-\u214f]" |
|
440 u"[A-Za-z_'\u03b1-\u03ba\u03bc-\u03fb\u1f00-\u1ffe\u2070-\u2079" |
|
441 u"\u207f-\u2089\u2090-\u209c\u2100-\u214f0-9]*", Name), |
|
442 (r'\d+', Number.Integer), |
|
443 (r'"', String.Double, 'string'), |
|
444 (r'[~?][a-z][\w\']*:', Name.Variable) |
|
445 ], |
|
446 'comment': [ |
|
447 # Multiline Comments |
|
448 (r'[^/-]', Comment.Multiline), |
|
449 (r'/-', Comment.Multiline, '#push'), |
|
450 (r'-/', Comment.Multiline, '#pop'), |
|
451 (r'[/-]', Comment.Multiline) |
|
452 ], |
|
453 'string': [ |
|
454 (r'[^\\"]+', String.Double), |
|
455 (r'\\[n"\\]', String.Escape), |
|
456 ('"', String.Double, '#pop'), |
|
457 ], |
|
458 } |