Problem 1. Consider the following grammar:

	E=>(L)|a 
	L=>L,E|E 

a. Is this an LL grammar? Explain.

b. Construct DFA of LR(0) items for this grammar

c. Is this an LR(0) grammar? If not, describe the LR(0) conflict. If so, construct the LR(0) parsing table, and describe parsing of the input string ((a),a,(a,a))


d. Is this an SLR(1) grammar? If not, describe the SLR(1) conflict. If so, construct the SLR(1) parsing table, and describe parsing of the input string ((a),a,(a,a)).

e. Construct the DFA of LR(1) items for the grammar.

f. Is this an LR(1) grammar? If not, describe the LR(1) conflict. If so, construct the LR(1) parsing table, and describe parsing of the input string ((a),a,(a,a)).

g. Is this an LALR(1) grammar? If not, describe the LALR(1) conflict. If so, construct the LALR(1) parsing table, and describe parsing of the input string ((a),a,(a,a)).



Problem 2. Consider the following grammar:

	declaration => type var-list
	type => int | float
	var-list => identifier , var-list | identifier

a. Is this an LL grammar? Explain.

b. Construct DFA of LR(0) items for this grammar

c. Is this an LR(0) grammar? If not, describe the LR(0) conflict. If so, construct the LR(0) parsing table, and describe parsing of the input string int x,y,z 


d. Is this an SLR(1) grammar? If not, describe the SLR(1) conflict. If so, construct the SLR(1) parsing table, and describe parsing of the input string int x,y,z .

e. Construct the DFA of LR(1) items for the grammar.

f. Is this an LR(1) grammar? If not, describe the LR(1) conflict. If so, construct the LR(1) parsing table, and describe parsing of the input string int x,y,z .

g. Is this an LALR(1) grammar? If not, describe the LALR(1) conflict. If so, construct the LALR(1) parsing table, and describe parsing of the input string int x,y,z .