This project tests your knowledge of some more low level Prolog programming techniques which are important for efficiency.
All answers are to be writtten in NU-Prolog.
Please take care to use the right procedure names, etc. Answers should be e-mailed to Lee on or before Monday November 5th. If you use a Mime attachment, please use your login name with a .nl extension as the file name. The following code can be used as a simple declarative debugger. It searches a tree and returns the first node found which is buggy , that is, the node is erroneous but has no erroneous children.