Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Compiler Design:
Recent questions tagged compiler-design
0
votes
1
answer
61
first follow self doubt
Does Follow and First operation always apply on non left recursive grammar?
Does Follow and First operation always apply on non left recursive grammar?
Sajal Mallick
155
views
Sajal Mallick
asked
Oct 13, 2023
Compiler Design
compiler-design
first-and-follow
+
–
0
votes
1
answer
62
#syallabus completion
HELLO SIR , SIR I HAVE LEFT WITH TOC, CD , DM AND CN AND I THOUGHT , I SHOULD LEAVE ANY TWO OF THESE SO THAT I CAN FOCUS ON REVISION PROPERLY… SO , I WANT TO KNOW THAT WHICH 2 OF THESE SHOULD LEFT ASIDE .
HELLO SIR , SIR I HAVE LEFT WITH TOC, CD , DM AND CN AND I THOUGHT , I SHOULD LEAVE ANY TWO OF THESE SO THAT I CAN FOCUS ON REVISION PROPERLY… SO , I WANT TO KNOW THAT ...
jaswinder
196
views
jaswinder
asked
Oct 12, 2023
GATE
out-of-gate-syllabus
discrete-mathematics
theory-of-computation
computer-networks
compiler-design
goclasses
+
–
0
votes
1
answer
63
madeeasy testseries
nihal_chourasiya
203
views
nihal_chourasiya
asked
Oct 9, 2023
Compiler Design
made-easy-test-series
compiler-design
static-single-assignment
+
–
0
votes
0
answers
64
#self doubt
Can someone explain the chart and table for the below grammar for LR(1)? E->num E->E+E/E*E
Can someone explain the chart and table for the below grammar for LR(1)?E->numE->E+E/E*E
Dknights
100
views
Dknights
asked
Oct 8, 2023
Compiler Design
compiler-design
+
–
0
votes
1
answer
65
Made Easy Test Series
Can anyone draw the transition diagram for this augmented grammar in LR(1) parser? $S’\rightarrow S$ $S\rightarrow A|B$ $A\rightarrow fAi|n$ $B\rightarrow fBii|d$ for the above augmented grammar the number of states in LR(1) parser are________.
Can anyone draw the transition diagram for this augmented grammar in LR(1) parser?$S’\rightarrow S$$S\rightarrow A|B$$A\rightarrow fAi|n$$B\rightarrow fBii|d$for the ab...
Rohit Chakraborty
354
views
Rohit Chakraborty
asked
Oct 6, 2023
Compiler Design
compiler-design
made-easy-test-series
parsing
numerical-answers
+
–
0
votes
0
answers
66
3 address code
Consider the following 3-address code given below. START EXIT Match the following (I)Number of nodes in control flow graph (P)4 (II)Number of edges in control flow graph (Q)5 (III) Number of basic block in control flow graph (R)7 (IV) Number of control block in control flow graph (T)7
Consider the following 3-address code given below.STARTEXITMatch the following(I)Number of nodes in control flow graph (P)4(II)Number of edges in control ...
24aaaa23
210
views
24aaaa23
asked
Oct 2, 2023
Compiler Design
compiler-design
three-address-code
+
–
0
votes
1
answer
67
compiler design
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively. Find P*Q X = Y + Z Z = X + M E = X + Y M = E – Y T = Z – M X = T + Y
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively.Find P*QX = Y + ZZ = X + ME = X + YM = E – YT = Z – MX = T ...
24aaaa23
186
views
24aaaa23
asked
Oct 1, 2023
Compiler Design
compiler-design
+
–
0
votes
0
answers
68
viable prefix
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G. E -> –E E -> –(E) E -> –(E+E) E -> –(id+E) E -> –(id+id) Which of the option is not viable prefix of any sentential form?
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G.E - –EE - –(E)E - –(E+E)E - –(...
24aaaa23
166
views
24aaaa23
asked
Oct 1, 2023
Compiler Design
compiler-design
grammar
+
–
0
votes
0
answers
69
compiler design
how many handles are detected by bottom up parser for string a+a*a? grammar is E->E+T|T T->T*F|F F->a please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
how many handles are detected by bottom up parser for string a+a*a?grammar isE->E+T|TT->T*F|FF->aplease draw the whole procedure and explain how bottom up parser does ri...
24aaaa23
165
views
24aaaa23
asked
Oct 1, 2023
Compiler Design
compiler-design
grammar
+
–
0
votes
0
answers
70
compiler design
how many handles detected by bottom up parser for string a+a*a? grammar is E->E+T|T T->T*F|F F->a please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
how many handles detected by bottom up parser for string a+a*a?grammar isE->E+T|TT->T*F|FF->aplease draw the whole procedure and explain how bottom up parser does right m...
24aaaa23
129
views
24aaaa23
asked
Sep 30, 2023
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
71
compiler design
no of tokens in b=/* /*b;
no of tokens inb=/* /*b;
24aaaa23
210
views
24aaaa23
asked
Sep 29, 2023
Compiler Design
compiler-design
+
–
1
votes
2
answers
72
Unacademy Compiler Design Workbook
Consider the following statements: (A) LL (k) grammars have one to one correspondence with DCFLs. (B) LR (k) grammars have one to one correspondence with CFLs. A is true but B is false A is false but B is true Both are False Both are True
Consider the following statements:(A) LL (k) grammars have one to one correspondence with DCFLs.(B) LR (k) grammars have one to one correspondence with CFLs. A is true bu...
lovish_bhatia
350
views
lovish_bhatia
asked
Sep 12, 2023
Compiler Design
compiler-design
syntax-directed-translation
lexical-analysis
context-free-grammar
context-free-language
+
–
1
votes
2
answers
73
Unacademy Compiler Design Workbook
Conisder the following program: Main() { int x = 10; If (x<20 ; Else y = 20; } When lexical analyzer scanning the above program, how many lexical errors can be produced?
Conisder the following program:Main(){ int x = 10;If (x<20 ;Elsey = 20;}When lexical analyzer scanning the above program, how many lexical errors can be produced?
lovish_bhatia
314
views
lovish_bhatia
asked
Sep 12, 2023
Compiler Design
compiler-design
lexical-analysis
syntax-directed-translation
+
–
0
votes
1
answer
74
made easy gate cs 23 test series
Given a grammar: there is a right most derivation S1 → Sc → SAc → SaSbc. Thus, SaSbc is a right sentential form, and its handle is __
Given a grammar:there is a right most derivation S1 → Sc → SAc → SaSbc.Thus, SaSbc is a right sentential form, and its handle is __
kaustubh7
277
views
kaustubh7
asked
Aug 29, 2023
Compiler Design
compiler-design
parsing
+
–
0
votes
0
answers
75
made easy gate 23 test series
Consider the following grammar: 1. S → CC 2. C → cC 3. C → d The number error entries in canonical parsing table for grammar is __.
Consider the following grammar:1. S → CC2. C → cC3. C → dThe number error entries in canonical parsing table for grammar is __.
kaustubh7
320
views
kaustubh7
asked
Aug 29, 2023
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
76
made easy test series
Identify the number of leaders in the following code segment:
Identify the number of leaders in the following code segment:
kaustubh7
391
views
kaustubh7
asked
Aug 29, 2023
Compiler Design
compiler-design
made-easy-test-series
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
67
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register