forked from HarshCasper/NeoAlgo
-
Notifications
You must be signed in to change notification settings - Fork 1
/
prefixevaluator.js
155 lines (132 loc) · 2.86 KB
/
prefixevaluator.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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/*
Prefix expression:- An expression is called the prefix expression if the operator appears in the expression before the operands
Example: operator operand1 operand2
This program is for evaluating prefix expression.
In this we evaluate the given prefix expression using stack
*/
// creating stackarr
var stackarr=[];
// Initialize topp variable with -1
var topp=-1;
// creating evalstack
var evalstack=[];
// function for evaluating prefix expression
function prefixevaluator(evalst)
{
eval=evalst.split(" ");
for(var i=eval.length-1;i>=0;i--)
{
if(!operator(eval[i]))
{
push(eval[i]);
}
else
{
var op1=parseInt(pop());
var op2=parseInt(pop());
if(eval[i]=="+")
{
push(op1+op2);
}
else if(eval[i]=="-")
{
push(op1-op2);
}
else if(eval[i]=="*")
{
push(op1*op2);
}
else
{
push(op1/op2);
}
}
}
console.log(pop());
}
// function for push
function push(e)
{
topp++;
stackarr[topp]=e;
}
// function for pop out
function pop()
{
if(topp==-1)
return 0;
else
{
var popped_ele=stackarr[topp];
topp--;
return popped_ele;
}
}
// function for checking whether operator or not
function operator(op)
{
if(op=='+' || op=='-' || op=='^' || op=='*' || op=='/' || op=='(' || op==')')
{
return true;
}
else
return false;
}
// function for checking precedency
function precedency(pre)
{
if(pre=='@' || pre=='(' || pre==')')
{
return 1;
}
else if(pre=='+' || pre=='-')
{
return 2;
}
else if (pre=='/' || pre=='*')
{
return 3;
}
else if(pre=='^')
{
return 4;
}
else
return 0;
}
//In-Built readline module
const readline = require("readline");
const rl = readline.createInterface({
input: process.stdin,
output: process.stdout,
});
const getLine = (function () {
const getLineGen = (async function* () {
for await (const line of rl) {
yield line;
}
})();
return async () => (await getLineGen.next()).value;
})();
const main = async () => {
//Taking prefix expression as input
console.log("Enter the prefix expression(Please provide space after each operator or operand)");
var number1 = String(await getLine());
// Caling Function prefixevaluator
prefixevaluator(number1);
//To close the program
process.exit(0);
};
main();
/*
Input:
Enter the prefix expression(Please provide space after each operator or operand): + * 2 3 4
Output:
10
Input:
Enter the prefix expression(Please provide space after each operator or operand): + - 2 3 7
Output:
6
Time Complexity: O(n)
Space Complexity: O(n)
*/