boht asan the sara handouts sa aur smart work zone k lec 1 to 18 sa tha short question code given the tokens ki counting krni thi like 2+x = y is k token 5 hon gy grammer di hui thi left left recursion likhni thi yes or no like A?Aa?b is left recursion aisa 3 thi long dfa transition graph given tha chote chote swal tha first state ,end state,total state,alphabet ,aur regular expression write krna tha table driven parse k five parts k name likhna tha jo ye tha handouts k lec 16 page 61 pa tha lazmi dakh k jana Input Stack Parsing Table predictive parser Output all the best !