|
1 | | -// https://mc-stan.org/docs/2_24/reference-manual/bnf-grammars.html |
| 1 | +(function (Prism) { |
2 | 2 |
|
3 | | -Prism.languages.stan = { |
4 | | - 'comment': /\/\/.*|\/\*[\s\S]*?\*\/|#(?!include).*/, |
5 | | - 'string': { |
6 | | - // String literals can contain spaces and any printable ASCII characters except for " and \ |
7 | | - // https://mc-stan.org/docs/2_24/reference-manual/print-statements-section.html#string-literals |
8 | | - pattern: /"[\x20\x21\x23-\x5B\x5D-\x7E]*"/, |
9 | | - greedy: true |
10 | | - }, |
11 | | - 'directive': { |
12 | | - pattern: /^([ \t]*)#include\b.*/m, |
13 | | - lookbehind: true, |
14 | | - alias: 'property' |
15 | | - }, |
| 3 | + // https://mc-stan.org/docs/2_28/reference-manual/bnf-grammars.html |
16 | 4 |
|
17 | | - 'function-arg': { |
18 | | - pattern: /(\b(?:algebra_solver|integrate_1d|integrate_ode|integrate_ode_bdf|integrate_ode_rk45|map_rect)\s*\(\s*)[a-zA-Z]\w*/, |
19 | | - lookbehind: true, |
20 | | - alias: 'function' |
21 | | - }, |
22 | | - 'constraint': { |
23 | | - pattern: /(\b(?:int|matrix|real|row_vector|vector)\s*)<[^<>]*>/, |
24 | | - lookbehind: true, |
25 | | - inside: { |
26 | | - 'expression': { |
27 | | - pattern: /(=\s*)\S(?:\S|\s+(?!\s))*?(?=\s*(?:>$|,\s*\w+\s*=))/, |
28 | | - lookbehind: true, |
29 | | - inside: null // see below |
| 5 | + var higherOrderFunctions = /\b(?:algebra_solver|algebra_solver_newton|integrate_1d|integrate_ode|integrate_ode_bdf|integrate_ode_rk45|map_rect|ode_(?:adams|bdf|ckrk|rk45)(?:_tol)?|ode_adjoint_tol_ctl|reduce_sum|reduce_sum_static)\b/; |
| 6 | + |
| 7 | + Prism.languages.stan = { |
| 8 | + 'comment': /\/\/.*|\/\*[\s\S]*?\*\/|#(?!include).*/, |
| 9 | + 'string': { |
| 10 | + // String literals can contain spaces and any printable ASCII characters except for " and \ |
| 11 | + // https://mc-stan.org/docs/2_24/reference-manual/print-statements-section.html#string-literals |
| 12 | + pattern: /"[\x20\x21\x23-\x5B\x5D-\x7E]*"/, |
| 13 | + greedy: true |
| 14 | + }, |
| 15 | + 'directive': { |
| 16 | + pattern: /^([ \t]*)#include\b.*/m, |
| 17 | + lookbehind: true, |
| 18 | + alias: 'property' |
| 19 | + }, |
| 20 | + |
| 21 | + 'function-arg': { |
| 22 | + pattern: RegExp( |
| 23 | + '(' + |
| 24 | + higherOrderFunctions.source + |
| 25 | + /\s*\(\s*/.source + |
| 26 | + ')' + |
| 27 | + /[a-zA-Z]\w*/.source |
| 28 | + ), |
| 29 | + lookbehind: true, |
| 30 | + alias: 'function' |
| 31 | + }, |
| 32 | + 'constraint': { |
| 33 | + pattern: /(\b(?:int|matrix|real|row_vector|vector)\s*)<[^<>]*>/, |
| 34 | + lookbehind: true, |
| 35 | + inside: { |
| 36 | + 'expression': { |
| 37 | + pattern: /(=\s*)\S(?:\S|\s+(?!\s))*?(?=\s*(?:>$|,\s*\w+\s*=))/, |
| 38 | + lookbehind: true, |
| 39 | + inside: null // see below |
| 40 | + }, |
| 41 | + 'property': /\b[a-z]\w*(?=\s*=)/i, |
| 42 | + 'operator': /=/, |
| 43 | + 'punctuation': /^<|>$|,/ |
| 44 | + } |
| 45 | + }, |
| 46 | + 'keyword': [ |
| 47 | + { |
| 48 | + pattern: /\bdata(?=\s*\{)|\b(?:functions|generated|model|parameters|quantities|transformed)\b/, |
| 49 | + alias: 'program-block' |
30 | 50 | }, |
31 | | - 'property': /\b[a-z]\w*(?=\s*=)/i, |
32 | | - 'operator': /=/, |
33 | | - 'punctuation': /^<|>$|,/ |
34 | | - } |
35 | | - }, |
36 | | - 'keyword': [ |
37 | | - /\b(?:break|cholesky_factor_corr|cholesky_factor_cov|continue|corr_matrix|cov_matrix|data|else|for|functions|generated|if|in|increment_log_prob|int|matrix|model|ordered|parameters|positive_ordered|print|quantities|real|reject|return|row_vector|simplex|target|transformed|unit_vector|vector|void|while)\b/, |
38 | | - // these are functions that are known to take another function as their first argument. |
39 | | - /\b(?:algebra_solver|integrate_1d|integrate_ode|integrate_ode_bdf|integrate_ode_rk45|map_rect)\b/ |
40 | | - ], |
41 | | - 'function': /\b[a-z]\w*(?=\s*\()/i, |
42 | | - 'number': /(?:\b\d+(?:\.\d*)?|\B\.\d+)(?:E[+-]?\d+)?\b/i, |
43 | | - 'boolean': /\b(?:false|true)\b/, |
| 51 | + /\b(?:array|break|cholesky_factor_corr|cholesky_factor_cov|complex|continue|corr_matrix|cov_matrix|data|else|for|if|in|increment_log_prob|int|matrix|ordered|positive_ordered|print|real|reject|return|row_vector|simplex|target|unit_vector|vector|void|while)\b/, |
| 52 | + // these are functions that are known to take another function as their first argument. |
| 53 | + higherOrderFunctions |
| 54 | + ], |
| 55 | + 'function': /\b[a-z]\w*(?=\s*\()/i, |
| 56 | + 'number': /(?:\b\d+(?:_\d+)*(?:\.(?:\d+(?:_\d+)*)?)?|\B\.\d+(?:_\d+)*)(?:E[+-]?\d+(?:_\d+)*)?i?(?!\w)/i, |
| 57 | + 'boolean': /\b(?:false|true)\b/, |
| 58 | + |
| 59 | + 'operator': /<-|\.[*/]=?|\|\|?|&&|[!=<>+\-*/]=?|['^%~?:]/, |
| 60 | + 'punctuation': /[()\[\]{},;]/ |
| 61 | + }; |
44 | 62 |
|
45 | | - 'operator': /<-|\.[*/]=?|\|\|?|&&|[!=<>+\-*/]=?|['^%~?:]/, |
46 | | - 'punctuation': /[()\[\]{},;]/ |
47 | | -}; |
| 63 | + Prism.languages.stan.constraint.inside.expression.inside = Prism.languages.stan; |
48 | 64 |
|
49 | | -Prism.languages.stan.constraint.inside.expression.inside = Prism.languages.stan; |
| 65 | +}(Prism)); |
0 commit comments