Question Given is the following ambiguous grammar: R-R+RR-RR*Rabc Transform it into an unambiguous grammar. Assume all operators are left associative, and order of precedence is + , -*. That is (+ operator has the lowest priority while_* operator has the highest priority). Question Given a grammar AA$BB B C#BIC C-C@DID Did Assume $, # and @ are some operators. Suppose $ stands for multiplication, # stands for subtraction while @ stands for addition. Now if you receive an input string w = id @ id $ id # id, what will be output if id = 4. You should provide proper justifications for your answer. Question Consider the following grammar. Eliminate left recursion if it exists. E-E+T|T T-T* FIF F (E) | id