Computer Sciences > GATE 2021 SET-1 > Formal Languages and Automata Theory
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
Both S1 and S2 are true.
D
Both S1 and S2 are false.

Correct : c

Similar Questions

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-fre...
#1016 MCQ
Consider the following language.L = {w ∈ {0, 1}* | w ends with the substring 011}Which one of the following deterministic finite automata accepts L?
#1038 MCQ
Consider the following statements.S1: For every infinite regular language L, there exists a subset L′ of L such that L′ is infinite and context-free.S2: For eve...
#1053 MSQ

Related Topics

SLR(1) grammar unambiguous grammars context-free grammar parser time complexity GATE Computer Sciences 2021 GATE CS 2021 Set 1 Q49 compiler design parsing algorithms

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: