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(n³) time to parse a string of length n.

Which one of the following options is correct?
(A) S1 is true and S2 is false
(B) S1 is false and S2 is true
(C) S1 is true and S2 is true
(D) S1 is false and S2 is false


Answer: (C)

Explanation: Types of Parsers :

Statement (S1) is correct.

Using CYK algorithm we can test the membership problem of CFG. It takes at most O(n³) time to parse a string of length n.

Statement (S2) is also correct.


Quiz of this Question

Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.