Recursive Descent

ree-kur-siv dih-sent

Definition

A programming method where a function keeps calling itself, like a never-ending game of digital 'Simon Says.'

Etymology

From the process of a function calling itself in a descending manner.

Usage Example

This recursive descent is like a 'Inception'; I'm lost in layers of function calls,' exclaimed Sam, staring at the nested functions.