Email or username:

Password:

Forgot your password?
Devine Lu Linvega

After twenty years of looking for a solution he said he
was very pleased to find one. He decided to make the
stacks circular. Stacks cannot overflow or underflow,
the wrap. He said, "Problem solved once and for all."

groups.google.com/g/comp.lang.

To the sound of Peaches' I Don't Give A

6 comments
(wryl)

@neauoire At one point in time, I was working on a few concatenative language projects and utilized a deque instead of a stack.

This let you treat the stack as a "tape" you could continuously expand, shift and manipulate, and "stack shuffling" became leagues easier.

At one point, I added quotations. Recursion and looping just placed the next loop iteration at the "bottom of the stack", and when required, just recalled it and executed it.

Quite elegant, for my purposes.

Devine Lu Linvega

@wryl Cool :) You had me look into deque, do you have any resource that might list special fun things that one can do with it?

(wryl)

@neauoire Oddly enough, it's pretty under-explored!

This presentation from 2018 makes the case for queues (not deques) instead of a stack.

web.archive.org/web/2018082917

(cont'd)

Go Up