Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYEliminate \varepsilon, unit, and useless productions from the grammar: A → bA | Bba | aa B → aba | b | D C → CA | AC | B D → a | \varepsilon20237m Compiler DesignChoose the correct answer of the following: After removing left recursion from A \rightarrow A\alpha / \beta , the resulting grammar will be (i) A \rightarrow \beta A' (ii) A \rightarrow \alpha A' (iii) A \rightarrow \alpha \beta A'' (iv) A \rightarrow \beta \alpha A'20222mCompiler DesignFind the FIRST an FOLLOW form the following production: S \to aBDh B \to cC C \to bC | \epsilon D \to EF E \to g | \epsilon F \to f | \epsilon20237mFormal Language & Automata TheoryWhich of the following requires context sensitivity? (i) a^n b^n (ii) a^n b^n c^n (iii) (a+b)^* (iv) a^*20252m
PreviousContext-free languages are NOT closed under (i) Union (ii) Concatenation (iii) Intersection (iv) Kleene starNextA Turing Machine that prints strings of a language is called (i) Acceptor (ii) Transducer (iii) Generator (iv) Enumerator
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.