Question

Don't know how to write the code to check the braces and matching combinations(in Java)

modify the lab below to include () as balanced pair
this means your program should check balances for {{(())}} or any pattern.

Once complete, write a program to test the method

Class name: BalancedBraces

Using recursion

Your program will check to see if braces are balanced.

For example {} is balanced { is not.

Your program will accept a string as such {}{{}{}{ and returns true or false if the braces are balanced

Ask the user to enter the brace combos.

Print balanced or unbalanced.

Answer 1

The solution of the given problem is below:

The screenshot of the ocode is below:

The screenshot of output  is below:

  

code :

import java.util.*;
import java.lang.*;
import java.io.*;

class BalancedBraces {
   public static void main (String[] args) {
       Scanner s=new Scanner(System.in);
       System.out.println("Enter braces as string:");
       String st=s.next();
       Stack<Character> stak=new Stack<>();
       int flag=1;
       for(int i=0;i<st.length();i++){
       char c=st.charAt(i);
       if(c=='(' || c=='[' || c=='{'){
       stak.push(c);
       }
       else if((!stak.empty()) &&
       ((c==')' && stak.peek()=='(')||
       (c==']' && stak.peek()=='[')||
       (c=='}' && stak.peek()=='{')))
       stak.pop();
       else{
       flag=0;
       break;
       }
       }
       if(flag==1 && stak.empty())
       System.out.println("balanced");
       else
       System.out.println("not balanced");
   }
}

Please upvote in case of any doubts comment me freely.