Write a grammar not necessarily LL1 that recognizes a list o

Write a grammar (not necessarily LL(1)) that recognizes a list of variable definition lines. Each line contains a type (int or char) followed by a list of simple variables (identifiers) separated by comma (, ). Each line ends with a semicolon (;)For example: int a, b, d; char aa; int ccc, ddd

Solution

Grammar G=(V,T,P,S), Where V={St,T,A,L,R,I,Z,D,E,C} set of variables ; T={int,char,\' \', , ,epsilon,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,0,1,2,3,4,5,6,7,8,9}, set of nonterminals

P={

St----------->TALE

T------------>int/char // production rule for type int or char

A------------>\' \' //for space

L------------>LCR/R

C------------>,

E------------>;

I-------------->A|B|.............|Z|a|b|...........|z //production rule for identifier

D------------>0|1|2|3|4|5|6|7|8|9 //production rule for identifier name that may contain numbers

}, set of production rules

S= St, start symbol