Currently, when a tree is invalid in certain ways, the checker fails to give feedback on each node, and instead gives a single error for the whole tree. (Internally, this is because the conversion algorithm fails to convert it to a sequent proof, so the sequent checker cannot be called.)
When this happens, we should do something like highlighting the whole tree as an error, and displaying an error.
Even better would be to have the conversion algorithm return the node or row that is the cause of the error, and highlight that node or row specifically.
Currently, when a tree is invalid in certain ways, the checker fails to give feedback on each node, and instead gives a single error for the whole tree. (Internally, this is because the conversion algorithm fails to convert it to a sequent proof, so the sequent checker cannot be called.)
When this happens, we should do something like highlighting the whole tree as an error, and displaying an error.
Even better would be to have the conversion algorithm return the node or row that is the cause of the error, and highlight that node or row specifically.