Question 42 A grammar that is both left and right recursive for a non-terminal, is A Ambiguous B Unambiguous C Information is not sufficient to decide […]

Question 2 Which one of the following statements is FALSE? A There exist context-free languages such that all the context-free grammars generating them are ambiguous B […]

Question 24 Consider the following languages. L1 = {wxyx | w,x,y ∈ (0 + 1)+} L2 = {xy | x,y ∈ (a + b)*, |x| = […]

Question 23 Which of the following statements is/are TRUE? A Every subset of a recursively enumerable language is recursive. B If a language L and its […]