Bihar STET – TOC Practice Test | Set 3 ⋆ CSE Study247

Bihar STET – TOC Practice Test | Set 3

Questions 31-35 of 100

0% completed (0/100 answered)

Question 31

MCQ · Single Correct 1 mark

In DPDA definitions, what does the 'Prefix Property' guarantee for a language L?

A No valid string in L is a proper prefix of any other string in L B All strings have equal length C All strings are palindromes D Every string starts with 'a'

Question 32

MCQ · Single Correct 1 mark

What is the deterministic parsing table property required for a grammar to be LL(1)?

A $No \epsilon productions allowed$ B For every non-terminal A and terminal 'a', parse table entry M[A, a] contains AT MOST ONE production rule C Table entries can contain 2 rules D Grammar must be in CNF

Question 33

MCQ · Single Correct 1 mark

If a grammar G contains a Left-Recursive rule, can G be LL(1)?

A No! Left-recursive grammars are NEVER LL(1) because they cause infinite loops in top-down lookahead selection B Only if regular C Yes, if left-factored D Yes, always

Question 34

MCQ · Single Correct 1 mark

In LR(0) parsing, what causes a 'Shift-Reduce' conflict in an item set?

A An item set containing both a shift item (A → $\alpha$. a $\beta$) and a reduce item (B → $\gamma$.) B Two reduce items C An $\epsilon item$ D Two shift items

Question 35

MCQ · Single Correct 1 mark

In LR(0) parsing, what causes a 'Reduce-Reduce' conflict in an item set?

A Two shift items B An item set containing AT LEAST TWO distinct complete reduce items (A → $\alpha$. and B → $\beta$.) C Initial item D A shift item and reduce item