adplus-dvertising
frame-decoration

Question

The equivalent grammar corresponding to the grammar G:S→aA,A→BB,B→aBb∣εG:S→aA,A→BB,B→aBb∣ε is

a.

S→aA,A→BB,B→aBb

b.

S→a∣aA,A→BB,B→aBb∣ab

c.

S→a∣aA,A→BB∣B,B→aBb

d.

S→a∣aA,A→BB∣B,B→aBb∣ab

Answer: (d).S→a∣aA,A→BB∣B,B→aBb∣ab

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The equivalent grammar corresponding to the grammar G:S→aA,A→BB,B→aBb∣εG:S→aA,A→BB,B→aBb∣ε is

Similar Questions

Discover Related MCQs

Q. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

Q. The following CFG

S->aB|bA, A->a|as|bAA, B->b|bs|aBB

generates strings of terminals that have

Q. Match the following :

(i) Regular Grammar                           (a) Pushdown automaton
(ii) Context free Grammar                   (b) Linear bounded automaton
(iii) Unrestricted Grammar                  (c) Deterministic finite automaton
(iv) Context Sensitive Grammar        (d) Turing machine
     
(i)   (ii)   (iii)  (iv)

Q. Which one of the following statement is false?

Q. Which of the following grammar is LR (1)?

Q. Context-free Grammar (CFG) can be recognized by

Q. A context free grammar is:

Q. Let e: B˄m→B˄n is a group code. The minimum distance of ‘e’ is equal to:

Q. A WFF that is equivalent to the WFF x=>y is:

Q. The regular expression given below describes:

r=(1+01)*(0+λ)

Q. Which of the following language is regular?

Q. Which of the regular expressions corresponds to this grammar ?

S → AB / AS, A → a / aA, B → b

Q. Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1

Q. The logic of pumping lemma is a good example of:

Q. Let A = {x | -1< x< 1} = B. The function f(x)=x/2 from A to B is:

Q. Which sentence can be generated by S→d/bA, A→d/ccA:

Q. Regular expression a+b denotes the set:

Q. Which of the following is not true?

Q. Identify the language which is not context - free.

Q. The context-free languages are closed for:

(i) Intersection                          (ii) Union
(iii) Complementation             (iv) Kleene Star