Recent questions tagged compiler-design

0 votes
1 answer
61
Does Follow and First operation always apply on non left recursive grammar?
0 votes
1 answer
62
0 votes
0 answers
64
Can someone explain the chart and table for the below grammar for LR(1)?E->numE->E+E/E*E
0 votes
1 answer
67
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 ...
0 votes
0 answers
68
0 votes
0 answers
69
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...
0 votes
0 answers
70
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...
0 votes
1 answer
71
no of tokens inb=/* /*b;
1 votes
2 answers
73
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?
0 votes
1 answer
74
Given a grammar:there is a right most derivation S1 → Sc → SAc → SaSbc.Thus, SaSbc is a right sentential form, and its handle is __
0 votes
0 answers
75
Consider the following grammar:1. S → CC2. C → cC3. C → dThe number error entries in canonical parsing table for grammar is __.
0 votes
1 answer
76
Identify the number of leaders in the following code segment: