Perform the following transformations: a) Eliminate left recursion from the following grammar: A Aad | bd b) Apply left factoring on the following grammar: stmt if expr then stmt else stmt endif | if expr then stmt endif

2. For the grammar given below: S ACB | CbB | Ba A da | BC B g | C h | a) Compute the FIRST and the FOLLOW and write in the form of columns. b) Construct the predictive parsing table.