0 votes 0 votes Theory of Computation theory-of-computation + – Prateek kumar asked Jan 7, 2017 Prateek kumar 489 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Rahul Jain25 commented Jan 7, 2017 reply Follow Share Is it CFG??? 0 votes 0 votes Prateek kumar commented Jan 7, 2017 reply Follow Share yeah it is i got it ...it's clearly not regular bcoz production D->aDD but for rest, it's follow all and we know that CFL subset of CSL then again RE 0 votes 0 votes Kaushik.P.E commented Jan 7, 2017 reply Follow Share is this not a right linear regular grammer? 0 votes 0 votes Kaushik.P.E commented Jan 7, 2017 reply Follow Share Ya RG is a subset of CFG which is a subset of CSG and so on but the question asks which option accurately describes the grammer? what was the answer? 0 votes 0 votes Kaushik.P.E commented Jan 7, 2017 reply Follow Share Is it not RG because D -> ADD is right recursive? 0 votes 0 votes Prateek kumar commented Jan 7, 2017 reply Follow Share two non-terminal can not come along in regular grammar here DD coming so can not 0 votes 0 votes Kaushik.P.E commented Jan 7, 2017 reply Follow Share oh ok thanks.. But can regular grammers have recursion? 0 votes 0 votes Prateek kumar commented Jan 7, 2017 reply Follow Share yeah regular grammar could be either left recursion or right recursion 0 votes 0 votes Please log in or register to add a comment.