085day(递归例题（Boolean Expressions）的尝试)

172210704111-陈国佳总结《2018年1月3日》【连续085天】

标题：递归例题（Boolean Expressions）的尝试；

内容：

A.复习了递归例题（表达式求值）（049day）；

B.尝试了一道递归题目（Boolean Expressions）：
总时间限制: 1000ms 内存限制: 65536kB
描述
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.
输入
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.
输出
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.
样例输入
( V | V ) & F & ( F| V)
!V | V & V & !F & (F | V ) & (!F | F | !V & V)
(F&F|V|!V&!F&!(F|F&V))
样例输出
Expression 1: F
Expression 2: V
Expression 3: V

思路大致与四则运算表达式类似，将原表达式分为：表达式（互相|操作），项（互相&操作），因子（!V,!F,F,V或者(表达式)）；（具体划分是按照运算符的优先级：

题中：it will be considered the priority of the operators, the not having the highest, and the or the lowest.）

1）题中是输入流是不干净的，包含了若干个 '  '，需要在输入时除去；

2）题目的另一个难点是输入的行数不确定，暂时还未想出解决方案；

我原本想先写一个输出一行结果的代码，但也未成功，先贴出失败代码，争取明天解决：

#include<iostream>
#include<cstring>
#include<cstdlib>
using namespace std;
char getc()
{
	char a=cin.peek();
	while(a=' ')cin.get(),a=cin.peek();
	if(a!=' ')return a;
}
char Expression();
char Term();
char Factor();
char Expression()
{
	char result=Term();
	bool more=true;
	while(more){
	char a=getc();
	if(a=='|'){
		cin.get();
		char value=Term();
		result |=value;
	   }
	   else more=false;
	}
	return result;
} 
char Term()
{
	char result=Factor();
	bool more=true;
	while(more){
	char a=getc();
	if(a=='&'){
		cin.get();
		char value=Factor();
		result &=value;
	   }
	   else more=false;
	}
	return result;
} 
char Factor()
{
	char result=true;
	char a=getc();
	if(a=='('){
		cin.get();
		result=Expression();
		cin.get();
	}
	else {
		if(a=='!'){
			cin.get();
			char b=getc();
			if(b=='V')result=false,cin.get();
			else result=true,cin.get();
		}
		else if(a=='V')result=true,cin.get();
		else result=false,cin.get();
	}
	return result;
} 
int main()
{
	bool result=Expression();
	if(result)cout<<'V';
	else cout<<'F';
	return 0;
} 

明日计划：解决该题；