Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Compiler Design:
Recent questions tagged compiler-design
1
votes
0
answers
1111
Coaching
Kuldeep Pal
200
views
Kuldeep Pal
asked
Oct 17, 2017
Compiler Design
compiler-design
+
–
2
votes
1
answer
1112
Compiler Zeal sheet
S - >aSb | c Give viable prefix for this with details of how to find viable prefix? for string - - aacbb
S - >aSb | cGive viable prefix for this with details of how to find viable prefix? for string - - aacbb
Kuldeep Pal
736
views
Kuldeep Pal
asked
Oct 17, 2017
Compiler Design
compiler-design
viable-prefix
zeal-workbook
+
–
0
votes
0
answers
1113
SELF DOUBT
PLEASE SUGGEST ME THE PROCEDURE TO DRAW AN DAG FOR INTERMEDIATE CODE AND SOME RESOURCES TO STUDY REGISTER ALLOCATION AND SPILLING FROM
PLEASE SUGGEST ME THE PROCEDURE TO DRAW AN DAG FOR INTERMEDIATE CODE AND SOME RESOURCES TO STUDY REGISTER ALLOCATION AND SPILLING FROM
Venkat Sai
201
views
Venkat Sai
asked
Oct 14, 2017
Compiler Design
co-and-architecture
compiler-design
+
–
1
votes
2
answers
1114
Number of derivation trees
`How many derivation trees are there to derive string"te" from below grammer:- G->ATE | g | $\epsilon$ A->TE | a | $\epsilon$ T-> t | $\epsilon$ E-> e | $\epsilon$
How many derivation trees are there to derive string"te" from below grammer:-G->ATE | g | $\epsilon$A->TE | a | $\epsilon$T- t | $\epsilon$E- e | $\epsilon$
rahul sharma 5
1.6k
views
rahul sharma 5
asked
Oct 14, 2017
Compiler Design
compiler-design
grammar
parsing
+
–
2
votes
0
answers
1115
Compiler Design:- Number of conflicts in LR(0)
Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)?
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
rahul sharma 5
1.5k
views
rahul sharma 5
asked
Oct 14, 2017
Compiler Design
compiler-design
lr-parser
grammar
parsing
+
–
0
votes
0
answers
1116
Compiler design: Number of rows in parsing table
Consider the following augmented grammar G which is used to build LR (0) parsing table. E' __> E E __> E+T/T T __> T*F/F F -->(E)/id How many rows are there in the parsing rable ? a)11 b)12 c)13 d)14
Consider the following augmented grammar G which is used to build LR (0) parsing table.E' __ EE __ E+T/TT __ T*F/FF >(E)/idHow many rows are there in the parsing rable ?...
rahul sharma 5
1.3k
views
rahul sharma 5
asked
Oct 14, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
0
answers
1117
Compiler:- Find error in C statement
Find the C statement which has a syntax error. fi(z); for(a, b, c); whil(a, b); fi (z); for (a, b, c); whil (a, b); None of these. This is a modification of https://gateoverflow.in/33320/identify-syntax-error
Find the C statement which has a syntax error.fi(z);for(a, b, c);whil(a, b);fi (z);for (a, b, c);whil (a, b);None of these.This is a modification of https://gateoverflow....
rahul sharma 5
1.3k
views
rahul sharma 5
asked
Oct 13, 2017
Compiler Design
compiler-design
+
–
1
votes
0
answers
1118
self doubt
can anyone tell me the features of LR(K) grammers ? how is it different from LL(K)
can anyone tell me the features of LR(K) grammers ? how is it different from LL(K)
Venkat Sai
138
views
Venkat Sai
asked
Oct 13, 2017
Compiler Design
compiler-design
+
–
9
votes
2
answers
1119
# Error
Q) For each of the following C statements state whether they contain lexical error, syntax error, semantic error or no error(along with reason) - i) inta radius =5; ii) x=127b + z; iii) printf("%d=%d\n", x); iv) int p[10]; x=25 + p;
Q) For each of the following C statements state whether they contain lexical error, syntax error, semantic error or no error(along with reason) -i) inta radius =5;ii) x=1...
Kaifi7
819
views
Kaifi7
asked
Oct 12, 2017
Compiler Design
compiler-design
lexical-analysis
+
–
1
votes
0
answers
1120
Compiler Design
For the block-structured C code below, indicate the values assigned to w, x, y, and z. int w, x, y, z; int i = 4; int j = 5; { int j = 7; i = 6; w = i + j; } x = i + j; { int i = 8; y = i + j; } z = i + j;
For the block-structured C code below, indicate the values assigned to w, x, y, and z.int w, x, y, z; int i = 4; int j = 5; { int j = 7; i = 6; w = i + j; } x = i + j; { ...
Pranabesh Ghosh 1
411
views
Pranabesh Ghosh 1
asked
Oct 12, 2017
Compiler Design
compiler-design
+
–
1
votes
0
answers
1121
Syntax directed translation
gautamcse27
345
views
gautamcse27
asked
Oct 10, 2017
Operating System
compiler-design
+
–
1
votes
1
answer
1122
What chapters from Compiler Design Principles & Tools 2nd edition should I do?
Namit Dhupar
339
views
Namit Dhupar
asked
Oct 9, 2017
Compiler Design
compiler-design
reference-book
+
–
5
votes
1
answer
1123
Compiler design: Counting number of tokens
void main() { i/*nt*/a=10; return; } Number of tokens in above code:?
void main(){i/*nt*/a=10;return;}Number of tokens in above code:?
rahul sharma 5
5.6k
views
rahul sharma 5
asked
Oct 9, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
4
votes
1
answer
1124
Compiler Lexical analyzer
int main() { print("%d",a); return 0; } If i execute,i will get error as:- prog.c:112:17: error: 'a' undeclared (first use in this function) printf("%d",a); Now as this is the semantic error,so how ... analyzer can give the row number and column number of error as it tokenize the entire program but is this also possible in sematic analyzer?
int main(){ print("%d",a); return 0;}If i execute,i will get error as:- prog.c:112:17: error: 'a' undeclared (first use in this function) printf("%d",a);Now as this...
rahul sharma 5
721
views
rahul sharma 5
asked
Oct 9, 2017
Compiler Design
lexical-analysis
compiler-design
compiler-tokenization
+
–
5
votes
1
answer
1125
#Lexical_Analysis
Marcos & prepocessor directive (#define, #include) are handle by which phase of compiler ?? Or it is not input to compiler,it is alredy handled in preprocessor??? Please explain in detail..
Marcos & prepocessor directive (#define, #include) are handle by which phase of compiler ?? Or it is not input to compiler,it is alredy handled in preprocessor???Please e...
Harsh Mehta
747
views
Harsh Mehta
asked
Oct 7, 2017
Compiler Design
compiler-design
lexical-analysis
+
–
2
votes
1
answer
1126
# Parsing
What are the differences between strong LL(k) parsing and LL(k) parsing?
What are the differences between strong LL(k) parsing and LL(k) parsing?
Kaifi7
282
views
Kaifi7
asked
Oct 7, 2017
Compiler Design
compiler-design
parsing
+
–
2
votes
1
answer
1127
#Parsing
How to check in the grammar that which parsing method works more efficient for it? For eg in the following grammar - S-> Aa/b S->a Options - a) Top - Down b) Bottom - up c) Both d) None of these Answer is b.
How to check in the grammar that which parsing method works more efficient for it?For eg in the following grammar -S- Aa/bS->aOptions -a) Top - Downb) Bottom - upc) Bothd...
Kaifi7
600
views
Kaifi7
asked
Oct 7, 2017
Compiler Design
compiler-design
grammar
parsing
+
–
2
votes
1
answer
1128
compiler-design -tokens
rajoramanoj
1.3k
views
rajoramanoj
asked
Oct 6, 2017
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
made-easy-test-series
+
–
1
votes
0
answers
1129
self doubt
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; } - what is the error in this code semantic or syntax phase error ?? answer is given semantic but i think its a syntax phase error because in parse tree how can we derive 'in z' above which is not declared
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; }- what is the error ...
Venkat Sai
315
views
Venkat Sai
asked
Oct 6, 2017
Compiler Design
compiler-design
+
–
2
votes
1
answer
1130
MadeEasy Subject Test: Compiler Design - Grammar
rajoramanoj
334
views
rajoramanoj
asked
Oct 6, 2017
Compiler Design
made-easy-test-series
compiler-design
grammar
+
–
2
votes
2
answers
1131
MadeEasy Subject Test: Compiler Design - Parsing
EXPLAIN...
EXPLAIN...
rajoramanoj
496
views
rajoramanoj
asked
Oct 6, 2017
Compiler Design
made-easy-test-series
compiler-design
first-and-follow
parsing
+
–
7
votes
1
answer
1132
No of Temporary Variable required
Consider the following $3-$address code. $t_1=t+e$ $t_2=g+a$ $t_3=t_1+t_2$ $t_4=t_2+t_2$ $t_5=t_4+t_3$ There are five temporary variables in above code. The minimum number of temporary variables that can be used in the equivalent optimised $3-$address code of above code are ______________. Can anyone Confirm How many temporary variables required here.? I got 3 .
Consider the following $3-$address code.$t_1=t+e$$t_2=g+a$$t_3=t_1+t_2$$t_4=t_2+t_2$$t_5=t_4+t_3$There are five temporary variables in above code. The minimum number of t...
junaid ahmad
602
views
junaid ahmad
asked
Oct 5, 2017
Compiler Design
compiler-design
three-address-code
numerical-answers
+
–
2
votes
1
answer
1133
dag#intermediatecode
Minimum number of edges in the dag that represents the expression : x + x + x + x + x + x + x + x + x
Minimum number of edges in the dag that represents the expression :x + x + x + x + x + x + x + x + x
pm9999
549
views
pm9999
asked
Oct 5, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
+
–
0
votes
0
answers
1134
made-easy
I tried to traverse from left to right depth first and evaluating semantic rules, but getting stuck when i reach " T'---> empty " As its semantic rule can't be evaluated at that point because T'.i value is still left to calculate. I think the question is wrong ? What you think ?
I tried to traverse from left to right depth first and evaluating semantic rules, but getting stuck when i reach " T' - empty " As its semantic rule can't be evaluated at...
♥_Less
470
views
♥_Less
asked
Oct 3, 2017
Compiler Design
compiler-design
syntax-directed-translation
+
–
3
votes
1
answer
1135
LL Grammar: how does look ahead affect left recursion and left factoring
lets consider a grammar as: $A\rightarrow Ab | Ac | a$ while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left factoring. I was wondering that what ... symbol, A to decide the production rule to be applied. any further insights about the same will be very helpful.
lets consider a grammar as:$A\rightarrow Ab | Ac | a$while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left f...
AskHerOut
1.6k
views
AskHerOut
asked
Oct 1, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
+
–
6
votes
2
answers
1136
REGULAR GRAMMARS
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars? (a) S → ε, A → aS|b (b) A → aB|a, B → bA|b (c) A → Ba|Bab (d) A → abB|aB please explain how u proceed? The answer is given "b"
if a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars?(a) S → ε, A → aS|b (b) A → aB|a, B → bA|b(c) A → Ba|B...
VIKRAM KASANA
3.0k
views
VIKRAM KASANA
asked
Oct 1, 2017
Compiler Design
regular-grammar
compiler-design
regular-language
+
–
6
votes
1
answer
1137
Number of tokens in the C program
Given answer is 25, while my answer is 26, they have considered -10.0 as single token, which is wrong?
Given answer is 25, while my answer is 26, they have considered -10.0 as single token, which is wrong?
Manu Thakur
4.6k
views
Manu Thakur
asked
Sep 29, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
6
votes
1
answer
1138
DAG COMPILER
A) 2 B)3 C) 4 D) 5
A) 2B)3C) 4D) 5
set2018
3.1k
views
set2018
asked
Sep 28, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
2
votes
1
answer
1139
Compilers: Lexical Error
This screenshot is token from the book Ullman, How can following be a lexical error? because "elipseSize" should have a token recorded as an identifier.
This screenshot is token from the book Ullman,How can following be a lexical error? because "elipseSize" should have a token recorded as an identifier.
Manu Thakur
1.6k
views
Manu Thakur
asked
Sep 26, 2017
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
2
votes
1
answer
1140
UGC NET CSE | June 2009 | Part 2 | Question: 34
A compiler that runs on one machine and produces code for a different machine is called : Cross compilation One pass compilation Two pass compilation None of the above
A compiler that runs on one machine and produces code for a different machine is called :Cross compilation One pass compilation Two pass compilation N...
rishu_darkshadow
1.9k
views
rishu_darkshadow
asked
Sep 23, 2017
CO and Architecture
ugcnetcse-june2009-paper2
compiler-design
compilation-phases
+
–
Page:
« prev
1
...
33
34
35
36
37
38
39
40
41
42
43
...
68
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register