Exercise 6.7

As we said in Section 6.7, we need a pretty printer that translates list representations of parses (like [s, [np, [pn, vincent]], [vp, [tv, shot], [np, [pn, marsellus]]]]) to trees. As an example, see a pretty printer for so called semantic tableaux that was written in Prolog. Just select some example from the boxes and then click on "send". Here, the output is a html-table. Write some pretty printer for the parses we have seen before (it might also produce latex or plain ascii or whatever format you like).