-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path6.2(diff methd).cpp
More file actions
131 lines (66 loc) · 1.42 KB
/
6.2(diff methd).cpp
File metadata and controls
131 lines (66 loc) · 1.42 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
#include<iostream>
#include<string.h>
#define max 100
using namespace std;
int stack[max];
int top=-1;
void evaluatepostfix(char s[100],int n)
{
int i,temp1,temp2,temp;
for(i=0;i<n;i++)
{
if(s[i]=='+'||s[i]=='-'||s[i]=='*'||s[i]=='/')
{
if(top>=1)
{
temp1=stack[top];
top--;
temp2=stack[top];
top--;
switch(s[i])
{
case '+':
temp=temp1+temp2;
break;
case '-':
temp=temp2-temp1;
break;
case '*':
temp=temp2*temp1;
break;
case '/':
temp=temp2/temp1;
break;
}
top++;
stack[top]=temp;
}
else
{
cout<<"under flow will occur";
}
}
else
{
if(top!=max)
{
top++;
stack[top]=s[i]-48;
}
else
{
cout<<"over flow of stack!";
}
}
}
}
int main()
{
char s[100];
int n;
cout<<"enter postfix expression: ";
cin>>s;
n=strlen(s);
evaluatepostfix(s,n);
cout<<"result is: "<<stack[top];
}