Unit II - Assignment II

19CSB301 – AUTOMATA THEORY AND COMPILER DESIG N ASSIGNMENT 2-UNIT II Prof.M.Shobana – III CSE C Questions 1. Convert the regular expression to ε-NFA for the following strings a. Set of all strings over {a,b} that has exactly one a (=1a) b. Set of all strings over {a,b} that has at least one a (>=1a) c. Set of all strings over {a,b} that has at most one a(<=1a) 2. Convert the ε-NFA to DFA for the regular expression 0(0+1)*1 3. Convert the Regular Expression 0(0+1)*1 to DFA (Direct Method)

Unit III

19CSB301 – AUTOMATA THEORY AND COMPILER DESIG N ASSIGNMENT 3-UNIT III Prof.M.Shobana – III CSE C 1. Check whether the Grammar is LL(1) or not SiEtSS1|a S1eS| ε Eb 2. Construct the LR(0) Parse Table and SLR parse table for Below CFG: EE+T ET TT*F TF F(E) Fid Check for the input id+id*id for LR(0) alone in stack implementation 3. Construct the CLR & LALR parse table for below CFG SaAd|bBd|aBe|bAe Ac Bc