PyQdeck LogoPyQdeckSubjects
Back to the 2022 paper

Module 3 : Semantic Analysis & Symbol Table

20227m

For the given grammar and associated semantic rules. Find the output for the input: aadbd.
S→AS{print(1)};S→AB{print(2)};A→a{print(3)};B→bC{print(4)};S \rightarrow AS \{print(1)\}; S \rightarrow AB \{print(2)\}; A \rightarrow a \{print(3)\}; B \rightarrow bC \{print(4)\};
B→dB{print(5)};C→e{print(6)}B \rightarrow dB \{print(5)\}; C \rightarrow e \{print(6)\}

Search GoogleAsk AI

Similar questions

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 b20257mFORMAL 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 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 tree20237mFORMAL 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
PreviousExplain the working of each phase of compiler in detail with an example.NextConsider the following grammar: S \rightarrow 0S0 | 1S1 | 10 (a) Find LR(0) collection of items for the above grammar. (b) Construct SLR parsing table. (c) Trace whether the string "01100" is accepted or not.