Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following is false for a grammar G in Chomsky Normal Form:

Which of the following is false for a grammar G in Chomsky Normal Form: Correct Answer None of the mentioned

G, a CFG is said to be in Chomsky normal form if all its productions are in one of the following form: A->BC or A->a

Related Questions

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. 
Given grammar G: (1)S->AS (2)S->AAS (3)A->SA (4)A->aa Which of the following productions denies the format of Chomsky Normal Form?
Every grammar in Chomsky Normal Form is:
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?
Arul Rahul, a teacher in his grammar class introduces rules of the grammar item, voice and tenses first and makes them understand how the form behaves and how to use it contexts. He then gives lots of tasks for learners to practice the language item. What is this process of teaching-learning grammar known as?
A teacher in her grammar class introduces rules of the grammar first and makes them understand how the form behaves and how to use it in contexts. She then gives lots of tasks for learners to practice the language item. What is this process of teaching-learning grammar is known as? 
Consider the following grammar G: P → Q + R | Q – R | Q | R Q → q | r R → r | s where P, Q, and R are non-terminal symbols, and q, r, and s are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar G
Consider the following grammar G S → F | H F → p | c H → d | c Where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct? S1. LL(1) can parse all strings that are generated using grammar G S2. LR(1) can parse all string that are generated using grammar G
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 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)?