Skip to main content

Evaluate postfix expression using stack in kotlin

Kotlin program for Evaluate postfix expression using stack. Here more information.

/* 
    Kotlin program for 
    Evaluate postfix expression
*/
// Stack Node
class StackNode
{
	var operand: Int;
	var next: StackNode ? ;
	constructor(operand: Int, top: StackNode ? )
	{
		this.operand = operand;
		this.next = top;
	}
}
class MyStack
{
	var top: StackNode ? ;
	var count: Int;
	constructor()
	{
		this.top = null;
		this.count = 0;
	}
	// Returns the number of element in stack
	fun isSize(): Int
	{
		return this.count;
	}
	fun isEmpty(): Boolean
	{
		if (this.isSize() > 0)
		{
			return false;
		}
		else
		{
			return true;
		}
	}
	// Add a new element in stack
	fun push(value: Int): Unit
	{
		// Make a new stack node
		// And set as top
		this.top = StackNode(value, this.top);
		// Increase node value
		this.count += 1;
	}
	// Remove a top element 
	fun pop(): Int
	{
		val value: Int = this.peek();
		if (this.isEmpty() == false)
		{
			this.top = this.top?.next;
			// Reduce the size
			this.count -= 1;
		}
		return value;
	}
	// Used to get top element of stack
	fun peek(): Int
	{
		if (!this.isEmpty())
		{
			return this.top!!.operand;
		}
		else
		{
			return 0;
		}
	}
}
class Execution
{
	fun evaluate(e: String): Unit
	{
		// Get the length of expression
		val size: Int = e.length;
		var a: Int ;
		var b: Int ;
		val s: MyStack = MyStack();
		var isVaild: Boolean = true;
		var i: Int = 0;
		// work with (+,-,/,*,%) operator
		while (i < size && isVaild)
		{
			if (e.get(i) >= '0' && e.get(i) <= '9')
			{
				a = e.get(i).toInt() - '0'.toInt();
				s.push(a);
			}
			else if (s.isSize() > 1)
			{
				a = s.pop();
				b = s.pop();
				// Perform arithmetic operations between 2 operands
				if (e.get(i) == '+')
				{
					s.push(b + a);
				}
				else if (e.get(i) == '-')
				{
					s.push(b - a);
				}
				else if (e.get(i) == '*')
				{
					s.push(b * a);
				}
				else if (e.get(i) == '/')
				{
					s.push(b / a);
				}
				else if (e.get(i) == '%')
				{
					s.push(b % a);
				}
				else
				{
					// When use other operator
					isVaild = false;
				}
			}
			else if (s.isSize() == 1)
			{
				// Special case  
				// When use +, - at the beginning
				if (e.get(i) == '-')
				{
					a = s.pop();
					s.push(-a);
				}
				else if (e.get(i) != '+')
				{
					// When not use  +,-
					isVaild = false;
				}
			}
			else
			{
				isVaild = false;
			}
			i += 1;
		}
		if (isVaild == false)
		{
			// Possible case use other operators
			// 1) When using special operators
			// 2) Or expression is invalid
			println(e + " Invalid expression ");
			return;
		}
		println(e + " = " + s.pop());
	}
}
fun main(args: Array < String > ): Unit
{
	val task: Execution = 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