1 votes 1 votes G(V,T,P,S) V={S,A,B} T={a,b,c,d} S->aAb/bB A->b/cA B->cB/d. Is the above grammar Regular? Theory of Computation theory-of-computation + – Dheeraj Varma asked Jan 17, 2022 Dheeraj Varma 365 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kabir5454 commented Jan 17, 2022 reply Follow Share The grammar is not regular . A grammar is regular if and only if is a single nonterminal and is a single terminal or a single terminal followed by a single nonterminal, that is a production is of the form X -> a or X -> aY, where X and Y are nonterminal and a is a terminal. Here S->aSb does not follow the rule so the grammar is not regular. Note that a grammar which is not regular its language generated by the grammar can be regular as well . and if a grammar is not regular then we can make the grammar regular as well if possible. https://www.cs.odu.edu/~toida/nerzic/390teched/regular/grammar/reg-grammar.html GATE IT 2007 | Question: 49 - GATE Overflow 1 votes 1 votes palashbehra5 commented Jan 17, 2022 reply Follow Share no https://en.wikipedia.org/wiki/Regular_grammar#Strictly_regular_grammars 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Not regular grammar. Regular Grammar -:It should be in form of A→aA|a|b OR A→Aa|a|b But NOT in the combination of both left recursive and right recursive grammar. Because of S->aSb does not follow the rule so the grammar is not regular. amitraj123 answered Jan 17, 2022 edited Jan 17, 2022 by amitraj123 amitraj123 comment Share Follow See all 0 reply Please log in or register to add a comment.