PyQdeck LogoPyQdeckSubjects
Back to the 2021 paper

Module 2: Context-Free Languages (CFL) and PDA

20212m

Which of the following does not have left recursion?

(i) Chomsky Normal Form
(ii) Greibach Normal Form
(iii) Backus–Naur Form
(iv) All of the above

Search GoogleAsk AI

Similar questions

Formal Language & Automata TheoryWhich of the following does not have left recursions? (i) Chomsky normal form (ii) Greibach normal form (iii) Backus-Naur form (iv) All 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 these20232mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a type of grammar in the Chomsky hierarchy? (i) Regular (ii) Context-Free (iii) Context-Sensitive (iv) All of the above20242mFormal Language & Automata TheoryWrite a short note on: Chomsky normal form20213.5m
PreviousIf L_1 and L_2 are CFLs, L_1 - L_2 is ____ context-free. (i) always (ii) sometimes (iii) never (iv) None of the aboveNextFor an NFA with n states, the minimized DFA has: (i) m \le 2^n (ii) n \le m (iii) one accept state (iv) m = 2^n