前缀表达式评估不正确 - Java

Prefix Expression evaluating incorrectly - Java

private class InputListener implements ActionListener
    {
      public void actionPerformed(ActionEvent e)
      {
         // Create an integer and character stack
         Stack<Integer> operandStack = new Stack<Integer>();
         Stack<Character> operatorStack = new Stack<Character>();

         // User input in input text field
         String input = inputTextField.getText();

         // Create string tokenizer containing string input
         StringTokenizer strToken = new StringTokenizer(input);

         // Loop while there are tokens
         while (strToken.hasMoreTokens())
         {
             String i = strToken.nextToken();
             int operand;
             char operator;

             try
             {
                 operand = Integer.parseInt(i);
                 operandStack.push(operand);
             }
             catch (NumberFormatException nfe)
             {
                 operator = i.charAt(0);
                 operatorStack.push(operator);
             }
          }

          // Loop until there is only one item left in the
          // operandStack. This one item left is the result
          while(operandStack.size() > 1)
          {
            // Perform the operations on the stack
            // and push the result back onto the operandStack
            operandStack.push(operate(operandStack.pop(),
            operandStack.pop(), operatorStack.pop()));
          }

          // Display the result as a string in the result text field
          resultTextField.setText(Integer.toString(operandStack.peek()));
       }
       // Sum and product computed
       public int operate(Integer operand1, Integer operand2, char operator)
       {
         switch(operator)
         {
            case '*':
               return operand2 * operand1;
            case '/':
               return operand2 / operand1;
            case '%':
               return operand2 % operand1;
            case '+':
               return operand2 + operand1;
            case '-':
               return operand2 - operand1;
            default:
               throw new IllegalStateException("Unknown operator " + operator + " ");
          }
        }
     }

提供的前缀表达式代码错误地评估了具有多个运算符的表达式。表达式:* + 16 4 + 3 1 应该求值为 80 = ((16 + 4) * (3 + 1)),但它求值为 128,我认为它求值为:((16 + 4) * (3 + 1) + (16 * 3))。如何编辑代码以更正此问题?谢谢你的帮助。

在前缀评估中,要记住的重要一点是

操作数 1= pop();

操作数 2= pop();

并说运算符是 -

压入的值是操作数 1 - 操作数 2 而不是操作数 2 - 操作数 1

但是其他原因导致 * + 16 4 + 3 1 的计算结果为 128。

我在 java 中使用了以下算法进行评估,它运行良好

1.Take 前缀表达式作为变量中的字符串,字符由单个 space.

分隔

2.Traverse索引长度为1到0的字符串

3.If是一个号码,进行push,如果是多位数,先获取完整号码再push

4.If 它是一个操作员,然后简单地做我在答案开头提到的事情。

这是一个简单的代码。

import java.io.*;
import java.util.*;
class PREFIXEVAL
{
public static void main(String []args)throws IOException
{
 String p,n="";StringBuffer b;int i,op1,op2;char c;Stack<Integer> s=new Stack<Integer>();
 BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
 System.out.println("enter the prefix expression separated by spaces");
 p=br.readLine();
 i=p.length()-1;
 while(i>=0)
 {
     c=p.charAt(i);
     if(c>=48&&c<=57)
     n=n+c;
     else if(c==' '&&!n.equals(""))
     {/*handles both single and multidigit numbers*/
         b=new StringBuffer(n);b.reverse();n=b.toString();
         s.push(Integer.parseInt(n));n="";
        }
        else 
        {
            if(c=='+')
            {
                op1=s.pop();
                op2=s.pop();
                s.push(op1+op2);
            }
            else if(c=='-')
            {
                op1=s.pop();
                op2=s.pop();
                s.push(op1-op2);
            }
            else if(c=='*')
            {
                op1=s.pop();
                op2=s.pop();
                s.push(op1*op2);
            }
            else if(c=='%')
            {
                op1=s.pop();
                op2=s.pop();
                s.push(op1%op2);
            }
            else if(c=='/')
            {
                op1=s.pop();
                op2=s.pop();
                s.push(op1/op2);
            }
        }
        i--;
    }
    System.out.println("the prefix expression evaluates to "+s.peek());
  }
 }