Solve Grammar to CNF (Comsky Normalform) problem Problem For the grammar G with the productions: s -> a s b b sa s T T-> SR R-> a SR Give a CNF G' such that L(G)=L(G') (remember: CNF allows only productions with the form "X -> Y Z" or "X ->a")