递归之 Boolean Expressions

qiao_yi_fan

于 2017-02-14 19:23:58 发布

阅读量1.7k

点赞数 3

文章标签：递归

本文链接：https://blog.csdn.net/Chuxin126/article/details/55105076

版权

该博客介绍了一个使用递归方法评估布尔表达式的程序。程序处理包含 'V'（真）和 'F'（假）的表达式，并考虑运算符的优先级。递归在解析表达式时起关键作用，同时注意处理空格。博客提供了样例输入和输出，以及解题思路。

摘要由CSDN通过智能技术生成

关于题目

描述

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