Given the grammar G = (\{S\}, \{a, b\}, P, S) P: S \rightarrow aSb | a — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2025 paper

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

20257m

Given 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.

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYGiven the grammar: S \to aB \mid ba \\ B \to b \mid bs \mid aBB For the string aaabbabbba find: 1. Leftmost derivation 2. Rightmost derivation 3. Parse tree20237m FORMAL 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 DesignProve that the following grammar is ambiguous on string 'aab': S \rightarrow aS \mid aSbS \mid \varepsilon20257m

PreviousMulti-tape TM is (i) More powerful than single-tape TM (ii) Less powerful (iii) Equivalent in power (iv) Not equivalent NextExplain the Chomsky hierarchy of languages with examples.