Consider the following statements. S1: Every SLR(1) grammar is unambiguous but…

GATE · 2021 · CS · Set 1 · Computer Science & IT

Consider the following statements.

S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).

S2: For any context-free grammar, there is a parser that takes at most O(n3)O(n^3) time to parse a string of length nn.

Which one of the following options is correct?

  1. A.

    S1 is true and S2 is false

  2. B.

    S1 is false and S2 is true

  3. C.

    S1 is true and S2 is true

  4. D.

    S1 is false and S2 is false

Attempted by 335 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…