码迷，mamicode.com
首页 > 其他好文 > 详细

表达式求值

时间：2014-05-18 19:54:02      阅读：514      评论：0      收藏：0      [点我收藏+]

标签：blog   class   code   c   color   int   

?
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
#ifndef MAINFUNC_H
#define MAINFUNC_H
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
//1. Get the numbers
//2. Modify the expression like (1+1*1)*(1-1); 1 represent one number.
//3. the main algorithm
using namespace std;
class EvaluateExpression
{
public:
    explicit EvaluateExpression();
    explicit EvaluateExpression(char *p);
    ~EvaluateExpression();
    double getResult(bool &terror);
    bool judge();
private:
    void getNumbers();//得到表达式中的值
    void modifyExpression();
    double getOneNum(vector<char> &tmpNumChars);
    bool isOperator(char ch);
    void mainAlg();
    int precede(char op1, char op2);
    double calc(double d1, char oper, double d2);
private:
    char *m_expression;
    queue<double> m_src_numbers;//numbers in the expression in (10+8) the numbers is 10 and 8
    stack<char> m_operation;//save the operators;
    stack<double> m_oprand;
    int **m_precede_table;
    bool m_error;
};
#endif // MAINFUNC_H

　　

 

?
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
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
#include "mainFunc.h"
#include <iostream>
 
#include <cstring>
#include <stdio.h>
#include <ctype.h>
EvaluateExpression::EvaluateExpression()
{
    m_error = false;
    m_expression = NULL;
    //+ - * / ( ) #
    //(>==1)(<==-1)(== == 0) (error == -2)
    int table[7][7]=
    {
        {
             1, 1,-1,-1,-1, 1, 1
        },
        {
             1, 1,-1,-1,-1, 1, 1
        },
        {
             1, 1, 1, 1,-1, 1, 1
        },
        {
             1, 1, 1, 1,-1, 1, 1
        },
        {
            -1,-1,-1,-1,-1, 0,-2
        },
        {
             1, 1, 1, 1,-2, 1, 1
        },
        {
            -1,-1,-1,-1,-1,-2, 0
        }
    };
    m_precede_table = new int*[7];
 
    for( int i=0;i<7; ++i)
    {
            m_precede_table[i] = new int[7];
            memcpy(m_precede_table[i],table[i],7*sizeof(int));
    }
 
     
}
 
EvaluateExpression::EvaluateExpression(char *p)
{
    m_error = false;
    size_t len = strlen(p);
 //   printf("%d\n",len);
    m_expression = new char[len+1];
    strncpy(m_expression,p,len);
    m_expression[len] = ‘\0‘;
 //   printf("%s\n",m_expression);
 
     int table[7][7]=
    {
        {
             1, 1,-1,-1,-1, 1, 1
        },
        {
             1, 1,-1,-1,-1, 1, 1
        },
        {
             1, 1, 1, 1,-1, 1, 1
        },
        {
             1, 1, 1, 1,-1, 1, 1
        },
        {
            -1,-1,-1,-1,-1, 0,-2
        },
        {
             1, 1, 1, 1,-2, 1, 1
        },
        {
            -1,-1,-1,-1,-1,-2, 0
        }
    };
    m_precede_table = new int*[7];
 
    for( int i=0;i<7; ++i)
    {
            m_precede_table[i] = new int[7];
            memcpy(m_precede_table[i],table[i],sizeof(table[i]));
    }
    cout<<"m_precede_table:"<<m_precede_table[4][5]<<endl;
}
 
 
EvaluateExpression::~EvaluateExpression()
{
    if( NULL!=m_expression )
        delete[] m_expression;
    for( int i=0;i<7;++i)
        delete[] m_precede_table[i];
    delete[] m_precede_table;
}
 
double EvaluateExpression::getResult(bool &terror)
{
    this->getNumbers();
    this->modifyExpression();//every operand use char ‘1‘ to replace;
    this->mainAlg();
 
    terror = m_error;
    return m_oprand.top();
 
}
 
