Back to the 2019 paper
Similar questions
Formal Language & Automata TheoryConsider the grammar: S \to AB \mid BC A \to BA \mid a B \to CC \mid b C \to AB \mid a Use the CYK algorithm to determine whether the given string "baaba" is in L(G) or not.202114mFORMAL LANGUAGE & AUTOMATA THEORYUsing the CYK algorithm, determine whether baaba is in L(G) for the grammar: `` S → AB | BC A → BA | a B → CC | b C → AB | a ``202114mFORMAL LANGUAGE & AUTOMATA THEORYGiven the following context-sensitive grammar: S \rightarrow aSBC | abc CB \rightarrow BC aB \rightarrow ab bB \rightarrow bb bC \rightarrow bc cC \rightarrow cc Identify the language generated by the grammar. Derive the string aabbcc step by step.20257mCompiler DesignConsider the grammar: S \to ABC A \to aA \mid \varepsilon B \to bB \mid \varepsilon C \to cC \mid d Compute the \text{FIRST} and \text{FOLLOW} sets for all non-terminals. Using these, construct the \text{LL}(1) parsing table. Use the parsing table to show the parsing steps for the input string "aabd".20267m
PreviousConstruct a push-down automata that accepts the following language: L = \{uawb \mid u \text{ and } w \in \{a, b\}^* \text{ and } |u| = |w|\}NextDesign a Turing machine to perform 2's compliment operation on binary string.
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.