stack
Why use a stack-oriented language? [closed]
Stack orientation is an implementation detail. For example, Joy can be implemented using rewriting – no stack. This is why some prefer to say “concatenative” or “compositional”. With quotations and combinators you can code without thinking about the stack. Expressing yourself with pure composition and without locals or named arguments is the key. It’s extremely … Read more
How can I remember which data structures are used by DFS and BFS?
Queue can be generally thought as horizontal in structure i.e, breadth/width can be attributed to it – BFS, whereas Stack is visualized as a vertical structure and hence has depth – DFS.
What is a stack pointer used for in microprocessors?
A stack is a LIFO data structure (last in, first out, meaning last entry you push on to the stack is the first one you get back when you pop). It is typically used to hold stack frames (bits of the stack that belong to the current function). This may include, but is not limited … Read more
How does a stackless language work?
The modern operating systems we have (Windows, Linux) operate with what I call the “big stack model”. And that model is wrong, sometimes, and motivates the need for “stackless” languages. The “big stack model” assumes that a compiled program will allocate “stack frames” for function calls in a contiguous region of memory, using machine instructions … Read more
what is the basic difference between stack and queue?
Stack is a LIFO (last in first out) data structure. The associated link to wikipedia contains detailed description and examples. Queue is a FIFO (first in first out) data structure. The associated link to wikipedia contains detailed description and examples.