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

the reverse of the string w. Which of these languages are deterministic Context-free languages?

None of the languages

Only L1

Only L1 and L2

All the three languages

Discussion

MCQ

Consider the languages L1 = {0ⁱ1^j | i != j}. L2 = {0ⁱ1^j | i = j}. L3 = {0ⁱ1^j | i = 2j+1}. L4 = {0ⁱ1^j | i != 2j}.

Only L2 is context free

Only L2 and L3 are context free

Only L1 and L2 are context free

All are context free

Discussion

MCQ

Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S ? a S b | SS | ? Which of the following statements is true?

G is not ambiguous

There exist x, y, ? L (G) such that xy ? L(G)

There is a deterministic pushdown automaton that accepts L(G)

We can find a deterministic finite state automaton that accepts L(G)

Discussion

MCQ

Production Rule: aAb->agb belongs to which of the following category?

Regular Language

Context free Language

Context Sensitive Language

Recursively Ennumerable Language

Discussion

MCQ

The set A={ 0ⁿ 1ⁿ 2 ⁿ | n=1, 2, 3, ......... } is an example of a grammar that is:

Context sensitive

Context free

Regular

None of the above

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