You lucky people! Here is some more free information - a complete solution to the problem posed earlier, in fact.
A complete Forth-like assembler, incorporating the suggested approach, has been supplied to you in a later version of the examination kit (FREE2J.ZIP or FREE2C.ZIP for the Java or C# versions).
Much of this code should be familiar, and hopefully is fairly similar to that which you should have developed earlier today. To prepare yourself to answer Section B of the examination tomorrow, you are encouraged to study it in depth. Questions in Section B will probe this understanding, but we are giving few hints as to what to expect, other than that you might be called on to comment on the solution, and perhaps to make some modifications and extensions. During the examination you will receive a machine readable exam "kit" with this same code and some example assembler programs, as well as listings of the relevant parts of the system which can be used and handed in with your answer book.
As before, you are quite at liberty to experiment with the system and to discuss it with your prac partners, but not with staff or demonstrators.
In particular, spend some time thinking how any other ideas you had during the first part of today would need modification to fit in with the solution kit presented here.
You will receive listings of relevant parts of the attributed grammar and support files tomorrow, a copy in machine-readable form, and machine readable copies of the questions themselves.
A copy of the grammar document is available now, but you may not bring this copy to the exam!
I have a vivid imagination. Do you?
Have fun!