Written work 3
Due on September 20th @ 3:00 PM (in class, to Drew, or at Engineering front office)
Not accepted late
Question 1

Left-factor the following grammar:

A ::= yAAxxA 
   |  yAAxAy 
   |  yAy
   |  x

Question 2

Eliminate left-recursion in the following grammar:

L ::= L L E
L ::= G
G ::= G b
   |  a
E ::= k

Question 3

What are the FIRST and FOLLOW sets for the following grammar:

A ::= A y B
A ::= z
A ::= ε
B ::= A

Question 4

Is it possible to generate FIRST sets for a grammar with syntactic ambiguity? Explain your reasoning.