0 votes 0 votes Regular grammars can only describe regular languages, why reverse is not true .What should be the most appropriate Reason ? Explain with in few Lines .If possible give an exp too. Theory of Computation theory-of-computation regular-language + – shekhar chauhan asked Jun 6, 2016 • retagged Jun 4, 2017 by Arjun shekhar chauhan 2.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes The language generated by any regular grammar will be regular - same as saying regular grammar can only describe regular languages. But for regular language we can generate it by non-regular grammar also. For example $a^*b^*$ can be generated by a non-regular grammar S → aA A → Sb | ε S → ε This makes the reverse statement false. srestha answered Jun 6, 2016 • selected Jun 7, 2016 by Arjun srestha comment Share Follow See all 14 Comments See all 14 14 Comments reply Show 11 previous comments srestha commented Jun 7, 2016 reply Follow Share yes if it is aibi then it is CFL , which is not regular , like, it can be generate like S->aSb rt? 0 votes 0 votes Arjun commented Jun 7, 2016 reply Follow Share that grammar is not regular grammar rt? 0 votes 0 votes srestha commented Jun 7, 2016 reply Follow Share yes not CFL actually , but is not regular 0 votes 0 votes Please log in or register to add a comment.
