stack

I am making my own Lisp-like interpreted language, and I want to do tail call optimization. I want to free my interpreter from the C stack so I can manage my own jumps from function to function and my own stack magic to achieve TCO. (I really don't mean stackless per se, just the fact that calls don't add frames to the C stack. I would like to use a stack of my own that does not grow with tail calls). Like Stackless Python, and unlike Ruby or... standard Python I guess. But, as my language is a Lisp derivative, all evaluation of s-expressions is currently done recursively (because it's the

I'm new to C++ and am writing a multi-threaded app whereby different writers will be pushing objects onto a stack and readers pulling them off the stack (or at least pushing the pointer to an object).. Are there any structures built-into C++ which can handle this without adding locking code etc.? If not, what about the Boost libraries? EDIT: Hi. Thanks for the initial great answers. I guess one reason I thought this could be built-in was that I was thinking purely in x86 space and thought that a PUSH/POP of pointers should be an atomic action at the instruction level. I'm not sure if my

Is it possible to view the activity stack in Android for debugging purposes? To display the activity stack, run the following command : adb shell dumpsys activity activities 来源： https://stackoverflow.com/questions/4387875/view-activity-stack-in-android

Sometimes, I come across the following interview question: How to implement 3 stacks with one array ? Of course, any static allocation is not a solution. Space (not time) efficient. You could: 1) Define two stacks beginning at the array endpoints and growing in opposite directions. 2) Define the third stack as starting in the middle and growing in any direction you want. 3) Redefine the Push op, so that when the operation is going to overwrite other stack, you shift the whole middle stack in the opposite direction before Pushing. You need to store the stack top for the first two stacks, and

I've got my code working, it's not pretty but it doe's the job :) Now I want to write a piece of code that stops the data from being loaded if there is 19 or more pieces of data in the text file and then display a message saying Invalid input for example. I'm not sure how to do this so any help would be appreciated. package stackandqueue; import java.util.*; import java.util.Stack; import java.util.Queue; import java.io.BufferedReader; import java.io.FileNotFoundException; import java.io.FileReader; import java.io.IOException; import java.util.LinkedList; import java.util.StringTokenizer;

So i', trying to solve a task. a already have code, but system outs, "stack overflow" i'm new in c++ and my english isn't good so i'm sorry for misunderstanding =) #include <iostream> using namespace std; int main (){ int n; int x; int k = 0; // счетчик для рабочего массива int a [200000]; scanf("%d\n",&n); for (int i = 0; i< n; ++i){ std::cin >> x; if (x > 0){ k++; a[k] = x; }else if(x == 0){ for (int q = 1; q <= k; ++q){ // копирование a[k+q] = a[q]; } k *= 2; }else{ printf("%d %d\n",a[k],k); k--; } } system("pause"); } looks like algorithm works correctly, but only problem is stack. thanks