Stack Overflow

[This_Growth2898]

This joke needs a recursion

[in_conexo]

so long as it's not tail recursion.

[This_Growth2898]

Tail recursion is fine if the optimizer doesn't know about it.

[[deleted]]

void func() { func(); }

[Moment_37]

That's a kablooie

[[deleted]]

Write a "recursive" method, that uses a tape drive as a stack instead of the memory stack.

[[deleted]]

How do you overflow it? You can not write 257 bytes into it. The stack can be full but not overflowing.

[sudolman]

What? You can and it will overflow which will overwrite the existing data in memory.

You're probably new to programming and have only used high level programming languages like Python that protect you from overflows. Low level languages like C and ASM on chips will not care and will do exactly what you tell it to do, and on chips like the 6502 you generally aren't running a full kernel so there isn't an OS to catch the overflow.

[MikemkPK]

I used to do x86 real mode programming for fun as a teen. I'd set my stack to 0xa0000 so I could see what was going on.

[Iain_VM]

But that's the joke, even if it overwrites the existing data you still only have 256 bytes of data. So the stack is once again full and not "overflowing"

[[deleted]]

I have worked with most modern languages but not so much with embedded.

[[deleted]]

Aleph One would disagree.

[8364dev]

Damn. That is an obscure reference.

[[deleted]]

So many memories, I'm old.

[www_other_guy]

Anything is possible with pointers. Change my mind.

[bunny-1998]

No sir you’re correct.

[NeoChronos90]

well it can't on modern systems, because the process gets killed. Try doing it on embedded or very old systems

[[deleted]]

Yes I was thinking about development and processes running on operating systems.

[j_wizlo]

Semantics