Bissoy.com
Doctors Medicines MCQs Q&A

In the correct grammar above, what is the length of the derivation (number of steps starting from S to generate the string a l b m with l ! m?

In the correct grammar above, what is the length of the derivation (number of steps starting from S to generate the string a l b m with l ! m? Correct Answer max (l, m) + 2

It is very clear from the previous solution that the no. of steps required depend upon the no. of a’ s & b ‘ s which ever is higher & exceeds by 2 due to S ” AC CB & C “! So max(l , m) + 2.

Related Questions

Select the correct differences between char and varchar data types? i. varchar is non unicode and char is unicode character data type ii. char is ‘n’ bytes whereas varchar is actual length in bytes of data entered in terms of storage size iii. varchar is variable in length and char is the fixed length string iv. For varchar, if a string is less than the maximum length then it is stored in verbatim without any extra characters while for char if a string is less than the set length it is padded with extra characters to equalize its length to given length
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?
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)?  
The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?
A, B and C participated in a race. A covers the same distance in 49 steps as B covers in 50 steps and C covers in 51 steps. A takes 10 steps in same time as B takes 9 steps and C takes 8 steps. Who is the winner of the race?
A man walks 60 steps in a minute when he has energy. He walks 30 steps per minute when he is tired. He has to go to a place 300 steps away. If he can walk 120 steps without getting tired, what is his average walking speed (steps per minute) for his back and forth journey if he takes rest after reaching the place and again walks 120 steps with energy.
Three cats are roaming in a zoo n such a way that when cat A takes 5 steps, B takes 6 steps and C takes 7 steps.But the 6 steps of A are equal to the 7 steps of B and 8 steps of C. what is the ratio of their speeds?
How many objects will be created? String a = new String("Examveda"); String b = new String("Examveda"); String c = "Examveda"; String d = "Examveda";
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.