Problem 1: Here are the rewriting rules for language I: S->abXba bXb -> babXbab |bcdYdcb un...

 

Transcribed Image Text:

Problem 1: Here are the rewriting rules for language I: S->abXba bXb -> babXbab |bcdYdcb un dYd -> dcdYdcd | cd (a) Are these rules regular, context-free or context-sensitive or none of these three? (b) Is this language context-free? If it is, give a context-free set of rewriting rules for it. Problem 1: Here are the rewriting rules for language I: S->abXba bXb -> babXbab |bcdYdcb un dYd -> dcdYdcd | cd (a) Are these rules regular, context-free or context-sensitive or none of these three? (b) Is this language context-free? If it is, give a context-free set of rewriting rules for it.