The context-free grammar S  A111|S1, A  A0|00, using only its nonrecursive…

HPSC Teaching and Computer Science 2022Modified — slightly modified from the official paper; see the solution

The context-free grammar S  A111|S1, A  A0|00, using only its nonrecursive productions, is equivalent to

  1. A.

    {0ⁿ1ᵐ | n = 2, m = 3}

  2. B.

    {0ⁿ1ᵐ | n = 1, m = 5}

  3. C.

    {0ⁿ1ᵐ | n > 2, m > 4}

  4. D.

    {0ⁿ1ᵐ | n < 4, m < 3}

Attempted by 113 students.

Sign up free to check your answer

Sign up free

Explore the full course: Bpsc

Loading lesson…