VU current papers 2026: what came in the exam

Exams wasn't easy, you have to prepare max especially the concepts definitions ans differences Some of question I remember are Q1 4 steps of LALR 1 DFA Q2 Write Three Ways to Evaluate Attribute Grammar Q3 LR Parse Tree / Grammar Long Question 1: Write the LALR(1) Algorithm Short Q . Syntax Directed Translation (SDT) – If-Then-Else Question (3 Marks) Complete the SDT for: S → if E then M1 S1 N else M2 S2 using M.quad E.truelist E.falselist S.nextlist N.nextlist makelist() merge() backpatch() Long question Control Flow Graph (CFG) is given. Find: Total Vertices (V) Total Edges (E) Basic Blocks Live Variables In that graph there is also start and exit point present in a rectangular box and exit is joined by B4 and start is joined by B 1 and B2 is joined by B4 by two arrows one in opposite directions You have to tell the live varribles at exit point and the final statement was X=t1+t2 You also have to tell the leader points of B4Exams wasn't easy, you have to prepare max especially the concepts definitions ans differences Some of question I remember are Q1… See more See less

Overall Experience: Paper kafi conceptual tha aur handouts ke un topics se aya tha jinhein aksar ignore kiya jata hai. Sirf past files ya video dekhne se guzara nahi hona tha, handouts ki deep reading lazmi thi. MCQs: MCQs zyada tar handouts ke modules se hi banaye gaye thay. Kuch purani files (Waqar/Junaid) se help mili lekin conceptual sawalat zyada thay. Short Questions : 1. CFG Components: CFG ke triplet () se mutaliq sawal thay ke edge, vertex aur entry point kya hote hain. 2. DAG Cycles: Pucha gaya tha ke DAG mein cycles hote hain ya nahi. (Correct Answer: DAG "Acyclic" hota hai, is mein cycles nahi ho sakte). 3. Basic Blocks Counting: Ek code segment diya gaya tha jis mein se Basic Blocks ki tadad batani thi. 4. Leader Identification: Block B4 ki aakhri line goto 3 thi, toh batana tha ke leader kaunsa hai. (Aap ka jawab sahi tha, line 3 leader hogi kyunke wo goto ka target hai). 5. Live Variables: Live variables ki definition aur un ka use optimization mein pucha gaya tha. 6. Optimization Tool: Dead code ko optimize karne aur register allocation ke liye kaunsa analysis use hota hai (Liveness Analysis/Live Variables). Long Questions (5 Marks): 1. CFG Analysis: Ek Control Flow Graph diya gaya tha jis mein se total Vertices (V), Edges (E), Basic Blocks, Live variables count kar ke likhne thay. 2. Canonical Collection Pseudocode: LALR(1) items ki canonical collection banane ka poora algorithm/pseudocode likhna tha. 3. LALR(1) DFA Algorithm: DFA banane ke wo 4 steps likhne thay: Repeat until distinct. Same core wali states choose karein. States ko merge karein (Union of lookaheads). Successors aur edges ko point/update karein. 4. Leaders List: leaders identify karne thay. 5. Basic Blocks identify krny thy. Pro-Tip for Future Students: Sirf "Shift/Reduce" ke practical sawal kafi nahi hain. Canonical collection(CC) ka pseudocode, CFG ki mathematical definitions, aur Liveness analysis ko deep mein parhein, examiner yahan se questions kafi uthata hai. Yh wo paper tha jo mujhy nhi ata tha, is liay mujhy yad rha hy, ap is ko ready kr lena. Peaceeeeee 🀪Overall Experience: Paper kafi conceptual tha aur handouts ke un topics se aya tha jinhein aksar ignore kiya jata hai. Sirf past… See more See less

