SDUTスモールBasicコンパイラの問題

20391 ワード

http://acm.sdut.edu.cn/web/showproblem.php?pid=2099&cid=1088
やっと途中で複数のスペースがあるかもしれない処理が落ち始め、WAは何度も..また、ここでは式の理解を徹底しなければならない.式には3つの1がある.定数.2:A+B形式;3:A>Bの形式..


View Code
#include <cstdio>
#include <cstring>
#include <iostream>
#define maxn 107
using namespace std;
struct node
{
int num;//
char op[10];//
char exp[10];//
int expl;//
}tagp[maxn];
int en[30];
int main()
{
char st[maxn];
int i,j,len,jj;
int k = 1;
memset(tagp,0,sizeof(tagp));
memset(en,0,sizeof(en));
while (gets(st) != NULL)
{
len = strlen(st);
i = 0;
while (st[i] == ' ') i++;//
for (; st[i] != ' ' && i < len; ++i)
{
tagp[k].num = tagp[k].num*10 + st[i] - '0';
}
while (st[i] == ' ') i++;//
int l = 0;
for (j = i; st[j] != ' ' && j < len; ++j)
tagp[k].op[l++] = st[j];
while (st[j] == ' ') j++;
l = 0;
for (jj = j; jj < len; ++jj)
{
tagp[k].exp[l++] = st[jj];
tagp[k].expl++;
}
k++;
}
int s = 1;
int pos1 = 0;
int pos2 = 0;
int pos3 = 0;
while (s)
{
if (strcmp(tagp[s].op,"STOP") == 0) break;
if (strcmp(tagp[s].op,"LET") == 0)
{
pos1 = tagp[s].exp[0] - 'A';
if (tagp[s].expl > 3)// 3
{
if (tagp[s].exp[3] >= '0' && tagp[s].exp[3] <= '9')//
{
int sum = 0;
for (i = 2; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
en[pos1] = sum;
}
else// A>B A+B
{
pos2 = tagp[s].exp[2] - 'A';
pos3 = tagp[s].exp[4] - 'A';
if (tagp[s].exp[3] == '+')
en[pos1] = en[pos2] + en[pos3];
else if (tagp[s].exp[3] == '>')
{
if (en[pos2] > en[pos3])
en[pos1] = 1;
else
en[pos1] = 0;
}
}
}
else// 3
{
int sum = 0;
for (i = 2; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
en[pos1] = sum;
}
s++;
}
else if (strcmp(tagp[s].op,"PRINT") == 0)
{
pos1 = tagp[s].exp[0] - 'A';
printf("%s=%d
",tagp[s].exp,en[pos1]);
s++;
}
else if (strcmp(tagp[s].op,"IF") == 0)
{
if (tagp[s].expl == 3)//
{
if (tagp[s].exp[1] >= '0' && tagp[s].exp[1] <= '9')//
{
int sum = 0;
for (i = 0; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
if (sum > 0) s++;
else s += 2;
}
else
{
pos2 = tagp[s].exp[0] - 'A';
pos3 = tagp[s].exp[2] - 'A';
if (tagp[s].exp[1] == '+')//A+B
{
int mark = en[pos2] + en[pos3];
if (mark > 0) s++;
else s += 2;
}
else if (tagp[s].exp[1] == '>')//A>B
{
pos2 = tagp[s].exp[0] - 'A';
pos3 = tagp[s].exp[2] - 'A';
if (en[pos2] > en[pos3])
s++;
else
s += 2;
}
}
}
else//
{
int sum = 0;
for (i = 0; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
if (sum > 0)
s++;
else
s += 2;
}
}
//
else if (strcmp(tagp[s].op,"GOTO") == 0)
{
if (tagp[s].expl == 3)
{
if (tagp[s].exp[1] >= '0' && tagp[s].exp[1] <= '9')
{
int sum = 0;
for (i = 0; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
if (sum > 0) s = sum;
else break;
}
else
{
pos2 = tagp[s].exp[0] - 'A';
pos3 = tagp[s].exp[2] - 'A';
if (tagp[s].exp[1] == '+')
{
int mark = en[pos2] + en[pos3];
if (mark > 0) s = mark;
else break;
}
else if (tagp[s].exp[1] == '>')
{
pos2 = tagp[s].exp[0] - 'A';
pos3 = tagp[s].exp[2] - 'A';
if (en[pos2] > en[pos3])
s = 1;
else
break;
}
}
}
else
{
int sum = 0;
for (i = 0; i < tagp[s].expl; ++i)
{
sum = sum*10 + (tagp[s].exp[i] - '0');
}
if (sum > 0)
s = sum;
else
break;
}
}
}
return 0;
}