EECS20N: Signals and Systems

Parsing

Consider the predicate S = (P ∨ ⌉ (Q R)) ∧ (Q ⌉ (P)). We can tell if it is a well-formed expression by parsing it using matching parentheses and syntax to get the following parse tree: