Return 后缀无效表达式

Question

所以我有一个小问题需要解决。我必须 return 后缀表达式的结果，还必须检测无效的后缀表达式。我的问题是，每当我检测到无效的后缀表达式时，程序仍然 return 是表达式的值。我只想 return 一条消息，说明表达式无效。

代码：

public class Evaluator {

    private static final String add = "+"; 
    private static final String sub = "-";
    private static final String mul = "*";
    private static final String div = "/";

    public static void main (String [] args) throws FileNotFoundException{
        Scanner scan = new Scanner(System.in);

        System.out.print("Input filename:"); // read file -------
        String filename = scan.nextLine();
        File file = new File(filename);
        Scanner reader = new Scanner(file);// --------------------------


        while (reader.hasNextLine()){
        String  line = reader.nextLine();
        System.out.println(line + " = " + start(line));
        }

    }

    public static int start (String line ) {
        GenericStack<Integer> stack = new GenericStack<>();

         String[] inputs = line.split(" ");
        return postfix(stack, inputs);

    }
    public static int postfix(GenericStack<Integer> stack, String[] temp) {
        int num1, num2;

        for(int i = 0; i < temp.length; i++) {
            if( temp[i].equals(add) || temp[i].equals(sub) || temp[i].equals(mul) || temp[i].equals(div) ) {
                num2 = stack.pop();
                num1 = stack.pop();
                switch(temp[i]) {
                case add: {
                    int operation = num1 + num2;
                    stack.push(operation);
                    break;
                }

                case sub: {
                    int operation = num1 - num2;
                    stack.push(operation);
                    break;
                }

                case mul: {
                    int operation = num1 * num2;
                    stack.push(operation);
                    break;
                }

                case div: {
                    int operation = num1 / num2;
                    stack.push(operation);
                    break;
                }
                }
            } else {            
                stack.push(Integer.parseInt(temp[i]));
            }

        }
        if (stack.isEmpty()) {
            System.out.print ("No value to return on the following postfix expression: ");  
        }
         if (stack.size() > 1) {
             System.out.print ("Too many operands on the following postfix expression: ");   
        }

     return stack.pop();

    }
}

示例输出：

6 5 2 3 + 8 * + 3 + * = 288
Too many operands on the following postfix expression: 6 5 2 3 + 8 * + 3 + = 48

Answer 1

最好的方法是抛出异常

更改后缀方法 throw Exception on Invalid expression 并添加 throws Exception on method signature 如下所示：

public static int postfix(GenericStack<Integer> stack, String[] temp) throws Exception {
    ....
    if (stack.isEmpty()) {
        throw new Exception("No value to return on the following postfix expression: ");
    }
    if (stack.size() > 1) {
        throw new Exception("Too many operands on the following postfix expression: ");
    }
}

更改启动方法添加在方法签名上抛出异常

public static int start(String line) throws Exception {
    ....
}

并且在 main 方法中，在调用方法开始时添加 try catch 块

try {
     System.out.println(line + " = " + start(line));
} catch (Exception e) {
    System.out.println(e.getMessage());
}

Return 后缀无效表达式

Return postfix invalid expression

java

stack

postfix