BPSC TRE – Compiler Design | Full-Length Test-1 ⋆ CSE Study247

Question 26

MCQ · Single Correct 1 mark

Previous Year Question BPSC TRE 2.0 Class 11-12 PYQ PYQ

[BPSC TRE 2.0 Class 11-12 PYQ] Which parser family can handle left-recursive grammar productions without the left-recursion problem that affects top-down LL parsing?

A (A) LL(1) Grammars B (B) Recursive Descent Parsers without backtracking C (C) LR(1) Grammars D (D) More than one of the above E (E) None of the above

Question 27

MCQ · Single Correct 1 mark

What does the notation 'LL(k)' stand for in top-down parser classification?

A (A) Left-to-right scan, Rightmost derivation, k lookahead tokens B (B) Linear scan, Loop-free derivation, k states C (C) Left-to-right scan, Leftmost derivation, k lookahead tokens D (D) More than one of the above E (E) None of the above

Question 28

MCQ · Single Correct 1 mark

What does the notation 'LR(k)' stand for in bottom-up parser classification?

A (A) Linear Reduction, k lookahead tokens B (B) Left-to-right scan, Rightmost derivation in reverse, k lookahead tokens C (C) Left-to-right scan, Leftmost derivation in reverse, k lookahead tokens D (D) More than one of the above E (E) None of the above

Question 29

MCQ · Single Correct 1 mark

In bottom-up parsing, what is a 'Handle'?

A (A) The top symbol of the parser stack B (B) A terminal symbol lookahead C (C) A production rule A -> b and a position in the right sentential form where b matches and can be reduced to A D (D) More than one of the above E (E) None of the above

Question 30

MCQ · Single Correct 1 mark

Which condition indicates that a grammar G is ambiguous?

A (A) A single string w in L(G) has two or more distinct leftmost derivations B (B) A single string w in L(G) has two or more distinct parse trees C (C) A single string w in L(G) has two or more distinct rightmost derivations D (D) More than one of the above E (E) None of the above