POJ | 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

解题思路

 此题目可以通过递归的方式来做，下面是根据题意分析的Grammar解析过程，据此我们可以写实现代码。

Grammar:

　　expression:

　　　　primary

　　　　primary "&" primary

　　　　primary "|" primary

　　primary:

        　　primary

　　　　"!" primary

　　　　"V"

　　　　"F"

　　　　"(" expression ")"

 

实现代码

#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>

char str[100] = {'\0'};
int idx = 0;
bool expression();



bool primary()
{
    char op = str[idx];
    bool result;
    if (op == '(')
    {
        idx++; //(
        result = expression();
        idx++; //)
    }
    else if (op == 'V')
    {
        result = true;
        idx++;
    }
    else if (op == 'F')
    {
        result = false;
        idx++;
    }
    else if (op == '!')
    {
        idx++;
        result = !primary();
    }
    return result;
    
}

bool expression()
{
    bool result = primary();
    while (true)
    {
        char op = str[idx];
        if (op == '&' || op == '|')
        {
            idx++;
            bool value = primary();
            if (op == '&')
            {
                result &= value;
            }
            else
            {
                result |= value;
            }
        }
        else
        {
            break;
        }
    }
    return result;
}

bool getline_ns(char *str, int max)
{
    bool ret = false;
    char *s = (char *)malloc(sizeof(char) * max * 10);
    if (fgets(s, max * 10, stdin))
    {
        int i = 0, j = 0;
        for (; s[i] != '\0'; i++)
        {
            if (s[i] != ' ')
                str[j++] = s[i];
        }
        str[j++] = '\0';
        ret = true;
    }
    free(s);
    return ret;
}
int main()
{
    int i = 0;
    while (getline_ns(str, 100))
    {
        idx = 0;
        printf("Expression %d: %c\n", ++i, expression() ? 'V' : 'F');
    }
    return 0;
}

 

测试数据

输入

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

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

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

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

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

　　V

　　(((V)))

　　((!(F)))

　　(!(!( !(F ))))

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

输出

　　Expression 1: F

　　Expression 2: V

　　Expression 3: F

　　Expression 4: F

　　Expression 5: F

　　Expression 6: V

　　Expression 7: V

　　Expression 8: V

　　Expression 9: V

　　Expression 10: V