mirror of
https://github.com/Funkoala14/knowledgebase_law.git
synced 2025-06-09 03:18:15 +08:00
61 lines
1.6 KiB
JavaScript
61 lines
1.6 KiB
JavaScript
|
'use strict'
|
||
|
|
||
|
module.exports = parigp
|
||
|
parigp.displayName = 'parigp'
|
||
|
parigp.aliases = []
|
||
|
function parigp(Prism) {
|
||
|
Prism.languages.parigp = {
|
||
|
comment: /\/\*[\s\S]*?\*\/|\\\\.*/,
|
||
|
string: {
|
||
|
pattern: /"(?:[^"\\\r\n]|\\.)*"/,
|
||
|
greedy: true
|
||
|
},
|
||
|
// PARI/GP does not care about white spaces at all
|
||
|
// so let's process the keywords to build an appropriate regexp
|
||
|
// (e.g. "b *r *e *a *k", etc.)
|
||
|
keyword: (function () {
|
||
|
var keywords = [
|
||
|
'breakpoint',
|
||
|
'break',
|
||
|
'dbg_down',
|
||
|
'dbg_err',
|
||
|
'dbg_up',
|
||
|
'dbg_x',
|
||
|
'forcomposite',
|
||
|
'fordiv',
|
||
|
'forell',
|
||
|
'forpart',
|
||
|
'forprime',
|
||
|
'forstep',
|
||
|
'forsubgroup',
|
||
|
'forvec',
|
||
|
'for',
|
||
|
'iferr',
|
||
|
'if',
|
||
|
'local',
|
||
|
'my',
|
||
|
'next',
|
||
|
'return',
|
||
|
'until',
|
||
|
'while'
|
||
|
]
|
||
|
keywords = keywords
|
||
|
.map(function (keyword) {
|
||
|
return keyword.split('').join(' *')
|
||
|
})
|
||
|
.join('|')
|
||
|
return RegExp('\\b(?:' + keywords + ')\\b')
|
||
|
})(),
|
||
|
function: /\b\w(?:[\w ]*\w)?(?= *\()/,
|
||
|
number: {
|
||
|
// The lookbehind and the negative lookahead prevent from breaking the .. operator
|
||
|
pattern:
|
||
|
/((?:\. *\. *)?)(?:\b\d(?: *\d)*(?: *(?!\. *\.)\.(?: *\d)*)?|\. *\d(?: *\d)*)(?: *e *(?:[+-] *)?\d(?: *\d)*)?/i,
|
||
|
lookbehind: true
|
||
|
},
|
||
|
operator:
|
||
|
/\. *\.|[*\/!](?: *=)?|%(?: *=|(?: *#)?(?: *')*)?|\+(?: *[+=])?|-(?: *[-=>])?|<(?: *>|(?: *<)?(?: *=)?)?|>(?: *>)?(?: *=)?|=(?: *=){0,2}|\\(?: *\/)?(?: *=)?|&(?: *&)?|\| *\||['#~^]/,
|
||
|
punctuation: /[\[\]{}().,:;|]/
|
||
|
}
|
||
|
}
|