Back to the 2023 paper
Similar questions
Formal Language & Automata TheoryBegin with the grammar: S \to ASB / \epsilon A \to aAS / a B \to SbS / A / bb (i) Eliminate \epsilon-productions. (ii) Eliminate unit productions in the resulting grammar. (iii) Eliminate any useless symbol in the resulting grammar. (iv) Put the resulting grammar into CNF.202214mFORMAL LANGUAGE & AUTOMATA THEORYWhich production is not allowed in a CSG? (i) AB \rightarrow BA (ii) A \rightarrow \epsilon (iii) A \rightarrow a (iv) a B \rightarrow a b20252m Compiler DesignProve that the following grammar is ambiguous on string 'aab': S \rightarrow aS \mid aSbS \mid \varepsilon20257m Compiler DesignShow that the following grammar is LL(1) but not SLR(1). S \rightarrow AaAb/BbBa A \rightarrow \epsilon B \rightarrow \epsilon20236m
PreviousDesign a PDA (empty stack and final state both) for L = \{ WW^r \mid W \in \{a,b\}^* \}.NextDefine Chomsky Normal Form. Convert the CFG: S → aSb | ab | Aa A → aab to CNF.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.