將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式并計(jì)算

1、數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)題目: 使用鍵盤輸入表達(dá)式，計(jì)算表達(dá)式的值并輸出；將表達(dá)式轉(zhuǎn)化成后綴表達(dá)式輸出，利用后綴表達(dá)式求表達(dá)式的值并輸出。實(shí)驗(yàn)?zāi)康模菏褂脳５牟僮骶帉戧P(guān)于數(shù)據(jù)結(jié)構(gòu)的程序。實(shí)驗(yàn)內(nèi)容：寫出程序并上機(jī)調(diào)試、通過。一、需求分析1、演示程序以用戶和計(jì)算機(jī)的對(duì)話方式執(zhí)行，即在計(jì)算機(jī)終端上顯示“請(qǐng)輸入表達(dá)式”時(shí)輸入中綴表達(dá)式。然后計(jì)算機(jī)終端輸出轉(zhuǎn)換后的后綴表達(dá)式及計(jì)算后的結(jié)果。2、程序執(zhí)行的命令包括：（1）構(gòu)造鏈棧；（2）輸入數(shù)據(jù)；（3）判斷輸入的表達(dá)式是否為非法表達(dá)式；（4）將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式；（5）計(jì)算表達(dá)式的值；（6）輸出。（7）結(jié)束4、本程序能將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式，并且能

2、計(jì)算表達(dá)式的值。5、輸入及輸出示例：例1：請(qǐng)輸入表達(dá)式6+3*（6+5）后綴表達(dá)式：6 3 6 5 + * +計(jì)算結(jié)果為：39Press any key to continue 例2：請(qǐng)輸入表達(dá)式6-3*（7+1ERROR:表達(dá)式錯(cuò)誤Press any key to continue 二 概要設(shè)計(jì)1基本操作(1)、struct node操作結(jié)果：創(chuàng)建結(jié)構(gòu)體(2)、int Searchexpression(char string1)初始條件：表達(dá)式string1已經(jīng)存在。操作結(jié)果：判斷表達(dá)式是否非法(3)、struct node *Initialization()操作結(jié)果：創(chuàng)建棧鏈。(4)、st

3、ruct node *assort(struct node *s)初始條件：string1、string2已存在。操作結(jié)果：將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式并存在string2中。(5)、struct node *calcolate(struct node *s)操作結(jié)果：求出表達(dá)式的值2、模塊調(diào)用圖主程序模塊創(chuàng)建結(jié)構(gòu)體判斷表達(dá)式是否非法將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式表達(dá)式求值三 詳細(xì)設(shè)計(jì)1、每個(gè)模塊：(1) 定義結(jié)構(gòu)體struct node char data;int num;struct node *next; (2) 判斷表達(dá)式是否非法int Searchexpression(char str

4、ing1) int i1,b1,b2;int m;m=strlen(string1);if(string10<'0'|string10>'9')printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);for(i1=0;i1<=m;i1+)if(string1i1='(')b1+;elseif(string1i1=')')b2+;if(b1!=b2)printf("ERROR:缺少括號(hào)n");return(WRONG);for(i1=0;i1<m

5、;i1+)if('0'<=string1i1&&string1i1<='9'&&'0'<=string1i1+1&&string1i1+1<='9') printf("ERROR:表達(dá)式缺操作符！n");return(WRONG);for(i1=0;i1<=m;i1+)if(string1i1='+'&&(string1i1+1='+'|string1i1+1='-'|s

6、tring1i1+1='*'|string1i1+1='/') printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1='-'&&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/') printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1

7、='*'&&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/')printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1='/'&&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/&#

8、39;)printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);return(RIGHT); (3)、將中綴表達(dá)式轉(zhuǎn)換為后綴表達(dá)式struct node *assort(struct node *s)/輸入字符串struct node *p,*top;int i;top=s;int m;char a;m=strlen(string1); for(i=0;i<=m;i+)a=string1i;if('0'<=string1i&&string1i<='9')string2j=string1

