-
-
Notifications
You must be signed in to change notification settings - Fork 2.8k
Expand file tree
/
Copy pathExpressionParser.cs
More file actions
298 lines (258 loc) · 12.1 KB
/
Copy pathExpressionParser.cs
File metadata and controls
298 lines (258 loc) · 12.1 KB
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
using System;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Linq;
// ReSharper disable StringLiteralTypo
namespace Avalonia.Rendering.Composition.Expressions
{
internal class ExpressionParser
{
public static Expression Parse(ReadOnlySpan<char> s)
{
var p = new TokenParser(s);
var parsed = ParseTillTerminator(ref p, "", false, false, out _);
p.SkipWhitespace();
if (p.Length != 0)
throw new ExpressionParseException("Unexpected data ", p.Position);
return parsed;
}
private static ReadOnlySpan<char> Dot => ".".AsSpan();
static bool TryParseAtomic(ref TokenParser parser,
[MaybeNullWhen(returnValue: false)] out Expression expr)
{
// We can parse keywords, parameter names and constants
expr = null;
if (parser.TryParseKeywordLowerCase(ExpressionKeywords.StartingValue))
expr = new KeywordExpression(ExpressionKeyword.StartingValue);
else if(parser.TryParseKeywordLowerCase(ExpressionKeywords.CurrentValue))
expr = new KeywordExpression(ExpressionKeyword.CurrentValue);
else if(parser.TryParseKeywordLowerCase(ExpressionKeywords.FinalValue))
expr = new KeywordExpression(ExpressionKeyword.FinalValue);
else if(parser.TryParseKeywordLowerCase(ExpressionKeywords.Pi))
expr = new KeywordExpression(ExpressionKeyword.Pi);
else if(parser.TryParseKeywordLowerCase(ExpressionKeywords.True))
expr = new KeywordExpression(ExpressionKeyword.True);
else if(parser.TryParseKeywordLowerCase(ExpressionKeywords.False))
expr = new KeywordExpression(ExpressionKeyword.False);
else if (parser.TryParseKeywordLowerCase(ExpressionKeywords.Target))
expr = new KeywordExpression(ExpressionKeyword.Target);
if (expr != null)
return true;
if (parser.TryParseIdentifier(out var identifier))
{
expr = new ParameterExpression(identifier.ToString());
return true;
}
if(parser.TryParseFloat(out var scalar))
{
expr = new ConstantExpression(scalar);
return true;
}
return false;
}
static bool TryParseOperator(ref TokenParser parser, out ExpressionType op)
{
op = (ExpressionType) (-1);
if (parser.TryConsume("||"))
op = ExpressionType.LogicalOr;
else if (parser.TryConsume("&&"))
op = ExpressionType.LogicalAnd;
else if (parser.TryConsume(">="))
op = ExpressionType.MoreThanOrEqual;
else if (parser.TryConsume("<="))
op = ExpressionType.LessThanOrEqual;
else if (parser.TryConsume("=="))
op = ExpressionType.Equals;
else if (parser.TryConsume("!="))
op = ExpressionType.NotEquals;
else if (parser.TryConsumeAny("+-/*><%".AsSpan(), out var sop))
{
#pragma warning disable CS8509
op = sop switch
#pragma warning restore CS8509
{
'+' => ExpressionType.Add,
'-' => ExpressionType.Subtract,
'/' => ExpressionType.Divide,
'*' => ExpressionType.Multiply,
'<' => ExpressionType.LessThan,
'>' => ExpressionType.MoreThan,
'%' => ExpressionType.Remainder
};
}
else
return false;
return true;
}
struct ExpressionOperatorGroup
{
private List<Expression> _expressions;
private List<ExpressionType> _operators;
private Expression? _first;
public bool NotEmpty => !Empty;
public bool Empty => _expressions == null && _first == null;
public void AppendFirst(Expression expr)
{
if (NotEmpty)
throw new InvalidOperationException();
_first = expr;
}
public void AppendWithOperator(Expression expr, ExpressionType op)
{
if (_expressions == null)
{
if (_first == null)
throw new InvalidOperationException();
_expressions = new List<Expression>();
_expressions.Add(_first);
_first = null;
_operators = new List<ExpressionType>();
}
_expressions.Add(expr);
_operators.Add(op);
}
// https://docs.microsoft.com/en-us/dotnet/csharp/language-reference/operators/
private static readonly ExpressionType[][] OperatorPrecedenceGroups = new[]
{
// multiplicative
new[] {ExpressionType.Multiply, ExpressionType.Divide, ExpressionType.Remainder},
// additive
new[] {ExpressionType.Add, ExpressionType.Subtract},
// relational
new[] {ExpressionType.MoreThan, ExpressionType.MoreThanOrEqual, ExpressionType.LessThan, ExpressionType.LessThanOrEqual},
// equality
new[] {ExpressionType.Equals, ExpressionType.NotEquals},
// conditional AND
new[] {ExpressionType.LogicalAnd},
// conditional OR
new[]{ ExpressionType.LogicalOr},
};
private static readonly ExpressionType[][] OperatorPrecedenceGroupsReversed =
OperatorPrecedenceGroups.AsEnumerable().Reverse().ToArray();
// a*b+c [a,b,c] [*,+], call with (0, 2)
// ToExpression(a*b) + ToExpression(c)
// a+b*c -> ToExpression(a) + ToExpression(b*c)
Expression ToExpression(int from, int to)
{
if (to - from == 0)
return _expressions[from];
if (to - from == 1)
return new BinaryExpression(_expressions[from], _expressions[to], _operators[from]);
foreach (var grp in OperatorPrecedenceGroupsReversed)
{
for (var c = from; c < to; c++)
{
var currentOperator = _operators[c];
foreach(var operatorFromGroup in grp)
if (currentOperator == operatorFromGroup)
{
// We are dividing the expression right here
var left = ToExpression(from, c);
var right = ToExpression(c + 1, to);
return new BinaryExpression(left, right, currentOperator);
}
}
}
// We shouldn't ever get here, if we are, there is something wrong in the code
throw new ExpressionParseException("Expression parsing algorithm bug in ToExpression", 0);
}
public Expression ToExpression()
{
if (_expressions == null)
return _first ?? throw new InvalidOperationException();
return ToExpression(0, _expressions.Count - 1);
}
}
static Expression ParseTillTerminator(ref TokenParser parser, string terminatorChars,
bool throwOnTerminator,
bool throwOnEnd,
out char? token)
{
ExpressionOperatorGroup left = default;
token = null;
while (true)
{
if (parser.TryConsumeAny(terminatorChars.AsSpan(), out var consumedToken))
{
if (throwOnTerminator || left.Empty)
throw new ExpressionParseException($"Unexpected '{token}'", parser.Position - 1);
token = consumedToken;
return left.ToExpression();
}
parser.SkipWhitespace();
if (parser.Length == 0)
{
if (throwOnEnd || left.Empty)
throw new ExpressionParseException("Unexpected end of expression", parser.Position);
return left.ToExpression();
}
ExpressionType? op = null;
if (left.NotEmpty)
{
if (parser.TryConsume('?'))
{
var truePart = ParseTillTerminator(ref parser, ":",
false, true, out _);
// pass through the current parsing rules to consume the rest
var falsePart = ParseTillTerminator(ref parser, terminatorChars, throwOnTerminator, throwOnEnd,
out token);
return new ConditionalExpression(left.ToExpression(), truePart, falsePart);
}
// We expect a binary operator here
if (!TryParseOperator(ref parser, out var sop))
throw new ExpressionParseException("Unexpected token", parser.Position);
op = sop;
}
// We expect an expression to be parsed (either due to expecting a binary operator or parsing the first part
var applyNegation = false;
while (parser.TryConsume('!'))
applyNegation = !applyNegation;
var applyUnaryMinus = false;
while (parser.TryConsume('-'))
applyUnaryMinus = !applyUnaryMinus;
Expression? parsed;
if (parser.TryConsume('('))
parsed = ParseTillTerminator(ref parser, ")", false, true, out _);
else if (parser.TryParseCall(out var functionName))
{
var parameterList = new List<Expression>();
while (true)
{
parameterList.Add(ParseTillTerminator(ref parser, ",)", false, true, out var closingToken));
if (closingToken == ')')
break;
if (closingToken != ',')
throw new ExpressionParseException("Unexpected end of the expression", parser.Position);
}
parsed = new FunctionCallExpression(functionName.ToString(), parameterList);
}
else if (TryParseAtomic(ref parser, out parsed))
{
// do nothing
}
else
throw new ExpressionParseException("Unexpected token", parser.Position);
// Parse any following member accesses
while (parser.TryConsume('.'))
{
if(!parser.TryParseIdentifier(out var memberName))
throw new ExpressionParseException("Unexpected token", parser.Position);
parsed = new MemberAccessExpression(parsed, memberName.ToString());
}
// Apply ! operator
if (applyNegation)
parsed = new UnaryExpression(parsed, ExpressionType.Not);
if (applyUnaryMinus)
{
if(parsed is ConstantExpression constexpr)
parsed = new ConstantExpression(-constexpr.Constant);
else parsed = new UnaryExpression(parsed, ExpressionType.UnaryMinus);
}
if (left.Empty)
left.AppendFirst(parsed);
else
left.AppendWithOperator(parsed, op!.Value);
}
}
}
}