Identify the language generated by the following grammarS ->...

MCQ

Identify the language generated by the following grammar

S -> AB
 A -> aAb|?
 B -> bB| b

{a^mbⁿ | n>=m, m>0}

{a^mbⁿ | n>=m, m>=0}

{a^mbⁿ | n>m, m>0}

{a^mbⁿ | n>m, m>=0}

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following pairs have DIFFERENT expressive power?

Deterministic finite automata(DFA) and Non-deterministic finite automata(NFA)

Deterministic push down automata(DPDA)and Non-deterministic push down automata(NPDA)

Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine

Single-tape Turing machine and multi-tape Turing machine

Discussion

MCQ

Let L = {0ⁿ1ⁿ|n ? 0} be a context free language. Which of the following is correct ?

L` is context free and L^k is not context free for any k ? 1.

L` is not context free and L^k is not context free for any k ? 1

Both L` and L^k is for any k ? 1 are context free.

Both L` and L^k is for any k ? 1 are not context free

Discussion

MCQ

Are ambiguous grammar context free?

Yes

Discussion

MCQ

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

context free grammar

context sensitive grammar

unrestricted grammar

phrase grammar

Discussion

MCQ

Which variable does not drive a terminal string in grammar? S -> AB A -> a B -> b B -> C

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics