Play with a bottom up recognizer

Play with the bottom-up recognizer defined in here. 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 and aNbN.pl. I have also provided a file bottomup_recognizer_tests.pl which contains examples for you to cut-and-paste to help you test.

You can find an explanention of how the recognizer works here, and the answer to why it's so slow here

Back to lab 2.