Question: 2) Consider the following Grammar called G2 ASSIGNEXP -> idEXP EXPid OP EXP id OP EXPI (EXPid d. e. f. Write three examples of string

2) Consider the following Grammar called G2 ASSIGNEXP -> idEXP EXPid OP EXP id OP EXPI (EXPid d. e. f. Write three examples of string generated by G2 Is this grammar Left or Right recursive? Transform this grammar into EBNF (non -recursive) grammar, called G2T Give three strings generated by G2T Can you conclude that L(G2) = L(G2T)? Justify your answer h
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
