You visited us 1 times! Enjoying our articles? Unlock Full Access!

Closure properties of CFL Part - 2

Consider an a...

Question

Consider an ambiguous grammar G and its disambiguated version D.Let the language recognized by the two grammars be denoted by L(G) and L(D) respectively.Which one of the following is true?

L(D) is empty

No worries! We‘ve got your back. Try BYJU‘S free classes today!

L(D) = L(G)

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

L(D)

\subset

L(G)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

L(D)

\supset

L(G)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B L(D) = L(G)
Grammar may change but language remain the same in the grammar and its disambiguated version.
L(D) =L(G)

Suggest Corrections

Similar questions

ϵ

G_{1} a n d G_{2},

(G_{1}) = L (G_{2})

S \to 0 S 0 ∣ 00 W h i c h o f t h e f o l l o w i n g i s t r u e ?

L a n g u a g e L_{1} i s d e f i n e d b y t h e g r a m m a r :

S_{1} \to a S_{1} b | ε

L a n g u a g e L_{2} i s d e f i n e d b y t h e g r a m m a r :

S_{2} \to a b S_{2} | ε

C o n s i d e r t h e f o l l o w i n g i s T R U E ?

P : L_{1} i s r e g u l a r

Q : L_{2} i s r e g u l a r

Which one of the following is TRUE?

S \to b S | a A | b

A \to b A | a B

B \to b B | a S | a

N_{a} (w) a n d

N_{b} (w)

\subseteq

^{+}

\sum = {a, b, c}

S \to a b S c T | a b c T

T \to b T | b

Join BYJU'S Learning Program