Recent questions tagged compiler-design
Register

Recent questions tagged compiler-design

Recent questions tagged compiler-design
0 votes
0 answers 14 views
#SelfDoubt #First and Follow
Hi guys can anyone help me to find that what will be the First and Follow set for this production? {A->BaA|epsilon, B->bB|ABC|epsilon, C->B}
arnab2022 asked in Compiler Design Aug 24
by arnab2022
5 points
14 views
0 votes
0 answers 31 views
How to design Turing machine for addition of 2 binary numbers
ykrishnay asked in Theory of Computation Aug 18
by ykrishnay
103 points
31 views
0 votes
0 answers 19 views
#Made Easy practice Book # Left-Recursion
Given a LR grammar {S->A|B, A->Aa|epsilon, B->Bb|Sc|epsilon} can I solve it in following way? 1) S->A|Bb|Sc|epsilon (Placing B’s productions in S) => AS' | BbS' | epsilon & S'->cS' | epsilon 2) A->A' & A'->aA' | epsilon 3)B->ScB' | B' & B'->bB' | epsilon
arnab2022 asked in Compiler Design Jul 18
by arnab2022
5 points
19 views
0 votes
0 answers 32 views
GATE-2017 set-01
Errors violating the condition ‘any variable must be declared before its use’ are detected during semantic analysis. Why cannot it come under syntax analysis? Does declaration not fall under Syntax?
GreyMatter asked in Compiler Design Jul 14
by GreyMatter
5 points
32 views
0 votes
0 answers 19 views
#Self Doubt #Recursive CFG
Are all recursive grammar may it direct or indirect produce infinite language?
arnab2022 asked in Compiler Design Jul 13
by arnab2022
5 points
19 views
0 votes
0 answers 19 views
Gate 2021 Compiler Design Modified Question Doubt
In the following gate 2021 question from compiler design, https://gateoverflow.in/357425/gate-cse-2021-set-1-question-26 suppose option C is modified as : The actions can be used to type-check syntactically correct boolean variable declarations BUT ... rule using the production D → bool ID. Then, will option C be correct in addition to option B ?
debendra2021 asked in Compiler Design Jun 1
by debendra2021
5 points
19 views
0 votes
0 answers 19 views
Applied Gate Live CD-2
Consider the basic block given below: a=10 b=4*a t1=i*j c=t1+b t2=15*a d=t2*c e=i t3=e*j t4=i*a c=t3+t4 The minimum number of nodes present in the DAG representation of the above basic block is _____.
bg_kenZ asked in Compiler Design May 28
by bg_kenZ
5 points
19 views
0 votes
0 answers 20 views
Workbook Question Found on Web
rahul0521 asked in Compiler Design May 15
by rahul0521
5 points
20 views
0 votes
0 answers 27 views
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.
Prubhtej_9 asked in Compiler Design Apr 3
by Prubhtej_9
5 points
27 views
0 votes
0 answers 33 views
#Madeeasywork book
Caption
Pradeep Verma asked in Compiler Design Mar 12
by Pradeep Verma
5 points
33 views
3 votes
2 answers 481 views
GATE CSE 2021 Set 1 | Question: 31 | Video Solution
Arjun asked in Compiler Design Feb 18
by Arjun
1.5k points
481 views
1 vote
0 answers 29 views
Parsing table
Can we generate different parsing table for grammar
SHWETA RAO asked in Compiler Design Feb 14
by SHWETA RAO
9 points
29 views
0 votes
0 answers 25 views
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
ruqyya asked in Compiler Design Feb 10
by ruqyya
5 points
25 views
0 votes
1 answer 51 views
quest is from compiler design subject BSCS topic errors
ruqyya asked in Compiler Design Feb 10
by ruqyya
5 points
51 views
1 vote
0 answers 66 views
Made Easy Test
How to solve it?
Parth27 asked in Compiler Design Jan 29
by Parth27
163 points
66 views
0 votes
0 answers 78 views
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?
5andy asked in Compiler Design Jan 26
by 5andy
5 points
78 views
0 votes
0 answers 46 views
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
Sneha negi asked in Compiler Design Jan 23
by Sneha negi
9 points
46 views
0 votes
0 answers 27 views
Made Easy Test series
Answer will 8 or 9? i got 9 (according to me no optimization should be done in Intermediate representation form)
Nitinkumar.097 asked in Compiler Design Jan 13
by Nitinkumar.097
13 points
27 views
0 votes
0 answers 119 views
Intermediate 3 address code generation doubt related to unary operators in an arithmetic expression
rish-18 asked in Compiler Design Dec 30, 2020
by rish-18
9 points
119 views
0 votes
0 answers 24 views
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
eyeamgj asked in Compiler Design Dec 28, 2020
by eyeamgj
29 points
24 views
0 votes
0 answers 19 views
PREVIOUS YEAR STATIC and GLOBAL SCOPE
https://gateoverflow.in/89082/gate1989-8b WHAT IS CORRECT ANSWER PLEASE SEE…. I M GETTING 0
eyeamgj asked in Programming Dec 25, 2020
by eyeamgj
29 points
19 views
0 votes
0 answers 19 views
ACE Academy Test series problem. Need explanation. According to them Option C is correct.
taurus05 asked in Compiler Design Dec 24, 2020
by taurus05
7 points
19 views
0 votes
0 answers 82 views
Madeeasy Test series Compiler Q4
Anyone please clarify.
Shivateja MST asked in Compiler Design Dec 14, 2020
by Shivateja MST
45 points
82 views
0 votes
0 answers 19 views
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.
Shivateja MST asked in Compiler Design Dec 13, 2020
by Shivateja MST
45 points
19 views
0 votes
0 answers 36 views
Made-Easy test Series - Compiler Design, Parsing, 2021
sankalpmittal asked in Compiler Design Dec 12, 2020
by sankalpmittal
41 points
36 views
0 votes
0 answers 60 views
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.
luc_Bloodstone asked in Compiler Design Dec 8, 2020
by luc_Bloodstone
19 points
60 views
Page:
Ask
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun