In this assignment, you are using Array to implement the Stack, with Push and Pop operation and any other operations that you might need.

You can use Java's Stack class OR define your own Stack.

Use your Stack class to match balanced parentheses, brackets, and braces. For example, input string "{ ( [ ] ) [ ( ) ] } should return TRUE, and "( ( [ ] [ ) { } ) should return FALSE.

I suggest implementing this by creating a Stack, pushing a (or [or {onto the stack whenever one of those characters is seen, and popping it off when the corresponding closing character is seen. If the wrong character is at the top of the stack, the parentheses do not match, and the method should return false.

Test your program with several inputs. Some results will be TRUE (balanced) and some will not be True (not balanced).

Use appropriate error messages; stack-full, stack-empty, and so on.

Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.