...

/

Parsing a Boolean Expression

Parsing a Boolean Expression

Try to solve the Parsing a Boolean Expression problem.

Statement

You are given a string, expression, that represents a boolean expression. The expression can take one of the following forms:

  • 't': Represents the boolean value TRUE.

  • 'f': Represents the boolean value FALSE.

  • '!(expr)': Represents a NOT operation applied to a subexpression expr. It returns the logical negation of expr.

  • '&(expr1, expr2, ..., exprN)': Represents an AND ...