basic-programs/java/Balanced_Paranthesis.java at master · ProjectRipo/basic-programs · GitHub

38 lines (35 loc) · 1.17 KB

public class ParenthesisMatching

{

public static void main(String[] args)

{

Scanner scan = new Scanner(System.in);

/* Creating Stack */

Stack<Integer> stk = new Stack<Integer>();

System.out.println("Parenthesis Matching Test");

/* Accepting expression */

System.out.println("Enter expression");

String exp = scan.next();

int len = exp.length();

System.out.println("\nMatches and Mismatches:");

for (int i = 0; i < len; i++)

{

char ch = exp.charAt(i);

if (ch == '(')

stk.push(i);

else if (ch == ')')

{

try

{

int p = stk.pop() + 1;

System.out.println("')' at index "+(i+1)+" matched with ')' at index "+p);

}

catch(Exception e)

{

System.out.println("')' at index "+(i+1)+" is unmatched");

}

while (!stk.isEmpty() )

System.out.println("'(' at index "+(stk.pop() +1)+" is unmatched");

}

Expand file tree