Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

0 answers

CollegeAssignment
Draw the canonical collection of lr(0) item s-->da|ab a-->ba|c B-->bB|c. Find out whether the grammar is LR(0) or not and SLR(1) or not.

asked Apr 3 in Compiler Design by Prubhtej_9 (5 points) | 5 views

0 votes

0 answers

#Madeeasywork book
Caption

asked Mar 12 in Compiler Design by Pradeep Verma (5 points) | 17 views

+1 vote

0 answers

Parsing table
Can we generate different parsing table for grammar

asked Feb 14 in Compiler Design by SHWETA RAO (9 points) | 19 views

0 votes

0 answers

self doubt compiler design
char c = ‘a’; How many tokens the above statement has. My doubt is about the single quote.'a' is taken as 1 token or 3?

asked Feb 11 in Compiler Design by rahul65 (5 points) | 15 views

0 votes

0 answers

compiler construction self doubt
Consider the following grammar S → S ; T | T T → s Construct DFA of LR(1) Items Show the parsing stack for the input string s;s;s

asked Feb 10 in Compiler Design by ruqyya (5 points) | 15 views

0 votes

1 answer

quest is from compiler design subject BSCS topic errors

answered Feb 10 in Compiler Design by zxy123 (3.6k points) | 30 views

+1 vote

0 answers

Made Easy Test
How to solve it?

asked Jan 29 in Compiler Design by Parth27 (163 points) | 24 views

0 votes

0 answers

self doubt: Compiler Design
(i) if a non token were in the code would it be counted in the lexical analysis? (ii) and will it generate an error in the lexical analysis phase or simply ignore that and count rest of the tokens? like, in this code : ifx = 12*54; what would be the output from lexical analysis phase?

asked Jan 26 in Compiler Design by 5andy (5 points) | 46 views

0 votes

0 answers

Doubt Compiler design
what are the minimum number of registers required without any register splitting in following case c=a+b; d=a+b; as we can see at instruction 1, a and b are live c is dead at instruction 2 also a and b are live d is dead how many min register ... only. so according to that only 2 variable at max are live at any point so 2 register should be required..what would be the answer

asked Jan 23 in Compiler Design by Sneha negi (9 points) | 24 views

0 votes

1 answer

selfdoubt madeeasy test series
Consider the basic block given below. u=u+v v=v+w x=v-w y=v-x z=u+v Find the sum of the minimum no of edges and nodes present in the DAG representation of the basic block given above.

answered Jan 22 in Compiler Design by zxy123 (3.6k points) | 13 views

0 votes

1 answer

Self doubt Madeeasy test series
Choose the correct output when the lexical analyzer scans the following input: “cabacccab”.

answered Jan 22 in Compiler Design by SarathBaswa (849 points) | 26 views

0 votes

0 answers

asked Jan 18 in Compiler Design by val_pro20 (2 points) | 14 views

0 votes

0 answers

Directed Acyclic Graph in CD
Can anyone provide me good reference for solving Directed Acyclic Graphs(DAG) problems?

asked Jan 15 in Compiler Design by nikhil856 (13 points) | 14 views

0 votes

0 answers

Made Easy Test series
Answer will 8 or 9? i got 9 (according to me no optimization should be done in Intermediate representation form) [closed]

asked Jan 13 in Compiler Design by Nitinkumar.097 (13 points) | 18 views

0 votes

0 answers

Ace Test Series
I know A,B,C are valid answer But can anyone confirm if D is also valid..We have epsilon in RHS it should not be Operator Grammer so D should be also valid???...can i get help

asked Jan 9 in Compiler Design by vipin.gautam1906 (9 points) | 19 views

0 votes

0 answers

Intermediate 3 address code generation doubt related to unary operators in an arithmetic expression

asked Dec 30, 2020 in Compiler Design by rish-18 (9 points) | 76 views

0 votes

1 answer

self doubt ambiguous to unambiguous
https://gateoverflow.in/141809/ambiguous-to-unambiguous what will be the unambiguous grammar …...

answered Dec 29, 2020 in Compiler Design by zxy123 (3.6k points) | 17 views

0 votes

1 answer

Number system,Gate-2021, previous year Gate questions

answered Dec 29, 2020 in Compiler Design by zxy123 (3.6k points) | 30 views

0 votes

0 answers

madeeasy notes
S->AB A->a B->b is ambiguous or not ? i think not ambiguous becz not having two same left most derivation tree or not hab=ving two same RMD tree…...is it correct

asked Dec 28, 2020 in Compiler Design by eyeamgj (29 points) | 16 views

0 votes

0 answers

madeeasy test series
https://gateoverflow.in/284952/madeeasy-series-compiler-design-static-single-assignment what is the correct answer i am getting 6 after doing simplification 7 without minimization ….

asked Dec 27, 2020 in Compiler Design by eyeamgj (29 points) | 22 views

0 votes

0 answers

ACE Academy Test series problem. Need explanation. According to them Option C is correct.

asked Dec 24, 2020 in Compiler Design by taurus05 (7 points) | 13 views

0 votes

1 answer

Made Easy SubjectWise
can someone tell why is First(B)={b,a,ε} here?? why ‘c’ is not included

answered Dec 24, 2020 in Compiler Design by saurabh111 (11 points) | 41 views

