Definitional Trees : Coding Phase - Approach to implement flexible Expression replace feature

Hello all,

My mentor and I had a detailed discussion on how to implement a flexible and robust mechanism to "replace" an Expression. This was particularly needed in the H method. We decided to implement a wrapper class around Expressions called "Box". Any replacement will happen to this Box object which will corresspondingly reflect to other expressions using that Box.

I will be implementing this idea soon. After this, the next set of tasks include-

  1. Implement the N method for a Definitional Tree
  2. Make the compile method to produce the H function as output
  3. Implement H for Variable and Choice