9、i;j+;elseswitch(a)case '(':p=(struct node *)malloc(sizeof(struct node);p->data=a;p->next=top;top=p;break; case '*':case '/':string2j=' 'j+;if(top->data='*')|(top->data='/')string2j=top->data;j+; /比其高，現(xiàn)將棧頂運(yùn)算符出棧，再進(jìn)棧。top->data=a;break;el

10、sep=(struct node *)malloc(sizeof(struct node);/否，直接進(jìn)棧p->data=a;p->next=top;top=p;break;case '+':case '-':string2j=' 'j+;if(top->data='+'|top->data='-'|top->data='*'|top->data='/')string2j=top->data;j+;top->data=a;break;e

11、lse p=(struct node *)malloc(sizeof(struct node);p->data=a;p->next=top;top=p;break; case ')':string2j=' 'j+;if(top->data='')printf("input error");break;while(top->data!='(')string2j=top->data;j+;p=top;top=top->next;free(p);p=top;top=top->

12、next;free(p);break;while(top->data!='')string2j=top->data;j+;p=top;top=top->next;free(p);string2j='#'printf("后綴表達(dá)式為:");for(i=0;i<j;i+)if(string2i!=' ')printf("%c ",string2i);printf("n ");return top; (4)表達(dá)式求值struct node *calcolate(stru

13、ct node *s)struct node *top,*p;char *q;int x,y,a;int i,n;top=s;/指向棧頂?shù)闹羔榝or(i=0;i<=j;i+)/遍歷字符串string2if(string2i>='0'&&string2i<='9')q=&string2i;a=atoi(q); for(n=i;string2n>='0'&&string2n<='9'n+)p=(struct node *)malloc(sizeof(struct n

14、ode );p->num=a;p->next=top;top=p;i=n-1;elseif(string2i='#') /遇#號(hào)結(jié)束標(biāo)志，輸出棧中的最后計(jì)算結(jié)果printf("計(jì)算結(jié)果為:%dn",top->num);elseif(string2i=' ')elsey=top->num;p=top;top=top->next;free(p);x=top->num;p=top;top=top->next;free(p);switch(string2i)case '+':a=x+y;p=(

15、struct node *)malloc(sizeof(struct node);p->num=a;p->next=top;top=p;break;case '-':a=x-y;p=(struct node *)malloc(sizeof(struct node );p->num=a;p->next=top;top=p;break;case '*':a=x*y;p=(struct node *)malloc(sizeof(struct node );p->num=a;p->next=top;top=p;break;case &

16、#39;/':if(y=0) printf("ERROR:除數(shù)為零!n");a=(float)x/y;p=(struct node *)malloc(sizeof(struct node );p->num=a;p->next=top;top=p;break;return 0;(5)、主函數(shù)void main()struct node *top,*head;top=Initialization();/建立一個(gè)鏈棧，并返回棧頂指針printf("請(qǐng)輸入表達(dá)式：n");gets(string1);if(Searchexpression(st

17、ring1)head=assort(top);/中綴轉(zhuǎn)化為后綴表達(dá)式calcolate(head);2、完整函數(shù)#include<stdio.h>#include<malloc.h>#include<string.h>#include<stdlib.h>#define MAX 60#define RIGHT 1#define WRONG 0#define DEMAX 15#define NULL 0char string1MAX;char string2MAX;int j=0;struct node /定義結(jié)構(gòu)體。char data;int nu

18、m;struct node *next;int Searchexpression(char string1) /判斷非法表達(dá)式int i1,b1,b2;int m;m=strlen(string1);if(string10<'0'|string10>'9')printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);for(i1=0;i1<=m;i1+)if(string1i1='(')b1+;elseif(string1i1=')')b2+;if(b1!=b2)print

19、f("ERROR:缺少括號(hào)n");return(WRONG);for(i1=0;i1<m;i1+)if('0'<=string1i1&&string1i1<='9'&&'0'<=string1i1+1&&string1i1+1<='9') printf("ERROR:表達(dá)式缺操作符！n");return(WRONG);for(i1=0;i1<=m;i1+)if(string1i1='+'&am

20、p;&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/') printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1='-'&&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/') printf(&q

21、uot;ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1='*'&&(string1i1+1='+'|string1i1+1='-'|string1i1+1='*'|string1i1+1='/')printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);elseif(string1i1='/'&&(string1i1+1='+'|string1i1+1

22、='-'|string1i1+1='*'|string1i1+1='/')printf("ERROR:表達(dá)式缺操作數(shù)！n");return(WRONG);return(RIGHT);struct node *Initialization()/初始化棧鏈,鏈棧不帶頭結(jié)點(diǎn)struct node *top;top=(struct node *)malloc(sizeof(struct node);top->data=''top->num=0;top->next=NULL;return top;str

23、uct node *assort(struct node *s)/輸入字符串struct node *p,*top;int i;top=s;int m;char a;m=strlen(string1); for(i=0;i<=m;i+)a=string1i;if('0'<=string1i&&string1i<='9')string2j=string1i;j+;elseswitch(a)case '(':p=(struct node *)malloc(sizeof(struct node);p->data=

24、a;p->next=top;top=p;break; case '*':case '/':string2j=' 'j+;if(top->data='*')|(top->data='/')string2j=top->data;j+; /比其高，現(xiàn)將棧頂運(yùn)算符出棧，再進(jìn)棧。top->data=a;break;elsep=(struct node *)malloc(sizeof(struct node);/否，直接進(jìn)棧p->data=a;p->next=top;top=p;bre

25、ak;case '+':case '-':string2j=' 'j+;if(top->data='+'|top->data='-'|top->data='*'|top->data='/')string2j=top->data;j+;top->data=a;break;else p=(struct node *)malloc(sizeof(struct node);p->data=a;p->next=top;top=p;break; c

26、ase ')':string2j=' 'j+;if(top->data='')printf("input error");break;while(top->data!='(')string2j=top->data;j+;p=top;top=top->next;free(p);p=top;top=top->next;free(p);break;while(top->data!='')string2j=top->data;j+;p=top;top=top-&

27、gt;next;free(p);string2j='#'printf("后綴表達(dá)式為:");for(i=0;i<j;i+)if(string2i!=' ')printf("%c ",string2i);printf("n ");return top;struct node *calcolate(struct node *s)/計(jì)算表達(dá)式的值struct node *top,*p;char *q;int x,y,a;int i,n;top=s;/指向棧頂?shù)闹羔榝or(i=0;i<=j;i+)/

28、遍歷字符串string2if(string2i>='0'&&string2i<='9')q=&string2i;a=atoi(q); for(n=i;string2n>='0'&&string2n<='9'n+)p=(struct node *)malloc(sizeof(struct node );p->num=a;p->next=top;top=p;i=n-1;elseif(string2i='#') /遇#號(hào)結(jié)束標(biāo)志，輸出棧中的最后計(jì)算結(jié)果printf("計(jì)算結(jié)果為:%dn",top->num);elseif(string2i=' ')elsey=top->num;p=top;top=top->next