In Java:

Use a stack to implement a parenthesis parser.

The method isbalanced takes a string that can consist of a combination of $3$ types of

parenthesis: $\{\},[],().$ The method returns True if the expression is Balanced $($and False otherwise$)$

A balanced expression is an expression where all opening brackets are matched with a closing bracket of the same type, in the correct order.

Some balanced strings are:

$1.()$

$2.[()]$

$3.\{[()[]]\}$

$4.(\{\}[\{\}]())$

$5.$ The empty string

Some not balanced strings:

$1.($

$2.)($

$3.(\}$

$4.\{[]$

$5.[(]$

$6.\{\}[(])$

You can assume that all output strings has only the characters $\{,\},[,],(,)$ and spaces $($spaces should be ignored$)$