Bissoy.com
Doctors Medicines MCQs Q&A

Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has LR(1) grammar Which of the following is TRUE?

Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has LR(1) grammar Which of the following is TRUE? Correct Answer Both P and Q are true

LL(1) parsers can recognize the regular grammars also LL(1) is subset of LR(1) or CLR grammar so it also recognizes regular sets. So both accept regular grammar.

Related Questions

In the following question, two statements are given each followed by two conclusions I and II. You have to consider the statements to be true even ifthey seem to be at variance from commonly known facts. You have to decide which of the given conclusions, if any, follows from the given statements. Statements:
(I) Empty set is a subset of any set.
(II) A set is a subset of power set. Conclusion:
(I) Empty set is a power set.
(II) A set is a subset of power set.
Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
Which of the following statements are true of the teaching of grammar. A. Teaching of rules at the initial stage does not lend much to language learning. B. Rules of grammar are essential during the formative years of language learning. C. Grammar teaching should move from meaning to form. D. Grammar teaching should move from form to meaning. 
Language L1 is defined by the grammar: S1 → aS1b|ϵ Language L2 is defined by the grammar: S2 → abS2|ϵ Consider the following statements: P: L1 is regular Q: L2 is regular Which one of the following is TRUE?
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which of the following decision problems are undecidable? I. Given a regular expression R and a string w, is w ∈ L(R)? II. Given a context-free grammar G, is L(G) = ϕ? III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑? IV. Given a Turing machine M and a string w, is w ∈ L(M)?  
The logic problems in this set present you with three true statements: Fact 1, Fact 2 and Fact 3. Then you are given three more statements (labelled I, II, III), and you must determine which of these, if any, is also a fact. One or two of the statements could be true; or none of the statements could be true. Fact 1: Jessica has four children. Fact 2: Two of the children have blue eyes and two of the children have brown eyes. Fact 3: Half of the children are girls. If the fist three statements are facts, which of the following statement/(s) must also be a fact? I. At least one girl has blue eyes. II. Two of the children are boys. III. The boys have brown eyes. Choose the correct answer from the options given below:
Consider the following statements: 1. The null set is a subset of every set. 2. Every set is a subset of itself. 3. If a set has 10 elements, then its power set will have 1024 elements. Which of the above statements are correct?
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. Which one of the following choices is correct?
Consider the following statements: (1) If n ≥ 3 and m ≥ 3 are distinct positive integers, then the sum of exterior angles of a regular polygon of m sides is different from the sum of exterior angles of regular polygon of n sides (2) Let m, n be integers such that m > n ≥ 3. Then the sum of the interior angles of regular polygon of sides is greater than the sum of interior angles of a regular polygon of n sides, and their sum is (m + n)π/2 Which of the above statements is/are correct?
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) actions, given as pseudo-code: P → D* E* D → int ID {record that ID.lexeme is of type int} D → bool ID { record that ID.lexeme is of type bool} E → E1 + E2 {check that E1.type = E2.type = int; set E.type := int} E → !E1 {check that E1.type = bool; set E.type := bool} E → ID {set E.type := int} With respect to the above grammar; which one of the following choices is correct?