Parentheses_Checker/Parent_checker.java at master · visalrajeev/Parentheses_Checker · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
import java.util.*;

class Stack
{
  char data[] = new char[100];
  int top;

  public void initialize()
  {
    top = -1;
  }
  public boolean isEmpty()
  {
    if(top == -1)
    {
      return true;
    }
    return false;
  }
  void push(char c)
  {
    top++;
    data[top] = c;
  }
  public void pop()
  {
    top--;
  }
  public char peek()
  {
    char c = data[top];
    return c;
  }
  public void show()
  {
    for(int i=0;i<=top;i++)
    {
      System.out.println(data[i]);
    }
  }

}

public class Parent_checker
{
  public static void main(String args[])
  {
    Scanner sc = new Scanner(System.in);
    Stack s = new Stack();
    s.initialize();

    //String w = "[(])";
    System.out.println("Enter the expression:");
    String w = sc.nextLine();
    int flag = 1;

    for(int i=0;i<w.length();i++)
    {
      char c = w.charAt(i);
      if(c==')' || c=='}' || c==']')
      {
        if(s.isEmpty())
        {
          flag = 0;
          break;
        }
        else
        {
          if(c==')' && s.peek()=='(')
          {
            s.pop();
          }
          else if(c=='}' && s.peek()=='{')
          {
            s.pop();
          }
          else if(c==']' && s.peek()=='[')
          {
            s.pop();
          }
          else
          {
            flag = 0;
          }
        }
      }
      else
      {
        s.push(c);
      }
    }

    if(s.isEmpty() == true && flag == 1)
    {
      System.out.println("Balanced");
    }
    else
    {
      System.out.println("UnBalanced");
    }
  }
}