Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following statements are TRUE? I. Top-down parsers are equipped to handle left recursive grammar. II. LALR parser is more powerful than an SLR parser. III. Recursive descent parsing is an example of top-down parsing.
Which of the following statements is/are correct? A. SLR parser is more powerful than LALR parser. B. Canonical LR parser is more powerful than LALR parser. C. LALR parser is more powerful than Canonical LR parser.
Which of the following statement(s) is/are FALSE? (i) The grammar S → Aa | bAc | dc | bda, A → d is LALR(1) but not SLR(1). (ii) The grammar S → Aa | bAc | Bc | bBa, A → d, B → d is LALR(1) but not LR(1).
Three statements are given followed by four conclusions numbered I, II, III and IV. Assuming that the statements are true even if they seem to be at variance from commonly known facts, decide which of the conclusions logically follows from the statements. Statements: 1. All carpets are beds. 2. Some tables are carpets. 3. All pillows are tables. Conclusions: I. All pillows are beds. II. Some pillows are beds. III. Some beds are tables. IV. All tables are beds.
Study the following information carefully and answer the questions that follows. 5 persons Anil, Bhagat, Ishan, Deepak and Parmish use 5 different apps namely, WhatsApp, Instagram, Twitter, Facebook and LinkedIn. They all wear different brands of shoes namely, Adidas, Reebok, Nike, Puma and Vans. The person who wears Puma shoes does not uses Facebook. Parmish wear Nike shoes and uses LinkedIn app. Anil who wear Adidas shoes but neither uses Facebook nor Twitter. Ishan neither wear Vans nor Puma shoes but he uses Twitter app. The person who uses WhatsApp doesn’t wear Adidas shoes. Bhagat uses Facebook app. Deepak wear which shoes brand, and also determine who uses Instagram?
LALR in LALR parser stands for:
S -> (S)| a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar n1 n2 and n3 respectively.
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true? I. L̅1 (complement of L1) is recursive II. L̅2 (complement of L2) is recursive III. L̅1 is context-free IV. L̅1 ∪ L2 is recursively enumerable
Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
Five tables T1, T2, T3, T4 and T5 are kept one above the other (Not necessarily in the same order) Number of tables above T4 are same as the number of tables below T5. T3 is just above T1. T5 is at the bottom. There are two tables between T2 and T5. Which of the following is the correct position of T1?