-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy pathpostfix.ts
198 lines (173 loc) · 4.33 KB
/
postfix.ts
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
import { Queue } from '../utils/queue';
import { Stack } from '../utils/stack';
import { OperatorTokens } from './tokens';
export class Postfix {
/**
* Input infix string
*
* @private
* @type {string}
*/
private text: string;
/**
* Position of the current token
*
* @private
* @type {number}
*/
private pos: number = 0;
/**
* Final output queue
*
* @private
* @type {Queue<string>}
*/
private outputQueue: Queue<string>;
/**
* Data structure to store the operators
*
* @private
* @type {Stack<string>}
*/
private operatorStack: Stack<string>;
private textLength: number;
/**
* Number of operators encountered till `this.pos`
*
* @private
* @type {number}
*/
private operatorCount: number = 0;
/**
* Number of operands encountered till `this.pos`
*
* @private
* @type {number}
*/
private numberCount: number = 0;
constructor(text: string) {
this.text = text;
this.textLength = text.length;
this.outputQueue = new Queue<string>(text.length);
this.operatorStack = new Stack(text.length);
}
public parse(): Queue<string> {
while (this.pos < this.textLength) {
const token = this.getCurrentToken();
switch (token) {
case ' ':
this.consumeToken(' ');
break;
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9': {
const numStr = this.parseNumber();
this.outputQueue.enqueue(numStr);
break;
}
case '^':
case '*':
case '+':
case '-':
case '/': {
this.operatorCount++;
this.parseOperator();
break;
}
case '(': {
this.operatorStack.push('(');
this.consumeToken();
break;
}
case ')':
this.parseRightParenthesis();
break;
default:
throw new Error('Invalid token');
}
}
if (this.operatorCount >= this.numberCount) {
throw new Error(
`Invalid operator count:${this.operatorCount}, number count:${this.numberCount}`
);
}
while (this.operatorStack.size() > 0) {
const operator = this.operatorStack.pop()!;
if (operator === '(') {
throw new Error('Invalid open parenthesis');
}
this.outputQueue.enqueue(operator);
}
return this.outputQueue;
}
private parseRightParenthesis() {
this.consumeToken();
// Pop all operators from the stack until we encounter a left parenthesis.
while (this.operatorStack.peek() !== '(') {
if (this.operatorStack.size() === 0) {
throw new Error('Mismatched Parenthesis');
}
const operator = this.operatorStack.pop()!;
this.outputQueue.enqueue(operator);
}
if (this.operatorStack.peek() !== '(') {
throw new Error('No left parenthesis found');
}
this.operatorStack.pop();
}
private parseOperator() {
const o1 = this.getCurrentToken();
this.consumeToken();
const token1 = OperatorTokens.get(o1)!;
// While there is an operator token, o2, at the top of the stack
while (this.operatorStack.size() > 0) {
const o2 = this.operatorStack.peek()!;
if (o2 === '(') {
break;
}
// If o1 is left-associative and its precedence is less than or equal to that of o2,
const token2 = OperatorTokens.get(o2)!;
if (
token2.precedence > token1.precedence ||
(token1.precedence === token2.precedence && token1.isLeftAssociative)
) {
const o2 = this.operatorStack.pop()!;
this.outputQueue.enqueue(o2);
} else {
break;
}
}
this.operatorStack.push(o1);
}
private parseNumber(): string {
this.numberCount++;
let str = '';
while (this.pos < this.textLength) {
const token = this.getCurrentToken();
if (token === ' ' || token === ')') {
break;
}
str += token;
this.consumeToken();
}
return str;
}
private consumeToken(token?: string): void {
if (token) {
if (this.getCurrentToken() !== token) {
throw new Error('Invalid token');
}
}
this.pos++;
}
private getCurrentToken(): string {
return this.text[this.pos];
}
}