4.1 [GATE 2006 : 2 Marks] Question:Consider the following C code segment.for (i=0; i<n; i++){for (j=0; j<n; j++){if (i % 2){x += (4 * j + 5 * i);y += (7 + 4 * j);}}}Which one of the following is false?(a) The code contains loop invariant computation(b) There is scope of common sub-expression elimination in
Compiler design code generation and optimization pyq (4.1 -4.16) GATE (2006-2015) Read More »
Compiler Design GATE PYQ 1992-2007 (Q 2.1 to 2.24) With Detailed Solutions Q 2.1 [GATE 1992 : 2 Marks] SLR(1) vs LALR(1) Parsing Table Question: Consider the SLR(1) and LALR(1) parsing tables for a context free grammar. Which of the following statements is/are true? (a) The goto part of both tables may be different.(b) The
Compiler Design GATE PYQ 1992-2007 (Q 2.1 to 2.24) with Detailed Solutions Read More »
🔥 Lexical Analysis – Part 3 (Q1.21 to Q1.30) – Chapter Complete GATE 2018 Q1.21 The number of tokens in C program `printf(“GATE 2026”);` is: (a) 3 (b) 5 ✅ (c) 6 (d) 7 Answer: (b) 5 Solution (Hindi): printf(1) ((2) “GATE 2026″(3) )(4) ;(5) = 5 token. String pura ek token hota hai. GATE
Lexical Analysis GATE PYQ Part 3 (Q1.21 to Q1.30) – Chapter Complete Read More »
📘 Compiler Design – Lexical Analysis – GATE PYQ (Q1.1 to Q1.10) GATE 1990 Q1.1 In a compiler, the module that checks every character of the source text is called: (a) The code generator (b) The code optimizer (c) The lexical analyzer ✅ (d) The syntax analyzer Answer: (c) Solution (Hindi): Ye sabse pehla phase
Compiler Design – Lexical Analysis GATE PYQ Read More »
Complete Compiler Design Notes for GATE CSE 2026 – Best Notes Compiler Design GATE CSE ka sabse logical subject hai. Har saal 3-4 marks aate hain. Isme se LL(1), LR(0) Parsing aur Intermediate Code se har saal question aata hai. Ye last core subject hai, iske baad aapka pura syllabus complete. 1. Phases of Compiler
Compiler Design Notes for GATE CSE 2026 – Phases, Parsing, Syntax Read More »
