Pholus - Screenshol (75).png See all photos + Add to 1 X Edit & Create 2 Share COMP 451 COMP 451 Question 35 Marks Given is the following ambiguous grammar R-R+RIR-RR Rabc Transform it into an unambiguous grammar. Assume all operators are left associative, and order of precedenceist - That is (+ operator has the lowest priority while. operator has the highest priority). Question 2 [5, 5 Marks) Consider the following set of productions: SABC Ale BBG C-Cle Suppose the input string is w='abbc1 List down left most and right most derivation in the following table Left Most Derivation Right Most Derivation Question 4 [10 Marks Given a grammar A-ASBIB B-C#BC CC@DID Did Assume S, and are some operators Suppose stands for multiplication, stands for subtraction while stands for addition. Now if you receive an input string wid@id Sid #id, what will be output if id=4. You should provide proper justifications for your answer Question 5 [5 Marks ) Consider the following grammar. Eliminate left recursion if it exists. ELETIT TTFIF FE) id I Type here to search O WE CL 12:00 PM 1/17/2021