1. a) Design a context free grammar for the following language. L= { 0"1™|m,n >= 0 , n !=m } b) Consider the following CFG R XRX | S S aT b| bT a T XT X | X|E X→ a |b Define whether the following...

= 0 , n !=m } b) Consider the following CFG R XRX | S S aT b| bT a T XT X | X|E X→ a |b Define whether the following statements are true or false based on the given CFG i. True or False: T = aba True or False: T =* aba True or False: T =* XXX True or False: S =* ɛ ii. iii. iv. "/>
Extracted text: 1. a) Design a context free grammar for the following language. L= { 0"1™|m,n >= 0 , n !=m } b) Consider the following CFG R XRX | S S aT b| bT a T XT X | X|E X→ a |b Define whether the following statements are true or false based on the given CFG i. True or False: T = aba True or False: T =* aba True or False: T =* XXX True or False: S =* ɛ ii. iii. iv.