Page 406 - AP Computer Science A, 7th edition

public static void stackWords() {
String word = IO.readString(); input
if (word.equals(“.”))
System.out.println(); else
stackWords(); System.out.println(word);
}
public static void main(String args[]) {
//read user
System.out.println(“Enter list of words, one per line.”);
System.out.println(“Final word should be a period (.)”);
stackWords(); }
}
Here is the output if you enter
hold my hand .
You get
.
hand my hold
The program reads in a list of words terminated with a period, and prints the list in reverse order, starting with the period. How does this happen?
Each time the recursive call to stackWords() is made, execution goes back to the start of a new method call. The computer must remember to complete all the pending calls to the method. It does