+1 vote

1 answer

self doubt(first and follow/left recursion)
(1)S->AA/ab A->Bd/null B->SB/d (2) S->AB/a A->SA/null B->AB/d doubt 1--->i can’t able to remove indirect left recursion from both the questions,what is grammar after removing left recursion?? doubt 2--->what is the FIRST and FOLLOW ?

answered Dec 16, 2020 in Compiler Design by zxy123 (3.6k points) | 27 views

0 votes

0 answers

GATE OVERFLOW QUERIES
came across this question on gate overflow. please help with solution

asked Dec 16, 2020 in Compiler Design by Bgupta (5 points) | 20 views

+1 vote

1 answer

#madeeasytestseries
x=x*x y=y*y x=x*y y=y*x Minimum number of total variables in single static assignment for above code?

answered Dec 15, 2020 in Compiler Design by Sahil91 (683 points) | 24 views

0 votes

0 answers

Madeeasy Test series Compiler Q4
Anyone please clarify.

asked Dec 14, 2020 in Compiler Design by Shivateja MST (45 points) | 51 views

0 votes

1 answer

MadeEasy test series question 2020
Consider the following statements : S1) Three Address Code is a linearized representation of syntax tree S2) With triples representation optimization can change execution order. Which of the above is correct ? only S1 only S2 both S1 and S2 None of the above Anyone please clarify.

answered Dec 13, 2020 in Compiler Design by udbhav94 (5 points) | 63 views

0 votes

1 answer

Made easy Compiler design Q3
Anyone please clarify why lexical error is generated.

answered Dec 13, 2020 in Compiler Design by Deepakk Poonia (Dee) (1.5k points) | 52 views

0 votes

0 answers

Made easy compiler question 2
Which of the following is/are not the functions of Syntax analyzer ? Recognize the language and to call the appropriate action routines that will generate the intermediate form or matrix for these constructs. Build a literal table and an ... Build a uniform symbol table Parse the source program into basic elements or tokens of the language. Anyone please clarify.

asked Dec 13, 2020 in Compiler Design by Shivateja MST (45 points) | 12 views

0 votes

0 answers

Made-Easy test Series - Compiler Design, Parsing, 2021

asked Dec 12, 2020 in Compiler Design by sankalpmittal (41 points) | 27 views

0 votes

1 answer

Madeeasy Testseries 2020 Q1
Here answer seems to be option A but given as D. Anyone please clarify

answered Dec 12, 2020 in Compiler Design by Sahil91 (683 points) | 48 views

0 votes

0 answers

Made Easy Compiler Test: Syntax Phase
I don’t understand it at all, if someone can elaborate these options then it would be a great help.

asked Dec 8, 2020 in Compiler Design by luc_Bloodstone (19 points) | 26 views

0 votes

1 answer

ACE Test Series : Subject Wise Test Compiler Design

answered Dec 7, 2020 in Compiler Design by Sahil91 (683 points) | 74 views

0 votes

0 answers

COMPILER DESIGN
Prove that 1. “There are DCFLs which doesnot have an LL(k) grammar” “For any DCFL, we can always have an LR(1) grammar”

asked Dec 5, 2020 in Compiler Design by SHIV_KANNAUJ (9 points) | 19 views

0 votes

0 answers

Made Easy Test Series

asked Dec 3, 2020 in Compiler Design by Vishal_kumar98 (37 points) | 44 views

0 votes

0 answers

#made-easy #compiler-design
S→ ABA A→ Bc|dA|epsilon B→ eA How many entries have multiple productions in LL(1) table? ans given is 1. but i am getting 2 In answer Follow(A)={c,e,$} but according to me it should be {c,d,e,$}

asked Dec 3, 2020 in Compiler Design by 404 found (37 points) | 24 views

0 votes

1 answer

Self Study Doubt
Lex File %{ #include "y.tab.h" %} %% [a-zA-Z_][a-zA-Z_0-9]* return letter; [0-9] return digit; . return yytext[0]; \n return 0; %% int yywrap() { return 1; } YACC PART: %{ #include<stdio.h> int v=1; %} %token ... the YACC C. Lex return two tokens to the YACC D. RECOGNIZE A VALID VARIABLE WHICH STARTS WITH A LETTER FOLLOWED BY ANY NUMBER OF LETTERS OR DIGITS Fe

answered Nov 29, 2020 in Compiler Design by zxy123 (3.6k points) | 30 views

0 votes

0 answers

ME subjectwise
No grammar with empty production can be LR(0)?? Is the statement true

asked Nov 26, 2020 in Compiler Design by Ashutosh777 (-219 points) | 23 views

0 votes

1 answer

Nielit 2020 paper
Type of Conflicts that arises in LR(0). A Shift Re conflict B Shift shift conflict C Shift reduce and shift shift conflict. D none of the above

answered Nov 23, 2020 in Compiler Design by zxy123 (3.6k points) | 33 views

0 votes

1 answer

Just thinking about it
Since Reduce entries in both LR(0) and SLR(1) are different. so does that mean error entries will also be different in these two.

answered Nov 23, 2020 in Compiler Design by zxy123 (3.6k points) | 22 views

To see more, click for all the questions in this category.

Recent questions and answers in Compiler Design

9,197 questions

3,182 answers

14,686 comments

96,162 users