7.6 Practical Session

Play with the bottom-up recognizer defined in bottomup_recognizer.pl. Make sure you thoroughly understand how it works. In particular, make sure you understand

the way append/3 is used to divide the input list into three sublists;
why it is so slow!

I have provided two grammars for you to test it with, namely: ourEng.pl (the English grammar we discussed in the lecture) and aNbN.pl (which generates $a^nb^n\backslash\{\}$ ). I have also provided a file bottomup_recognizer_tests.pl which contains examples for you to cut-and-paste to help you test.