This document contains an internal question paper for the 3rd semester Bachelor of Technology (B.Tech) class in Computer Science Engineering (CSE). It has 3 questions related to compiler design. Question 1 has parts on parse trees, syntax trees, differences between compilers and interpreters, and output stages of a compiler for an expression. Question 2 tests LL(1) grammars and construction of an SLR parsing table. Question 3 differentiates LR(0) and LR(1) items, describes shift-reduce and reduce-reduce conflicts, and involves designing a CLR parsing table. The paper tests concepts from compiler design and has a duration of 90 minutes.
This document contains an internal question paper for the 3rd semester Bachelor of Technology (B.Tech) class in Computer Science Engineering (CSE). It has 3 questions related to compiler design. Question 1 has parts on parse trees, syntax trees, differences between compilers and interpreters, and output stages of a compiler for an expression. Question 2 tests LL(1) grammars and construction of an SLR parsing table. Question 3 differentiates LR(0) and LR(1) items, describes shift-reduce and reduce-reduce conflicts, and involves designing a CLR parsing table. The paper tests concepts from compiler design and has a duration of 90 minutes.
This document contains an internal question paper for the 3rd semester Bachelor of Technology (B.Tech) class in Computer Science Engineering (CSE). It has 3 questions related to compiler design. Question 1 has parts on parse trees, syntax trees, differences between compilers and interpreters, and output stages of a compiler for an expression. Question 2 tests LL(1) grammars and construction of an SLR parsing table. Question 3 differentiates LR(0) and LR(1) items, describes shift-reduce and reduce-reduce conflicts, and involves designing a CLR parsing table. The paper tests concepts from compiler design and has a duration of 90 minutes.
This document contains an internal question paper for the 3rd semester Bachelor of Technology (B.Tech) class in Computer Science Engineering (CSE). It has 3 questions related to compiler design. Question 1 has parts on parse trees, syntax trees, differences between compilers and interpreters, and output stages of a compiler for an expression. Question 2 tests LL(1) grammars and construction of an SLR parsing table. Question 3 differentiates LR(0) and LR(1) items, describes shift-reduce and reduce-reduce conflicts, and involves designing a CLR parsing table. The paper tests concepts from compiler design and has a duration of 90 minutes.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1of 1
NRI INSTITUTE OF TECHNOLOGY
(An Autonomous Institution, Permanently Affiliated to JNTUK, Kakinada)
(Accredited by NAAC with ”A” Grade and ISO 9001:2015 Certified Institution) Pothavarappadu (V), Via Nunna, Agiripalli (M), PIN-521 212. Ph : 0866 – 2469666 Website : nrigroupofcolleges.com e-mail : nrihitech@rediffmail.com INTERNAL QUESTION PAPERS ACADEMIC YEAR: 2018 – 19 CLASS: III B.Tech – I Semester DATE: 05.08.2019 SUBJECTIVE TEST – I BRANCH: CSE Max. Time : 90 Minutes SUBJECT: Compiler Design Max. Marks: 30 Marks N.B. : 1. Answer all the THREE Questions. 2. ALL questions carry EQUAL marks.
Q.NO QUESTION MARKS BTL CO PO
a Demonstrate Parse tree and Syntax tree with an example. 2M II b List out the Differences between compiler and interpreter. 2M IV 1 What do you mean by front end in the compiler design? Show the output CO4 c produced by it in different stages for a:=b*c/36; where a, b and c are real 6M V numbers. a Why left recursion has to be eliminated from grammar? 2M I Solve the given grammar G: S 1AB|є, A1AC|0C, B 0S, C1 is LL(1) or 2 b not? 2M III CO5 Construct SLR Parsing table for the Grammar EE+T|T, TT*F|F, F(E)|id. c And also check the acceptance of input string id * id + id. 6M III a Differentiate LR(0) and LR(1) items. 2M III 3 b Write a Short Note on SR Conflict and RR Conflicts. 2M I CO6 c Design CLR Parsing table for the grammar S L = R|R, L* R|id, RL 6M VI