Indicate all the true statements from the following. For the claim about…

PYQ GATE 1991Modified — slightly modified from the official paper; see the solution

Indicate all the true statements from the following. For the claim about dynamic allocation, assume every data object has a fixed size, and there are no variable-size objects or explicit heap-allocation operations:

  1. A.

    Recursive descent parsing cannot be used for grammar with left recursion.

  2. B.

    The intermediate form the representing expressions which is best suited for code optimization is the post fix form.

  3. C.

    A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation.

  4. D.

    Although C does not support call by name parameter passing, the effect can be correctly simulated in C.

  5. E.

    No feature of Pascal violates strong typing in Pascal.

Attempted by 21 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…