$($

$3$

$0$

pt

$)$

$$Consider set expressions containing sets,

$\{$

a

$,$

b

$,$

dots,

z

$,$

O

$,$

U

$\}$

$($

U

$$contains all the other set operators,

$\backslash$cup

$,$

$\backslash$cap

$,$

not, and parentheses; not has higher precedence than

$\backslash$cap

$,$

$$which has higher preceden than

$\backslash$cup

; all operators are assumed left associative.

$($

a

$)$

$($

$5$

pt

$)$

$$Write an

S

L

R

$($

$1$

$)$

$$grammar$,$

G

$,$

$$which is not

L

L

$($

$1$

$)$

$,$

$$for such expressions, which obeys t precedences indicated.

$($

b

$)$

$($

$3$

pt

$)$

$$Compute the FIRST

$($

Y

x

$)$

$$and FOLLOW

$($

x

$)$

$$sets for all nonterminals

x

$$and PREDICT

$($

i

$)$

$$se for all productions i

$.$

$($

jflap does not give PREDICT

$($

$)$

$$sets; you need to build those

$)$

$($

c

$)$

$($

$2$

pt

$)$

$$Prove that

G

$$is not

L

L

$($

$1$

$)$

; give the total number of conflicts.