Parsing Techniques GATE 2021 Question #612 with Solution

GATE 2021 · Set-1

Compiler DesignParsing TechniquesmediumMCQ1 mark

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^3)\) time to parse a string of length n. Which one of the following options is correct?

AS1 is true and S2 is falseBS1 is false and S2 is trueCS1 is true and S2 is trueDS1 is false and S2 is false

Save your progress

Related Compiler Design PYQs

GATE 2021 · Set-1

Consider the following statements. S1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree.…

GATE 2021 · Set-1

Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed …

GATE 2021 · Set-1

Consider the following context-free grammar where the set of terminals is {a,b,c,d,f}. S → d a T | R f T → a S | b a T | ε R → c a…

GATE 2021 · Set-1

Consider the following C code segment: a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f; In a compiler, this code segment is …

GATE 2021 · Set-2

Consider the following ANSI C program: ```c int main() { Integer x; return 0; } ``` Which one of the following phases in a sev…

GATE 2021 · Set-2

In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.

Related Compiler Design PYQs

Turn practice into measurable progress