Bissoy.com
Doctors Medicines MCQs Q&A

With reference to the process of conversion of a context free grammar to CNF, the number of variables to be introduced for the terminals are: S->ABa A->aab B->Ac

With reference to the process of conversion of a context free grammar to CNF, the number of variables to be introduced for the terminals are: S->ABa A->aab B->Ac Correct Answer 3

According to the number of terminals present in the grammar, we need the corresponding that number of terminal variables while conversion.

Related Questions

Which one of the following is the correct sequence of various stages of operating cycle of a manufacturing company?  1. Raw material conversion period, work-in-progress conversion period, Finished goods conversion period, Receivables conversion period 2. Raw material conversion period, work-in-progress conversion period, Creditors payment period, Receivables conversion period 3. Creditor payment period. Raw material conversion period, Receivables conversion period, work-in- progress conversion period 4. Raw material conversion period, Finished goods conversion period, work-in- progress conversion period. Receivables conversion period 
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)?  
Let L1, L2 be any two context-free languages and R be any regular language. Then which of the following is/are CORRECT? I. L1 ∪ L2 is context-free II. L̅1 is context-free III. L1 – R is context-free IV. L1 ∩ L2 is context-free
Which grammar rules violate the requirement of the operator grammar? A, B, C are variables and a, b, c are terminals. i. A → BC ii. A → CcBb iii. A → BaC iv. A → ε
L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying |t|>=n, there are strings u, v, w, x, y and z satisfying t=uvwxy. Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p is
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).
Consider the following languages L1 = {ap | p is a prime number} L2 = {anbmc2m | n ≥ 0, m ≥ 0} L3 = {anbnc2n | n ≥ 0} L4 = {anbn | n ≥ 1} Which of the following are CORRECT? I. L1 is context-free but not regular. II. L2 is not context-free III. L3 is not context-free but recursive. IV. L4 is deterministic context-free
Which of the following statement(s) is/are FALSE? (i) Language L1 = {anbmcndm, n ≥ 0, m ≥ 0} is not context free grammar. (ii) Language L2 = {anbncn, n ≥ 0} is a context free grammar.
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. 
Let G be a grammar: S->AB|e, A->a, B->b Is the given grammar in CNF?