Back to the 2021 paper
Similar questions
Formal Language & Automata TheoryIf L1 and L2 are context free languages, L1 - L2 is ___________ context-free. (i) always (ii) sometimes (iii) never (iv) None of these20222mFORMAL LANGUAGE & AUTOMATA THEORYIf L_1 and L_2 are CFLs, L_1 - L_2 is ____ context-free. (i) always (ii) sometimes (iii) never (iv) None of the above20212m Compiler DesignChoose the correct answer of the following: Which of the following statement is true? (i) Every left recursive grammar can be LL(1) (ii) LL(1) grammar can be ambiguous (iii) both (i) and (ii) (iv) None of these20232m Compiler DesignChoose the correct answer of the following: If a grammar is LALR(1), then it is necessarily (i) SLR(1) (ii) LR(1) (iii) LL(1) (iv) None of the above20222m
PreviousThe maximum number of states of a DFA converted from an NFA with n states is (i) n (ii) n^2 (iii) 2^n (iv) None of the aboveNextWhich of the following does not have left recursions? (i) Chomsky normal form (ii) Greibach normal form (iii) Backus-Naur form (iv) All of the above
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.