Consider the following grammar G:
E -> E + T | T
T -> T F | F
F -> F* | a | b
This grammar can be used to generate regular expressions overthe alphabet {a,b} with standard precedence rules.
Show your solution for each of the following 5 points:
Ă‚Â Ă‚Â Ă‚Â 1. Remove left recursion and write theresulting grammar G1.
Ă‚Â Ă‚Â Ă‚Â 2. For the grammar G1, compute and write thesets FIRST for every right hand side of every production,
Ă‚Â Ă‚Â Ă‚Â Ă‚Â Ă‚Â Ă‚Â and the sets FOLLOW for everyleft hand side (i.e. any non-terminal).
Ă‚Â Ă‚Â Ă‚Â 3. Find and write the table for a predictiveparser
Ă‚Â Ă‚Â Ă‚Â 4. Is G1 LL(1)? Justify your answer.
Ă‚Â Ă‚Â Ă‚Â 5. If the answer to (4) above is yes, then traceparsing of: a* + ab*
