[mrsenim]

Confused how to convert following CFG into CNF.

S → aY | Ybb | Y
X → Λ | a
Y → aXY | bb | XXa

What will be above CFG in the form nonterminal → string of two nonterminals or nonterminal → one terminal.

Thanks

[mostyfriedman]

there's nothing tricky about converting a context free grammar to a chomsky normal form, if you know the algorithm, you just blindly apply it and you can't go wrong with the result. just google how to do that and look at some examples, or just use sipser's book, everything you need is there.