Question 4 [6 points]
Consider the following grammar:
G $\rightarrow$ A | B
A $\rightarrow$ ...
B $\rightarrow$ ...
Predictable Parsing
and assume that $\epsilon \notin$ FIRST(A) and $\epsilon \notin$ FIRST(B), but FIRST(A) $\cap$ FIRST(B) $\neq \emptyset$. Explain
how this exhibits itself in the parsing table M[.......], i.e., the entry M[G,a], a $\in$ FIRST(A) $\cap$ FIRST(B).