hello everyone

I have few practice questions for CFG (context free grammar) and TG (transition graph) I need help with.

1. Draw the total language tree for the following CFG until we can be sure that we have found all words in these language with one, two, three or four letters.

S à aSb | bX

X à bX | b

……………………………………………………………..

2. Find the CFG after removing the Λ-productions.

• S à aX | bX
• X à a | b | Λ

……………………………………………………………..

3. Convert the following CFG into CNF.

• S à aXX
• X à aS | bS | a