1
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following statements is TRUE?

A
The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.
B
Symbol table is accessed only during the lexical analysis phase.
C
Data flow analysis is necessary for run-time memory management.
D
LR(1) parsing is sufficient for deterministic context-free languages.
2
GATE CSE 2022
Numerical
+1
-0

Consider the augmented grammar with {+, *, (, ), id} as the set of terminals.

S' $$\to$$ S

S $$\to$$ S + R | R

R $$\to$$ R * P | P

P $$\to$$ (S) | id

If I0 is the set of two LR(0) items {[S' $$\to$$ S.], [S $$\to$$ S. + R]}, then goto(closure(I0), +) contains exactly _________ items.

Your input ____
3
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+1
-0.33

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 option 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
4
GATE CSE 2020
Numerical
+1
-0
Consider the following grammar.

S $$ \to $$ aSB| d
B $$ \to $$ b

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is _______.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP