I am learning recursion now in my programming class, and while I understand how to use recursion for things like factorials and backtracking algorithms, I've been trying to wrap my head around how a recursive acronym, such as PHP, would be iterated for quite some time know. How could one write a program to iterate the expansion of PHP n times?

EDIT: I need to clarify my question
PHP is a recursive acronym, stands for PHP: Personal home page. So if you were to expand PHP: Hypertext processor an infinite number of times, would it look like PHP:Hypertext Processor Hypertext processor hypertext processor... or soemthing different