forked from joewalnes/filtrex
-
Notifications
You must be signed in to change notification settings - Fork 17
/
generateParser.js
132 lines (123 loc) · 4.8 KB
/
generateParser.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
const Jison = require("./lib/jison").Jison;
function code(args, skipParentheses) {
var argsJs = args.map(function(a) {
return typeof(a) == 'number' ? ('$' + a) : JSON.stringify(a);
}).join(',');
return skipParentheses
? '$$ = [' + argsJs + '];'
: '$$ = ["(", ' + argsJs + ', ")"];';
}
var grammar = {
// Lexical tokens
lex: {
rules: [
['\\*', 'return "*";'],
['\\/', 'return "/";'],
['-' , 'return "-";'],
['\\+', 'return "+";'],
['\\^', 'return "^";'],
['\\%', 'return "%";'],
['\\(', 'return "(";'],
['\\)', 'return ")";'],
['\\,', 'return ",";'],
['==', 'return "==";'],
['\\!=', 'return "!=";'],
['\\~=', 'return "~=";'],
['>=', 'return ">=";'],
['<=', 'return "<=";'],
['<', 'return "<";'],
['>', 'return ">";'],
['\\?', 'return "?";'],
['\\:', 'return ":";'],
['and[^\\w]', 'return "and";'],
['or[^\\w]' , 'return "or";'],
['not[^\\w]', 'return "not";'],
['in[^\\w]', 'return "in";'],
['of[^\\w]', 'return "of";'],
['\\s+', ''], // skip whitespace
['[0-9]+(?:\\.[0-9]+)?\\b', 'return "NUMBER";'], // 212.321
['[a-zA-Z$_][\\.a-zA-Z0-9$_]*',
`yytext = JSON.stringify(yytext);
return "SYMBOL";`
], // some.Symbol22
[`'(?:\\\\'|\\\\\\\\|[^'\\\\])*'`,
`yytext = yy.buildString("'", yytext);
return "SYMBOL";`
], // 'any \'escaped\' symbol'
[`"(?:\\\\"|\\\\\\\\|[^"\\\\])*"`,
`yytext = yy.buildString('"', yytext);
return "STRING";`
], // "any \"escaped\" string"
// End
['$', 'return "EOF";'],
]
},
// Operator precedence - lowest precedence first.
// See http://www.gnu.org/software/bison/manual/html_node/Precedence.html
// for a good explanation of how it works in Bison (and hence, Jison).
// Different languages have different rules, but this seems a good starting
// point: http://en.wikipedia.org/wiki/Order_of_operations#Programming_languages
operators: [
['left', '?', ':'],
['left', 'or'],
['left', 'and'],
['left', 'in'],
['left', '==', '!=', '~='],
['left', '<', '<=', '>', '>='],
['left', '+', '-'],
['left', '*', '/', '%'],
['left', '^'],
['left', 'not'],
['left', 'UMINUS'],
['left', 'of'],
],
// Grammar
bnf: {
expressions: [ // Entry point
['e EOF', 'return $1;']
],
e: [
['e + e' , code([1, '+', 3])],
['e - e' , code([1, '-', 3])],
['e * e' , code([1, '*', 3])],
['e / e' , code([1, '/', 3])],
['e % e' , code([1, '%', 3])],
['e ^ e' , code(['Math.pow(', 1, ',', 3, ')'])],
['- e' , code(['-', 2]), {prec: 'UMINUS'}],
['e and e', code(['Number(', 1, '&&', 3, ')'])],
['e or e' , code(['Number(', 1, '||', 3, ')'])],
['not e' , code(['Number(!', 2, ')'])],
['e == e' , code(['Number(', 1, '==', 3, ')'])],
['e != e' , code(['Number(', 1, '!=', 3, ')'])],
['e ~= e' , code(['Number(RegExp(', 3, ').test(', 1, '))'])],
['e < e' , code(['Number(', 1, '<' , 3, ')'])],
['e <= e' , code(['Number(', 1, '<=', 3, ')'])],
['e > e' , code(['Number(', 1, '> ', 3, ')'])],
['e >= e' , code(['Number(', 1, '>=', 3, ')'])],
['e ? e : e', code([1, '?', 3, ':', 5])],
['( e )' , code([2])],
['( array , e )', code(['[', 2, ',', 4, ']'])],
['NUMBER' , code([1])],
['STRING' , code([1])],
['SYMBOL' , code(['prop(', 1, ', data)'])],
['SYMBOL of e', code(['prop(', 1, ',', 3, ')'])],
['SYMBOL ( )', code(['(std.isfn(fns, ', 1, ') ? fns[', 1, ']() : std.unknown(', 1, '))'])],
['SYMBOL ( argsList )', code(['(std.isfn(fns, ', 1, ') ? fns[', 1, '](', 3, ') : std.unknown(', 1, '))'])],
['e in e', code(['std.isSubset(', 1, ', ', 3, ')'])],
['e not in e', code(['+!std.isSubset(', 1, ', ', 4, ')'])],
],
argsList: [
['e', code([1], true)],
['argsList , e', code([1, ',', 3], true)],
],
inSet: [
['e', code(['o ==', 1], true)],
['inSet , e', code([1, '|| o ==', 3], true)],
],
array: [
['e', code([1])],
['array , e', code([1, ',', 3], true)],
],
}
};
exports.parser = new Jison.Parser(grammar);