Construct a predictive parser from the unambiguous grammar for regular expressions in Exercise 4.4.
Exercise 4.4. Consider the grammar
Note that the first vertical bar is the "or" symbol. not a separator between alternatives,
a) Show. that this grammar generates all regular expressions over the symbols a and b.
b) Show that this grammar is ambiguous.
c) Construct an equivalent unambiguous grammar that gives the operators >1:. concatenation, and I the precedences and associativities defined in Section 3.3.
d) Construct a parse tree in both grammars for the sentence a Ib*C