The token queues, all of which are three slots long and function identically, are implemented as short FIFOs. An example implementation of the queues is described in:
Queue implementation
Queue modification
Queue flushing.