void EvaluateExpression::getNumbers()
{
    if( NULL==m_expression )
        return ;
 
    while( !m_src_numbers.empty() )
        m_src_numbers.pop();
    int i=0;
 
    vector<char> tmpNums;
    tmpNums.clear();
    while( 0!=m_expression[i] )
    {
        char ch = m_expression[i];
        if( !isdigit(ch) && ‘.‘!=ch )
        {
            if( !tmpNums.empty() )
            {
                m_src_numbers.push(this->getOneNum(tmpNums));
                tmpNums.clear();
            }
        }
 
        if( isdigit(ch) || ‘.‘==ch )
        {
            tmpNums.push_back(ch);
        }
        ++i;
    }
    if( !tmpNums.empty())
        m_src_numbers.push(this->getOneNum(tmpNums));
 
 
#if 0
    while( !m_src_numbers.empty() )
    {
        cout<<m_src_numbers.front()<<endl;
        m_src_numbers.pop();
    }
#endif
}
 
double EvaluateExpression::getOneNum(vector<char> &tmpNumChars)
{
    int len = tmpNumChars.size();
    double res = 0;
    double aftDotVal = 0;
 
    bool afterDot = false;
    double pos_ratio=0;
    for( int i=0; i<len; ++i)
    {
        if( isdigit(tmpNumChars[i]) && false==afterDot )
        {
            res = res*10 + (int)(tmpNumChars[i]-‘0‘);
        }
        if( ‘.‘==tmpNumChars[i] )
        {
            afterDot = true;
            pos_ratio = 1e-1;
 
        }
 
        if( isdigit(tmpNumChars[i]) && true==afterDot )
        {
            aftDotVal += pos_ratio*(int)(tmpNumChars[i]-‘0‘);
            pos_ratio = pos_ratio/10;
        }
    }
 
    return res + aftDotVal;
}
 
 
void EvaluateExpression::modifyExpression()
{
    size_t pos_before=0;
    size_t pos_after=0;
 
 //   printf("%s\n",m_expression);
    for( pos_before=0; ‘\0‘!=m_expression[pos_before]; )
    {
        if( isdigit(m_expression[pos_before]) || ‘.‘==m_expression[pos_before] )
        {
            m_expression[pos_after++] = ‘N‘;
            pos_before++;
            while( isdigit(m_expression[pos_before]) || ‘.‘==m_expression[pos_before] )
                pos_before++;
        }
        else
            m_expression[pos_after++] = m_expression[pos_before++];
  //      printf("%c\n",m_expression[pos_before]);
 
    }
 //   m_expression[pos_after] = ‘\0‘;
 
    char *res = new char[pos_after+2];//the ‘#‘ and ‘\0‘;
    strncpy(res,m_expression,pos_after);
    res[pos_after]=‘#‘;
    res[pos_after+1]=‘\0‘;
    delete m_expression;
    m_expression = res;
    printf("%s\n",m_expression);
 
}
 
