public void BalancedParenthesisDemo()
{
try
{
//// string to store the expression
string expression;
Console.WriteLine("Enter the expression");
expression = Console.ReadLine();
//// self implemented Linked list
LinkedListClass brackets = new LinkedListClass();
foreach (char c in expression)
{
//// If open found its pushed
switch (c)
{
case '(':
brackets.Push(c);
break;
//// if closed parenthesis encountered it pops the open parenthesis
case ')':
switch (brackets.Pop())
{
case false:
Console.WriteLine("Already empty equation not balanced");
return;
}
break;
case '{':
brackets.Push(c);
break;
case '}':
switch (brackets.Pop())
{
case false:
Console.WriteLine("Already empty equation not balanced");
return;
}
break;
case '[':
brackets.Push(c);
break;
case ']':
switch (brackets.Pop())
{
case false:
Console.WriteLine("Already empty equation not balanced");
return;
}
break;
}
//// if stack empty then parenthesis are balanced
}
if (brackets.IsEmpty())
{
Console.WriteLine("The expression is balanced");
}
else
{
Console.WriteLine("The expression is not balanced");
}
}
catch (Exception e)
{
Console.WriteLine("Process could noit be comnpleted as " + e);
}
}
