Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
100+ Database of Compiler Design PYQs Through Single Revision Pages (in Hindi)
1,492 plays

In this course, Sweta Kumari will cover important Previous year Questions on compiler design from different topics like phases of compiler, syntax directed translation, Parsing , LL1, LR Parsing, First & Follow, Lexical Analysis, ICG & Runtime etc.

Sweta Kumari is teaching live on Unacademy Plus

Sweta Kumari
YouTuber (channel : GATE NoteBook) | Verified Educator | 2+ year Online Teaching Experience

Unacademy user
i could hear the whistles of night watchman
Mahesh Balyan
a year ago
sbaash.. bda dhyan diya aapne 😄
thank you so much mam
Sweta Kumari
7 months ago
Pj Kaur
7 months ago
mam it's a request please AP vaisa lessons provide krdo jaisa apne toc k regular language and context free k Lia kra tha...vaisa e toc and programing k upr practice lessons bna do..jaisa exams me questions ate hai vaisa krke
Pj Kaur
7 months ago
and mam Maine 5 year baad gate ka exam dia to jruri nhi first attempt me hojye 5 marks se pecha reh gya...but m apne tyri nhi chodunge continue krunga job k sth b..but please provide that type of lessons so that I also complete net preparation
  1. WELCOME TOunacademy unacademy Explore v Login Signup Join India's largest learning platform Enroll in courses and watch lessons from India's best educators Search Courses Topies&Educator

  2. Sweta KumariVERIFIED ABOUT ME Verified Educator I Software Engineer ISelected in 2 IT MNC(Java) IResearch Paper (NCCCS) IQuora Writer 12 yr Teaching Exp. FOLLOW M 154 courses 28.2k Followers 234 Following GATE CSE 2019 FULL LENGTH TARGET GATE CSE 201 UNACADEMY PLUS 10 DAYS MOCK TEST CRASH COURSE By Sweta Kumari By Sweta Kumari G Crash Course With Important Topics & PYQs for GATE CSE 2019 (Hindi)10 Days Crash Course- GATE CSE 2019 (Hindi) Full Length Mock Test with Answers - GATE CSE 2019 6 Lessons 20 Lessons View Details


  4. Which of the following is true? (A) Canonical LR parser is LR (1) parsertable is generated in first pass but it with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers (C) Both (A) and (B) (D) None of the above UGC NET 2014 In a two-pass assembler, symbol I. Lexical Analysis is specified by context-free grammars and need two pass to scan whole source implemented by pushdown file. While one pass assembler scan automata whole file in a go. Il. Syntax Analysis is specified by UGC NET 2014 regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? A bottom-up parser generates right-most derivation in reverse. UGC NET 2014 x=x*(a + b)-5; Count Tokens? ->12 UGC NET 2017 UGC NET 2018 Which phase of compiler generates stream of atoms? I. A function of a linker is to combine several object modules into a single load module. Which one from the following is UGC NET 2015 false? ALAL parser is Bottom-Up parserI. A function of a linker is to (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1) (C) LR parser is Bottom- Up parser.modules. GATE 2011 replace absolute references in an object module by symbolic references to locations in other In a compiler, keywords of a language are recognized during the lexical analysis. Lexical analysis is the process of converting a sequence of characters into a sequence of tokens. A token can be a keyword. (D) In L/(1), the l1 indicates that there UGC NET 2017 is a one symbol look - ahead UGC NET 2015

  5. ISRO 2015 ISRO 2015 Incremental-Compiler is a compiler compiles only those portion of source code that have been modified. Which is OperatorY Grammar? YACC is the standard parser generator for Unix operating system. It is used as a parser in C programming language. It stands for Yet Another Compiler Compiler. ISRO 2018 2) A CcBb 3) A BaC 4) A DU-chains(Definition-Use) in compiler design (A) consist of a definition of a variable and all its uses, reachable from that definitiorn (B) are created using a form of static code analysis (C) are prerequisite for many compiler optimization including constant propagation and common sub-expression elimination (D) All of the above Which is True about SR and RR-conflict: (A) If there is no SR-conflict in CLR(1) then definitely there will be no SR-conflict in LALR(1). (B) RR-conflict might occur if lookahead for final items(reduce-moves) is same. (C) Known that CLR(1) has no RR-conflict, still RR conflict might occur in LALR(1) (D) All of the above. ISRO 2018 EXTRA DOSE E-> E * F I F + E I F ISRO 2017 The output of a lexical analyzer is stream of tokens. ISRO 2015

  6. Which one of the following statements is FALSE? (A) Context-free grammar can be used to specify 1 both lexical and syntax rules (B) Type checking is done before parsing. (C) High-level language programs can be translated to different Intermediate Representations. D) Arguments to a function can be passed using the program stack. Syntax-Directed Translation is used in following cases Conversion of infix to Postfix Calculation of infix expression 2. For creating a Acyclic graph 3. Type Checking 4. Conversion of Binary number to Decimal 5. Counting the numbers of bits (0 or 1) in a binary number 6. Creation of syntax tree 7. To generate Intermediate code GATE 2018 I GATE 1998 8. Storing the data into Symbol table A. Lexical analysis B. Parsing C. Register allocation 3. Post-order traversal D. Expression evaluation 4. Production tree Converting an infix expression to the postfix form efficiently? 1. Graph coloring 2. DFA minimization GATE 1997 GATE 2015 Which of the following is the most powerful parsing method? Which of the following derivations does a top-down parser use while parsing an input string? GATE 1999 GATE 2000

  7. ISRO 2015 GATE 2003 The number of tokens in the following C statement is printf("i1%d, &.2%x", i&i); A Syntax Directed Definition (SDD) is called S Attributed if it has only synthesized attributes. L-Attributed Definitions contain both synthesized and inherited attributes but do not need to build a dependency graph to evaluate them. GATE 2004 GATE 2005 Consider a program P that consists of two source modules M1 and M2 contained in two different files. If M1Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the contains a reference to a function defined in M2 the reference will be resolved at Consider the grammar grammar be n1, n2 and n3 respectively. The following relationship holds good GATE 2003 Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between nl and n2 is GATE 2003 Consider the grammar shown below.

  8. Consider the grammar with the following translation rules and E as the start symbol E-> E1 #T {E.value = E1.value * T.Value) | TIE.value= T.value) T-> T1 & F{T.value = T1.value + F.value} FT.value F.valuel F-num F.value num.valuej Compute E.value for the root of the parse tree for the expression:2 #3 & 5 # 6 &4. Which of the following grammar rules violate the requirements of an operator grammar? P, Q, R are nonterminals, andr,s,t are terminals. (ii) P -> QSR (iii) P- (iv) P-> QtRr GATE CS 2004 The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called GATE CS 2004 GATE CS 2001 Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order. GATE CS 2001