void EvaluateExpression::mainAlg()
{
   while( !m_operation.empty() )
        m_operation.pop();
   while( !m_oprand.empty() )
        m_oprand.pop();
    cout<<"size:"<<m_oprand.size()<<endl;
 
   m_operation.push(‘#‘);
   cout<<"numbers"<<m_src_numbers.size()<<endl;
 
   size_t i_exp=0;
         cout<<m_expression<<endl;
   char ch = m_expression[i_exp];
 
   while( ‘#‘!=ch || ‘#‘!=m_operation.top() )
   {
        if( true==m_error)
            break;
    //   cout<<"in while"<<endl;
        if( !isOperator(ch))
        {
            cout<<"size:"<<m_src_numbers.size()<<endl;
            cout<<m_src_numbers.front()<<endl;
            m_oprand.push(m_src_numbers.front());
            cout<<"size:"<<m_src_numbers.size()<<endl;
            cout<<"num:"<<m_src_numbers.front()<<endl;
            m_src_numbers.pop();
            ++i_exp;
            ch = m_expression[i_exp];
            cout<<"test"<<endl;
        //    while(1)
         //       ;
        }
        else
        {
            cout<<"m_operation.top():"<<m_operation.top()<<"ch:"<<ch<<endl;
            switch ( precede(m_operation.top(),ch))
            {
            case -1://栈顶元素优先权低
                m_operation.push(ch);
                ++i_exp;
                ch = m_expression[i_exp];
                break;
            case 0:
                 
                m_operation.pop();
                ++i_exp;
                ch = m_expression[i_exp];
                 
                break;
            case 1:
            {
                char choper;
                choper = m_operation.top();
                m_operation.pop();
                double num1,num2;
                num1 = m_oprand.top();
                m_oprand.pop();
                num2 = m_oprand.top();
                m_oprand.pop();
                cout<<"num1::"<<num1<<"num2:"<<num2<<endl;
                cout<<"i_exp"<<i_exp<<endl;
                cout<<"m_opration:"<<m_operation.top()<<endl;
                cout<<"ch:"<<ch;
                
                double res=0;
                res = this->calc(num2, choper, num1);
                cout<<"res:"<<res<<endl;
                m_oprand.push(res);
                 
                break;
            }
            default:
                cout<<"erro"<<endl;
                m_error = true;
                break;
            }
        }
   }
 
   // return m_oprand.top();
}
 
bool EvaluateExpression::isOperator(char ch)
{
    if( ‘+‘==ch || ‘-‘==ch || ‘*‘==ch || ‘/‘==ch ||
        ‘(‘==ch || ‘)‘==ch || ‘#‘==ch )
            return true;
    else
        return false;
 
}
 
int EvaluateExpression::precede(char op1, char op2)
{
    int pos1=0;
    int pos2=0;
 
    if( ‘+‘==op1 )
        pos1 = 0;
    if( ‘-‘==op1 )
        pos1 = 1;
    if( ‘*‘==op1 )
        pos1 = 2;
    if( ‘/‘==op1 )
        pos1 = 3;
    if( ‘(‘==op1 )
        pos1 = 4;
    if( ‘)‘==op1 )
        pos1 = 5;
    if( ‘#‘==op1 )
        pos1 = 6;
 
    if( ‘+‘==op2 )
        pos2 = 0;
    if( ‘-‘==op2 )
        pos2 = 1;
    if( ‘*‘==op2 )
        pos2 = 2;
    if( ‘/‘==op2 )
        pos2 = 3;
    if( ‘(‘==op2 )
        pos2 = 4;
    if( ‘)‘==op2 )
        pos2 = 5;
    if( ‘#‘==op2 )
        pos2 = 6;
 
    return m_precede_table[pos1][pos2];
}
 
double EvaluateExpression::calc(double d1, char oper, double d2)
{
    if( 0==d2 )
    {
        m_error = true;
        return 0;
    }
    if( ‘+‘==oper )
        return d1+d2;
    if( ‘-‘==oper )
        return d1-d2;
    if( ‘*‘==oper )
        return d1*d2;
    if( ‘/‘==oper )
        return d1/d2;
 
    return -2;
}
 
 
bool EvaluateExpression::judge()
{
    return !m_error;
}

　　

 

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#include "mainFunc.h"
#include <iostream>
 
using namespace std;
 
int main()
{
 
    EvaluateExpression ee("(10.01+8)*2");
    bool terror=false;
    double res = ee.getResult(terror);
    if( terror==true)
        cout<<"error occurence"<<endl;
    else
        cout<<"res:"<<res<<endl;
    cout << "Hello world!" << endl;
    return 0;
}

　　

 

表达式求值,布布扣,bubuko.com

表达式求值

标签：blog   class   code   c   color   int   

原文地址：http://www.cnblogs.com/jesse-deng/p/3732636.html
踩
(0)
赞
(0)
   
举报
评论 一句话评论（0）
登录后才能评论！
分享档案
更多>
2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)
周排行
mamicode.com排行更多图片
更多
友情链接
兰亭集智   国之画   百度统计   站长统计   阿里云   chrome插件   新版天听网
关于我们 - 联系我们 - 留言反馈
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码！