Multiple choice

_____ is used in compilers in passing an expression by recursion.

  1. Stack

  2. Queue

  3. Circular queue

  4. None of these
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Stacks are fundamental to recursive expression evaluation in compilers. Each recursive call pushes a new activation record containing local variables and return addresses. The Last-In-First-Out (LIFO) nature of stacks matches the call-return pattern of recursion.

Keep practicing — related questions