题意:
输入由p、q、r、s、t、K、A、N、C、E共10个字母组成的逻辑表达式,
其中p、q、r、s、t为逻辑变量,值为1(true)或0(false),
K、A、N、C、E为逻辑运算符,
K --> and: x && y
A --> or: x || y
N --> not : !x
C --> implies : (!x)||y
E --> equals : x==y
问这个逻辑表达式是否为永真式。
解题思路:
p,q,r,s,t,的所有取值的组合为32种,用for循环来取遍所有的值。在每一次循环中,从后往前检索字符串,如果遇到,p,q,r,s,t,则把把它们当前值入栈,如果遇到K,E,A,C,从栈中取出两个值并计算,把计算的结果再入栈,遇到N,出栈取反再入栈;字符串检索完了以后栈中应该只剩下整个字符串的值,出栈并判断真假;
参考代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define STACKSIZE 101
typedef struct stack
{
int data[STACKSIZE];
int top;
}Stack;
Stack * Init()
{
Stack * s ;
s = (Stack *)malloc(sizeof(Stack));
if (!s)
{
return (Stack *)NULL;
}else
{
s->top = 0;
return s;
}
}
int Push(Stack *s,int e)
{
s->data[s->top] = e;
s->top = s->top + 1;
return 1;
}
int Pop(Stack *s,int *e)
{
if (s->top == 0)
{
return 0;
}
else
{
s->top = s->top -1;
*e = s->data[s->top];
return 1;
}
}
int IsEmpty(Stack *s)
{
if (s->top == 0)
{
return 1;
}
return 0;
}
int main()
{
int l,p,q,r,s,t,i,temp1,temp2,result,temp,flag ;
char str[101];
Stack *sc ;
sc = Init();
scanf("%s",str);
while(str[0] != '0')
{
l = strlen(str);
flag = 1;
for(p = 0;p <= 1;p++)
{
for(q = 0;q <= 1;q++)
{
for(r = 0;r <= 1;r++)
{
for(s = 0;s <= 1;s++)
{
for(t = 0;t <= 1;t++)
{
for (i = l - 1;i >= 0;i--)
{
switch(str[i])
{
case 'p':Push(sc,p);break;
case 'q':Push(sc,q);break;
case 'r':Push(sc,r);break;
case 's':Push(sc,s);break;
case 't':Push(sc,t);break;
case 'A':if(!IsEmpty(sc)){Pop(sc,&temp1);Pop(sc,&temp2);result = (temp1 || temp2);Push(sc,result);}break;
case 'K':if(!IsEmpty(sc)){Pop(sc,&temp1);Pop(sc,&temp2);result = (temp1 && temp2);Push(sc,result);}break;
case 'N':if(!IsEmpty(sc)){Pop(sc,&temp1);result = !temp1;Push(sc,result);}break;
case 'C':if(!IsEmpty(sc)){Pop(sc,&temp1);Pop(sc,&temp2);result = (!temp1 || temp2);Push(sc,result);}break;
case 'E':if(!IsEmpty(sc)){Pop(sc,&temp1);Pop(sc,&temp2);result = (temp1 == temp2);Push(sc,result);}break;
}
}
Pop(sc,&temp);
if(!temp)
{
flag = 0;
break;
}
sc->top = 0;
}
if (!flag)
break;
}
if (!flag)
break;
}
if (!flag)
break;
}
if (!flag)
break;
}
if(!flag)
printf("not\n");
else
printf("tautology\n");
scanf("%s",str);
}
return 0;
}