Mcq easy the from handouts Short: 1) DFA diya tha us men se unreachable states btani then initial state se 2) 3 rules diye the in men se btana tha kon konsi left recursive h. Rules ye the : E ? Eab E ? aEb E ? abE Long 1) statements di then un men se btana tha register allocation men PC k liye konsi aur IR k liye konsi suitable h 2) non recursive predictive parser ki diagram thi us ko label krna tha