Question 1 (5 points) Using left-factoring and/or elimination of left-recursion, give grammars equivalent to the below two grammars where the immediate problems preventing use of recursive-descent parsing have been removed. Capital letters denote variables and the set of terminals is {a, b, €, d}.
1. (2.5 pts)
S → abSc | acS | ad | cbS | dc
2. (2.5 pts)
S → Sbc | Sdc | Sadd | abS | €