Consider the following grammar.S -> AB A -> a A -> BaB B -> ...

MCQ

Consider the following grammar.

S -> AB
A -> a
A -> BaB
B -> bbA

Which of the following statements is FALSE?

The length of every string produced by this grammar is even

No string produced by this grammar has three consecutive a's

The length of substring produced by B is always odd

No string produced by this grammar has four consecutive b's

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is the number of steps required to derive the string ((() ()) ())

S ? SS
S ? (S)
S ? ?

Discussion

MCQ

Consider the following languages: L1 = {am bn ? m ? n} L2 = {am bn ? m = 2n+1} L3 = {am bm ? m ? 2n} Which one of the following statement is correct ?

Only L₁ and L₂ are context free languages

Only L₁ and L₃ are context free languages

Only L₂ and L₃ are context free languages

L₁, L₂ and L₃ are context free languages

Discussion

MCQ

Which of these languages are not context free

L1 only

L3 Only

L1 and L2

L2 and L3

Discussion

MCQ

The language L= {0ⁱ21ⁱ | i?0 } over the alphabet {0,1, 2} is:

not recursive

is recursive and is a deterministic CFL

is a regular language.

is not a deterministic CFL but a CFL

Discussion

MCQ

Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? v, with |v| = K > 1. The derivation tree for any W ? L(G) has a height h such that

logK|W| ? h ? logK((|W|-1)/k-1)

logK|W| ? h ? logK(K|W|)

logK|W| ? h ? K logK|W|

logK|W| ? h ? ((|W|-1)/k-1)

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