i got a stack error when compiling it  oh well.
source is attached in case anyone wants to figure out what it would do (: note: i suggest you use sourcecoder or something of the like to view it.. since if you're viewing it on-calc you're going to have to scroll through about 40 lines of just sub()'s, and then 8 lines of just closing paranthesis. then you get to the alll the wonderful labels that make it possible.

there's a reason there are too many parantheses. that's because there are approximately 136 of them. at once. calling subroutines. trust me, i saw this comming.

Quote from: DJ Omnimaga on June 18, 2010, 09:17:23 pm

lol

Since this project started, I wished that floating point numbers support would only come after the first Axe program is uploaded on ticalc.org. I still have some bad memories of when I saw the very first ever BBC Basic language upload there.

Anyway back on topic, I assume the r1 through r6 stuff can be used inside sub() commands too, right? (such as sub(AB,r6,C)

Sure. Just be aware that they are stored in order, like:
r6->r1
C->r2

So if you do sub(AB,r2,r1)
it does
r2->r1
r1->r2
which is the same thing as doing sub(AB,r2,r2).

Basically, don't try to use r1 after the first argument, r2 after the second argument, etc.

Aaah ok thanks for the info.

According to the Documentation:
ERR: STACK FULL There are too many parenthesis in a single expression.
Count your parentheses, you probably messed up somewhere.

Nah it's because there is a limit on the amount of nested parhenteses. I forgot how many, though.

LOL! Somebody actually got a stack error!    I didn't think that would ever happen.  I guess I will expand the maximum stack size a little bit.  Subroutines with arguments use 3 bytes of stack instead of 1 becasue they need to keep track of the name as well.  Some operations need 2 bytes in stack but most need 1.  The current maximum stack size is 64 bytes, If I have room, I will expand it to 128 bytes.  The operation stack is never searched through so that won't cause any slow downs during compiling.

LOL! Somebody actually got a stack error!    I didn't think that would ever happen.  I guess I will expand the maximum stack size a little bit.  Subroutines with arguments use 3 bytes of stack instead of 1 becasue they need to keep track of the name as well.  Some operations need 2 bytes in stack but most need 1.  The current maximum stack size is 64 bytes, If I have room, I will expand it to 128 bytes.  The operation stack is never searched through so that won't cause any slow downs during compiling.

oh wow as I started reading your post, I was about to reply to not worry too much because I doubt anyone would use this much of the stack, but then I continued, and I did not realize the stack was that smalll :O . Well I guess 128 bytes would probably be a good idea, providing you can find the space for it

probably not. if a sub( argument is 3 bytes.. and there are 130+ subs called as arguments to each other... you'd need about 400 bytes to contain it.

Do you think increasing the stack size to 128 is a good idea? What are the disadvantages?  Is it only memory?  Does it cost any speed?

I think this is the parser's stack he's talking about, it has no effect on the compiled program execution.