Skip to content
Related Articles

Related Articles

GATE | GATE CS 2021 | Set 1 | Question 15

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 01 Sep, 2021

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

Statement (S2) is also correct.




Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!