PyQdeck LogoPyQdeckSubjects
Back to the 2023 paper

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

20237m

Given the grammar:

S→aB∣baB→b∣bs∣aBB S \to aB \mid ba \\ B \to b \mid bs \mid aBB

For the string aaabbabbbaaaabbabbba find:

  1. Leftmost derivation
  2. Rightmost derivation
  3. Parse tree
Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYGiven the grammar G = (\{S\}, \{a, b\}, P, S) P: S \rightarrow aSb | ab Derive the string aabb using leftmost derivation, rightmost derivation and also draw the parse tree.20257mFORMAL 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.20257m Compiler DesignFor the given grammar and associated semantic rules. Find the output for the input: *aadbd*. S \rightarrow AS \{print(1)\}; S \rightarrow AB \{print(2)\}; A \rightarrow a \{print(3)\}; B \rightarrow bC \{print(4)\}; B \rightarrow dB \{print(5)\}; C \rightarrow e \{print(6)\}20227m Compiler DesignDescribe the working of LL(1) parser. Draw the LL(1) parsing table for the given grammar: S \rightarrow aA \mid bB A \rightarrow a B \rightarrow b20257m
PreviousConstruct a Moore machine equivalent to the given Mealy machine.NextWrite short notes on: Post Correspondence Problem.