Hi Waqar,

1. The state table contains addresses (16 bits). The number of entries in this table will be the number of address bytes divided by two.

2. The call table function multiplies an index into the state table by two, basically converting a byte index into an address index. It then pushes this address retrieved from the table onto the stack, the RET then acts as a CALL to that address.

I thought Michael's comments were very clear...

I've recommended it before, but I'll recommend it again: try running code through a simulator to see what it does. Tom above did that. Have you??

(Beautiful piece of code Michael!)

Dennis