adplus-dvertising
frame-decoration

Question

The Greibach normal form grammar for the language L = {an bn+1 | n ≥ 0 } is

a.

S →  aSB, B →bB I  λ

b.

S →  aSB, B →bB I  b

c.

S →  aSB I b, B→b

d.

S →  aSB I b

Answer: (c).S →  aSB I b, B→b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The Greibach normal form grammar for the language L = {an bn+1 | n ≥ 0 } is

Similar Questions

Discover Related MCQs

Q. Given the following statements:

S1: Every context-sensitive language L is recursive.
S2: There exists a recursive language that is not context sensitive.

Which statement is correct?

Q. Shift-Reduce parsers perform the following :

Q. The following Context-Free Grammar (CFG) :

S → aB | bA

A → a | as | bAA

B → b | bs | aBB

will generate

Q. Which of the following is true?

Q. The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, δ, q0,0, {q0}) with

δ (q0, a, 0) = {(q1,10)}

δ (q1,a, 1) = {(q1,11)}

δ (q1,b, 1) = {(q2 , λ)}

δ(q2 , b, 1) = {(q2 , λ)}

δ (q2 , A, 0) = {(q0, λ)}

Accepts the language

Q. Given two languages:

L1= {(ab)n,ak I n> k, k >=0}

L2 = {an bm l n ≠ m}

Using pumping lemma for regular language, it can be shown that

Q. Regular expression for the complement of language L = {a^n b^m I n ≥ 4, m ≤ 3} is

Q. We can show that the clique problem is NP-hard by proving that

Q. Given the recursively enumerable language (LRE), the context sensitive language (LCS) the recursive language (LREC) the context free language (LCF) and deterministic context free language (LDCF) The relationship between these families is given by

Q. Match the following:

       List- I                                                List -II
a. Context free grammar               i. Linear bounded automaton
b. Regular grammar                     ii. Pushdown automaton
c. Context sensitive grammar     iii. Turing machine
d. Unrestricted grammar             iv. Deterministic finite automaton

code:
a   b    c    d

Q. According to pumping lemma for context free languages:
Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with I w I ≥ m can be decomposed as w = u v x y z

Q. The equivalent production rules corresponding to the production rules

S → Sα1 | Sα2 | β1 | β2 

Q. If all the production rules have single non - terminal symbol on the left side, the grammar defined is :

Q. Minimal deterministic finite automaton for the language L = {0n | n ≥ 0 , n ≠ 4} will have

Q. The regular expression corresponding to the language L where L = { x ∈{0, 1}* | x ends with 1 and does not contain substring 00 } is :

Q. A context free grammar for L = { w | n0 (w) > n1 (w)} is given by :

Q. Given the following two statements :

S1: If L1 and L2 are recursively enumerable languages over Σ, then L1 ⋃ L2 and L1 ⌒ L2 are also recursively enumerable.

S2: The set of recursively enumerable languages is countable.

Which of the following is correct?

Q. Given the following grammars :

G1: S → AB|aaB

A → aA | ∈

B → bB | ∈

G2: S → A | B

A → a A b | ab

B → a b B | ∈

Which of the following is correct?

Q. Let L be any language. Define even (W)  as the  strings  obtained by extracting from W the letters in the even-numbered positions and even (L) = {even (W) | W ԑ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | v W ԑ L,with | v | = 2}.

If L is regular language then

Q. Given the following two grammars :

G1 :     S → AB | aaB

A → a | Aa

B → b

G2: S→ aSbS|bSaS|λ

Which statement is correct ?