construct the parse tree for the following expression:E -> c E -> id E -> (E) E -> E + E E -> E * E
id * id + id
B -> 0 B | 1 B | 0 | 1formulate the equivalent FSA and regular expression.
  I -> a L | b L | c L | ... z L | a | ... y | z   L -> 1 L | 2 L | ... | 9 L | 0 L | 1 | ... 9 | 0 | a L | b L | c L | ... Z L | a | ... y | z
  S -> SS | (S) | ()
  A -> B | Cd
  bAd -> bBCd | bCAd
if (X > 0) X = X - 1; else X = X + 1;if the postcondition is {X > 10}.