Boolean Expressions

C - Boolean Expressions

Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u

Submit  Status

Appoint description:  System Crawler  (2012-09-19)

Description

The objective of the program you are going to produce is to evaluate boolean expressions as the one shown next: 
Expression: ( V | V ) & F & ( F | V )
where V is for True, and F is for False. The expressions may include the following operators: ! for not , & for and, | for or , the use of parenthesis for operations grouping is also allowed. 

To perform the evaluation of an expression, it will be considered the priority of the operators, the not having the highest, and the or the lowest. The program must yield V or F , as the result for each expression in the input file. 

Input

The expressions are of a variable length, although will never exceed 100 symbols. Symbols may be separated by any number of spaces or no spaces at all, therefore, the total length of an expression, as a number of characters, is unknown. 

The number of expressions in the input file is variable and will never be greater than 20. Each expression is presented in a new line, as shown below. 

Output

For each test expression, print "Expression " followed by its sequence number, ": ", and the resulting value of the corresponding test expression. Separate the output for consecutive test expressions with a new line. 

Use the same format as that shown in the sample output shown below. 

Sample Input

( V | V ) & F & ( F| V)
!V | V & V & !F & (F | V ) & (!F | F | !V & V)
(F&F|V|!V&!F&!(F|F&V))

Sample Output

Expression 1: F
Expression 2: V
Expression 3: V

用到两个栈

用于存储运算符的栈op,和栈顶指针otop；

用于存储运算数的栈val，栈顶指针vtop;

计算过程

1. 两个栈初始化为空，otop=vtop=0;

2. 依次读取表达式，若遇‘（’则把0入op栈，

3.若遇‘）’则处理括号里所有的运算，结果入val栈，op中的'('出栈。

4.若遇‘！’，把3入op栈。

5.若遇‘&’，把op栈顶的‘&’  ，‘！’，依次出栈，进行相应的运算，把2入op栈。

6.若遇'|'，把op栈顶的‘&’，‘！’，‘|’，依次出栈，进行相应的运算，把1入op栈。

7.若遇‘V'或’F‘，把其转化为数字入val栈（’V'为1，‘F'为0）

8.把op中剩余的运算符依次出栈，并进行相应的运算，最后val栈底的元素即为最后的计算结果。

#include <iostream>

#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=100+10;
int val[maxn],vtop;
int op[maxn],otop;
void calc(void)
{
int c;
int b=val[--vtop];
int optr=op[--otop];
if(optr==3)
{
c=!b;
}
else 
{
int a=val[--vtop];
if(optr==2)
{
       
             c=(a&b);
}
        else if(optr==1)
 c=(a|b);
}
val[vtop++]=c;
}
int main()
{
int loop=0;
char c;
while((c=getchar())!=EOF)
{
vtop=otop=0;
do
{
if(c=='(')
op[otop++]=0;
else if(c==')')
{
while(otop&&op[otop-1]!=0)
calc();
--otop;
val[vtop++]=val[--vtop];
}
else if(c=='!')
op[otop++]=3;
else if(c=='&')
{
while(otop&&op[otop-1]>=2)
calc();
op[otop++]=2;
}
else if(c=='|')
{
while(otop&&op[otop-1]>=1)
calc();
op[otop++]=1;
}
else if(c=='V'||c=='F')
{

val[vtop++]=(c=='V')?1:0;
}
}while((c=getchar())!='\n'&&c!=EOF);
while(otop)
calc();
printf("Expression %d: %c\n",++loop,(val[0]?'V':'F'));
}
return 0;
}