开发工具:
文件大小: 2kb
下载次数: 0
上传时间: 2010-06-07
详细说明： #include//E->TC #include//C->+TC/$ $表空串 using namespace std;//T->FD string biao[5][6]={{"CT"," "," ","CT"," "," "},{" ","CT+"," "," ","$","$"},{"DF"," "," ","DF"," "," "}, {" ","$","DF*"," ","$","$"},{"i"," "," ",")E( "," "," "}};//D->*F/$ //F->i/(E) i表id //i+i*i (i+i)*i char vn[6]="ECTDF"; char vt[7]="i+*()#"; typedef struct { char c[100]; int top; }seqstack; seqstack s; seqstack i; seqstack* sy=&s; seqstack* in=&i; char pop(seqstack* s) { char a=s->c[s->top]; s->top--; return a; } void push(char c,seqstack* s) { s->top++; s->c[s->top]=c; } void setNull(seqstack* s) { s->top=-1; } void show(seqstack* sy,seqstack* in) { cout<<"分析栈:"<<"\t"<<"\t"<<"输入栈"<top;i++) { if(sy->c[i]=='i') cout<<"id"; else if(sy->c[i]=='C') cout<<"E'"; else if(sy->c[i]=='D') cout<<"T'"; else cout<c[i]; } cout<<"\t"<<"\t"; for(i=0;i<=in->top;i++) { if(in->c[in->top-i]=='i') cout<<"id"; else cout<c[in->top-i]; } cout<c[in->top]==vt[j]) break; } for(int t=0;t<5;t++) { if(a==vn[t]) break; } s=biao[t][j];// if(s==" ") { cout<<"error"<c[in->top]&&a!='#') { pop(in); show(sy,in); } else { cout<<"error"<c[in->top]) { cout<<"表达式合法"<
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