MCQs Most MCQs were conceptual. Difficulty level was medium. Many MCQs were repeated or very similar to the Moaz and Waqar Sidhu files. Short Questions (3 Marks Each) Q1. Shift-Reduce Parsing A string similar to the following was given: Input: "(A+B)" Using the Shift-Reduce Parsing algorithm, determine: Total number of Shift operations Total number of Reduce operations Total number of Accept states Q2. Practical Applications of Compilers Write three real-life practical applications where compilers are used. Q3. Syntax Directed Translation (SDT) An SDT for the if-then-else statement was given. The production was similar to: S → if E then M1 S1 N else M2 S2 The question required completing the SDT using: M.quad E.truelist E.falselist S.nextlist N.nextlist makelist() merge() backpatch() Q4. LR Parse Tree / Grammar An LR parse tree (or parsing tree) was given. The task was to write the original grammar/productions from the given parse tree. Long Questions (5 Marks Each) Q1. Write the Canonical LR(1) pseudocode. Q2. Instruction Cost Calculation A table of instruction costs was provided, for example: Register → Register = 1 Register → Memory = 2 Memory → Register = 3 Memory → Memory = 4 ADD/SUB = 2 LOAD (LD) / STORE (ST) = 1 MUL/DIV = 5 Several assembly instruction sequences were given, such as: ADD M1, R1 SUB R2, M3 ST R1, M1 Different rows contained different numbers of instructions (2, 3, 4, or more), and the task was to calculate the total execution cost for each sequence. Q3. LR Parsing Table Analysis An LR Parsing Table was provided. Rows contained states (0, 1, 2, 3, ...) Columns contained terminals/non-terminals such as +, (, ), $, S, A, etc. The table included entries like: S1, S2, S3 (Shift) R1, R2, R3 (Reduce) Accept Blank/Error entries The task was to determine: Total number of Shift entries Total number of Reduce entries Total number of Accept entries Total number of Error entriesMCQs Most MCQs were conceptual. Difficulty level was medium. Many MCQs were repeated or very similar to the Moaz and Waqar Sidhu… See more See less

To add more, to my previous review SDT, DAG are important. MCQs related to bottom up parsing, types or methods e. g stack queue tree, types of parson Shift-Reduce Reduce-Reduce Tyari thori aur achi hoti to behtr ho skta tha examTo add more, to my previous review SDT, DAG are important. MCQs related to bottom up parsing, types or methods e. g stack queue… See more See less

MCQs were from the handouts, and half from the important Concepts. Not much from files. (many related to three address code, LR parsing, CFG, Augmented grammar, etc Hamzauni lecture was great for understanding Short Left factoring of CFG (production was given) A question related to aab aaaab etc BASIC Block Code Generation Strategies of Code Generation Long Write expressions in three address code form, table was given 4 steps of LALR 1 DFA PSueDO code of closure Exams wasn't easy, you have to prepare max especially the concepts definitions ans differencesMCQs were from the handouts, and half from the important Concepts. Not much from files. (many related to three address code, LR… See more See less

Paper was totally conceptual mcqs stary modules sy he te meny Kafi files prepare ki te un my Kuch nhi Aya Sirf Kuch mcqs smart work zone ki final term prepration video sy ty Baki agr ap sary lectures nhi lety then past paper sy Kuch nhi ata: short question : T'—- U u and then U—-u| v is ko look convert krna ta augmented gramer may dot or lookahead symbol Jo add krty … Q2: while ( condition) Else (. ) ye deya ta k is ko define krna statements kia hosakti idhr……… Q3 table deya ta number, sign , list, bit is k agy btana ta k kia ata is my according to Grammer .. Q4: a is less than b if else ki condition te idhr labels or go-to k function lganay ty Q5: x= y+z and x= y-z is ko three address code my likhna ta Q: Is my btana lines de te satagy btana ta kn sa function perform howa shift or reduce or shift howa tu kitny times howa Long Questions: Psuodo code given the koi b algorithm they skty bech my line my blankss missing te wo complete krni te Q2: Canonical item for LR1 ka pseudo code or algorithm likhnata Q3: Ak program deya howa ta us my koi sy 6 leader statements btani te basic block topic sy hai Q4: 5 statements de te us ka btana ta union hai ya struc .Paper was totally conceptual mcqs stary modules sy he te meny Kafi files prepare ki te un my Kuch nhi Aya Sirf Kuch mcqs smart… See more See less