The general process is that for each rule we convert it into a hyper-path and then add the hyper-path into a hyper-tree incrementally.
finally we discuss the top-down rule matching algorithm between forest and hyper-tree.