SE547: BDDs: Implementing BDDs [13/22]

How can we convert this grammar into a class hierarchy?

s, t, u ::=
    0
    1
    x t, u

Hint: start with:

  interface BoolPred {
    BoolPred ite (BoolPred p, BoolPred q); // this -> p, q
    ...
    static final BoolPred T = ...;
    static final BoolPred F = ...;
  }