Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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)?  
Which of the following statements is/are TRUE? (a) The grammar S → SS | a is ambiguous. (Where S is the start symbol) (b) The grammar S → 0S1 | 01S |e is ambiguous. (The special symbol e represents the empty string) (Where S is the start symbol) (c) The grammar (Where S is the start symbol) S → T / U T → x S y | xy | ϵ U → yT generates a language consisting of the string yxxyy.
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
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. 
A teacher in her grammar class introduces the grammar item in a text and in single sentences and draws the attention of learners to its use through lots of examples and activities by learners. Once the learners are able to use the language item in context, she familiarizes the rules of the grammatical in order to internalize the form. What is this process of teaching-learning grammar known as?
Context free grammar is called Type 2 grammar because of ______________ hierarchy.
Consider the following statements about the context-free grammar: \(G={\{S→SS,S→ab,S→ba,S→ϵ}\}\) I. G is ambiguous II. G produces all strings with equal number of a’s and b’s III. G can be accepted by a deterministic PDA Which combinations below expresses all the true statements about G?
Are ambiguous grammar context free?