As Shazz asked, can you please post
all related code to the problem, also if there are any error messages at a later stage post the exact message.
As for why lines 9-29 don't run that is because there is nothing in the
items table, thus the loop never needs to run, so it doesn't. You will need to populate the table on line 2, not just create it.
Also as opposed to recursively calling
receive i.e.
function receive()
--# some code
receive()
end
receive()
you should use loops
function receive()
--# some code
end
while true do
receive()
end
Using the recursive way your program will error after ~256 times of running with a stack overflow. Using loops is the way to not have this happen.
To expand on what I said previously recursion is bad to use as it can quite rapidly fill up the function stack. The function stack contains all the functions that have been called since the stack was created, and in CC this stack has a size limit of 256 entries. A stack is first in last out (FILO) meaning that has we call each function it gets
pushed onto the stack, and must be
popped off the stack before we can get to the entry below it. This is when a function completes it is
popped off the stack so the previous function can continue from where it was. So knowing this when we call 256 functions (within one another) we will get a stack overflow. To avoid this we must allow the function to return, where possible, before calling another function.
To put a real world example for a stack. Lets think of a bunch of books. You're reading book 1 when it suddenly tells you that you must start reading book 2 before continuing. So you put book 1 aside (push onto the stack) and open book 2. As you're reading through book 2 it tells you that you must go to book 3 and read that book before continuing, so you put that book on top of book 1 in the pile (push book onto the stack) and open book 3. This process continues for another 4 books, which each in turn you put on the top of the pile. Once you have completed book 7 you close it and take book 6 off the top of the pile (pop off the stack), you then continue to read book 6 to the end, close it, and take book 5 off the pile on continue to read this book to the end. This repeats until eventually you're back to book 1 and the pile (stack) is empty. Now a stack overflow, think of that as you have too many books in the pile and it falls over. Also of course, if you're reading book 23 and then suddenly want to read book 4, well you cannot do that without first taking each book off the pile until you get down to book 4. The same rule applies to stacks.
