Consider strings of balanced parentheses. These are strings consisting of symbols (and ). They are defined recursively as follows: Basis. The empty string ? is a string of balanced parentheses. Induction. If x and y are strings of balanced parentheses, then (x) y is also a string of balanced parentheses