-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathEquation.cs
141 lines (140 loc) · 4.54 KB
/
Equation.cs
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using TinyLanguageCompilerProject;
namespace TinyLanguageComilerProject
{
partial class Parser
{
private Node? Equation()
{
if (StreamIndex >= TokenStream.Count)
{
return null;
}
Node equation = new Node("Equation");
// Parentheses
if (TokenStream[StreamIndex].TokenType == TokenClass.LeftParentheses)
{
equation.Children.Add(match(TokenClass.LeftParentheses, equation));
Node? subEquation = Equation();
if (subEquation == null)
{
return null;
}
equation.Children.AddRange(subEquation.Children);
equation.Children.Add(match(TokenClass.RightParentheses, equation));
if (!Term_after_operator(equation))
{
return null;
}
}
else
{
if (!Terms_before_operator_or_ends_term(equation))
{
return null;
}
}
return equation;
}
private bool Terms_before_operator_or_ends_term(Node equation)
{
while (true)
{
Node? term = Term();
if (term == null)
{
return false;
}
equation.Children.Add(term);
if (StreamIndex >= TokenStream.Count)
{
return false;
}
TokenClass? matchedToken = MatchOperatorIfPossible(equation);
if (matchedToken == null)
{
break;
}
if (StreamIndex >= TokenStream.Count)
{
return false;
}
if (TokenStream[StreamIndex].TokenType == TokenClass.LeftParentheses)
{
Node? subEquation = Equation();
if (subEquation == null)
{
return false;
}
equation.Children.AddRange(subEquation.Children);
break;
}
}
return true;
}
bool Term_after_operator(Node equation)
{
while (true)
{
if (StreamIndex >= TokenStream.Count)
{
return false;
}
TokenClass? matchedToken = MatchOperatorIfPossible(equation);
if (matchedToken == null)
{
break;
}
if (StreamIndex >= TokenStream.Count)
{
return false;
}
if (TokenStream[StreamIndex].TokenType == TokenClass.LeftParentheses)
{
Node? subEquation = Equation();
if (subEquation == null)
{
return false;
}
equation.Children.AddRange(subEquation.Children);
break;
}
Node? term = Term();
if (term == null)
{
return false;
}
equation.Children.Add(term);
}
return true;
}
TokenClass? MatchOperatorIfPossible(Node equation)
{
if (TokenStream[StreamIndex].TokenType == TokenClass.PlusOp)
{
equation.Children.Add(match(TokenClass.PlusOp, equation));
return TokenClass.PlusOp;
}
if (TokenStream[StreamIndex].TokenType == TokenClass.MinusOp)
{
equation.Children.Add(match(TokenClass.MinusOp, equation));
return TokenClass.MinusOp;
}
if (TokenStream[StreamIndex].TokenType == TokenClass.MultiplyOp)
{
equation.Children.Add(match(TokenClass.MultiplyOp, equation));
return TokenClass.MultiplyOp;
}
if (TokenStream[StreamIndex].TokenType == TokenClass.DivideOp)
{
equation.Children.Add(match(TokenClass.DivideOp, equation));
return TokenClass.DivideOp;
}
return null;
}
}
}