Chapter 18, Problem 10PC

Program Plan Intro

Balanced Parentheses

Program Plan:

• Include required header files
• Declare function prototype
• Inside “main ()” function,
  • Declare a variable “strng”.
  • Get a string from the user.
  • Check if the Boolean function “is_Balanced ()” returns true.
    • If the condition is true then the string has balanced parentheses.
    • If the condition is not true then the string does not have balanced parentheses.
• In “is_Balanced ()” function,
  • Declare a Boolean variable “status”.
  • Create an object for stack.
  • Use for loop to step through each character in a string.
    • Use Switch…Case structure check the character has set of parentheses or not.
      • If left parenthesis is detected,
        • Push it into the stack using the function “push ()”.
      • If right parenthesis is detected,
        • Check if the stack is empty using the function “empty()”.
          • If the stack is empty then assign “false”
          • If the stack is not empty then assign “true”
  • Check if the stack is empty and assign “true”. Else, assign “false”.
  • Return the variable “status”.