Skip to main content

Evaluate postfix expression using stack in java

Java program for Evaluate postfix expression using stack. Here problem description and other solutions.

/* 
    Java program for 
    Evaluate postfix expression
*/
// Stack Node
class StackNode
{
	public int operand;
	public StackNode next;
	public StackNode(int operand, StackNode top)
	{
		this.operand = operand;
		this.next = top;
	}
}
class MyStack
{
	public StackNode top;
	public int count;
	public MyStack()
	{
		this.top = null;
		this.count = 0;
	}
	// Returns the number of element in stack
	public int size()
	{
		return count;
	}
	public boolean isEmpty()
	{
		if (this.size() > 0)
		{
			return false;
		}
		else
		{
			return true;
		}
	}
	// Add a new element in stack
	public void push(int value)
	{
		// Make a new stack node
		// And set as top
		this.top = new StackNode(value, this.top);
		// Increase node value
		this.count++;
	}
	// Remove a top element 
	public int pop()
	{
		int value = this.peek();
		if (this.isEmpty() == false)
		{
			this.top = this.top.next;
			// Reduce the size
			this.count--;
		}
		return value;
	}
	// Used to get top element of stack
	public int peek()
	{
		if (!this.isEmpty())
		{
			return this.top.operand;
		}
		else
		{
			return 0;
		}
	}
}
public class Execution
{
	public void evaluate(String e)
	{
		// Get the length of expression
		int size = e.length();
		int a = 0, b = 0;
		MyStack s = new MyStack();
		boolean isVaild = true;
        // work with (+,-,/,*,%) operator
		for (int i = 0; i < size && isVaild; i++)
		{
			if (e.charAt(i) >= '0' && 
                e.charAt(i) <= '9')
			{
				a = e.charAt(i) - '0';
				s.push(a);
			}
			else if (s.size() > 1)
			{
				a = s.pop();
				b = s.pop();
				// Perform arithmetic operations between 2 operands
				if (e.charAt(i) == '+')
				{
					s.push(b + a);
				}
				else if (e.charAt(i) == '-')
				{
					s.push(b - a);
				}
				else if (e.charAt(i) == '*')
				{
					s.push(b * a);
				}
				else if (e.charAt(i) == '/')
				{
					s.push(b / a);
				}
              	else if (e.charAt(i) == '%')
				{
					s.push(b % a);
				}
				else
				{
					// When use other operator
					isVaild = false;
				}
			}
			else if (s.size() == 1)
			{
				// Special case  
				// When use +, - at the beginning
				if (e.charAt(i) == '-')
				{
					a = s.pop();
					s.push(-a);
				}
				else if (e.charAt(i) != '+')
				{
					// When not use  +,-
					isVaild = false;
				}
			}
			else
			{
				isVaild = false;
			}
		}
		if (isVaild == false)
		{
			// Possible case use other operators
			// 1) When using special operators
			// 2) Or expression is invalid
			System.out.println(e + " Invalid expression ");
			return;
		}
		System.out.println(e + " = " + s.pop());
	}
	public static void main(String[] args)
	{
		Execution task = new Execution();
		// Execute the following expression
		// (1+2)*(3+5)
		task.evaluate("12+35+*");
		// -((7*2) + (6/2) + 4)
		task.evaluate("72*62/+4+-");
	}
}

Output

12+35+* = 24
72*62/+4+- = -21




Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment