Question

need help with balancing brackets in python. I don't really understand it much.

For this exercise, you must write a function called balanced brackets brackets in the string, that is: '(' , ') and >', are correctly balanced. This function will be passed a string as an input, and you must check that any parentheses or angled Here are a few examples of strings where brackets are correctly balanced: a (<bcd>ef)g abcde a (b)c<<d>e(fg) and here are a few examples where the brackets are not balanced: ab(cde abc)def<g ab)c Your balanced brackets) function should return True if the input string is balanced, and False otherwise. Remember, you can assume that an implementation of the Stack ADT is available to you. It is therefore likely that your function definition will begin as follows: def balanced_brackets (text) Stack ) For example: Test Result print(balanced brackets((<x)(O)0)) True print (balanced brackets('x(y)z)) True

an unbalanced one will look like this: (<x)>(())()

Answer 1

'''

Python version : 3.6

Python program to create a function balanced_brackets that returns

if the brackets in a given expression are balanced or not

'''

def balanced_brackets(text):       

               s = Stack() # create s an object of Stack

               # loop over the characters in text

               for ch in text:

                             

                              if ch == '(' or ch == '<':

                                             s.push(ch) # assuming Stack has a method push that inserts an element on top of stack

                              elif ch == ')': # if ch = )

                                             # check if stack is empty or the top element of stack != ( the return false

                                             # assuming Stack has a method isEmpty that returns True of stack is empty

                                             # assuming Stack has a method pop() that removes and returns the top element of the stack

                                             if(s.isEmpty() or s.pop() != '('):

                                                            return False

                              elif ch == '>': # if ch = >

                                             # check if stack is empty or the top element of stack != < the return false

                                             # assuming Stack has a method isEmpty that returns True of stack is empty

                                             # assuming Stack has a method pop() that removes and returns the top element of the stack

                                             if(s.isEmpty() or s.pop() != '<'):

                                                            return False

              

               # if stack is not empty, return False

               if not s.isEmpty():

                              return False

                             

               return True # brackets are balanced

#end of program

Code Screenshot:

' ' Python version: 3.6 Python program to create a function balanced brackets that returns if the brackets in a given expression are balanced or not def balanced_brackets (text): S = Stack() # loop over the characters in text for ch in text: # if ch is ( or <, push it to stack if ch == '(' or ch == '<': s.push(ch) # assuming Stack has a method push that inserts an element on top of stack elif ch == ')': # if ch = ) # check if stack is empty or the top element of stack != ( the return false # assuming Stack has a method isEmpty that returns True of stack is empty # assuming Stack has a method pop () that removes and returns the top element of the stack if(s.isEmpty() or s.pop() != '('): return false elif ch == '': # if ch = > # check if stack is empty or the top element of stack != < the return false # assuming Stack has a method isEmpty that returns True of stack is empty # assuming Stack has a method pop() that removes and returns the top element of the stack if(s.isEmpty() or s.pop() != '<'): return False # if stack is not empty, return false if not s.isEmpty(): return false return True # brackets are balanced