1,022 views

1 Answer

0 votes
0 votes
L= { w1w2 | w 1, w2 = (0+1)*           // Non Regular

L = { w| No of a mod 3 = 0}              // Regular

In general it can be anything.. mod need not to be regular in every case..

Related questions

0 votes
0 votes
2 answers
4
sripo asked Nov 1, 2018
2,291 views
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]