"Stack Folding Problem"

[The Encapsulator]

I have been assigned this home task to Google and study "Stack Folding Problem" in my Data Structures and Algorithms course.

I have looked for it on Google but all I can find is code folding problem, which I think is no way relevant.

Any help/resource regarding "Stack Folding Problem" will be appreciated. Thanks in advance.

[Duthomhas]

http://www.google.com/search?q=stack+operations+folding+in+java+processors

Your professor should know that this kind of information will require money to access on your own... You need to use your University library's resources.

[JLBorges]

Search with Stack Folding in quotes, and with an added interpreted language name.

For example: http://www.google.com/search?q=%22stack+folding%22+java

AFAIK, (and my knowledge about Java is close to absolute zero), it is code folding alright. Interpreted byte code is executable code for a (non-jitting) virtual machine, but just data placed on the stack for the real machine.

[Duthomhas]

"code folding" is typically the code word for an IDE technique that shows or hides sections of source code while you are working on it.

"stack folding" is a technique to remove the stack from code in order to optimize it. (A lot of stack-machine code is composed of a significant number of push/pop operations on the stack. An intelligent byte-code machine should try to reduce that as much as possible.)

I'm not so sure this kind of thing is appropriate for the course level you are working at. Are you implementing an interpreter of some sort in class?