http://sc.cemetech.net/?hash=NJPxmyQun2YEDpRp75Anr+IOzUuM

I'm currently trying to write a small full-scale RSA implementation (yes, it's going to be horribly slow).
The problem lies in the BIGINT program, which is my library for big-number operations.

I've found out that despite it being seemingly impossible to happen, BI is jumped to twice.
You can test this behavior by running the program BITEST and waiting for it to pause with the text "BI" (line 35 in BIGINT).

Press Enter, and after a short while and loads of debug output it pops again. How?!

You fell for the trap where the return value from a program is in Ans. Look at how the Addition method operates.

Yes, it stores something in Ans.
But the jumps are at the beginning of the program, so I don't think that's the case.

You need a then/end statement around the

Code:

<expanding on the above post>
because a : is equivalent to a newline, so your current code looks like this to the compiler:

Code:

which leads to unintended behavior.

The compiler doesn't really care about how things are visually laid out, and it executes (from what I know) token-by-token.

As Mateo said, the correct code is as follows:

Code: