Recent questions tagged compiler-design

0 votes
1 answer
1141
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
0 votes
1 answer
1142
in syntax directed translation top down translation is in syllabus?
0 votes
5 answers
1144
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
1 votes
2 answers
1145
S >AaAb /BbBaA >epsilonB ->epsiloncheck whether grammar is LL(1),LR(0) OR SLR(1)
0 votes
1 answer
1147
0 votes
0 answers
1150
Pls. Explain Bootstrapping in Compilers (in detail) & what are the advantages of it ?
1 votes
1 answer
1153
What is difference between lexems and tokens please explain with example
1 votes
2 answers
1154
0 votes
1 answer
1156
Q. Consider the following CFG.E → E ∗ T | T+E | TT → (T ∗ F) | FF → idCan we generate following string(id∗id∗id)
1 votes
1 answer
1159
Out of LL(2) and LR(1) which is more powerful?
2 votes
2 answers
1160
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
2 votes
1 answer
1161
Q. Which of the following parameter is not included in the activation record of recursive function call?1.Local variables of function2.Return value of function3. Global v...
1 votes
1 answer
1162
Q. Consider the following grammar :1. S → XYX 2. X → Yc3. X → sX 4. X → ε5. Y → eXFind the first an...
1 votes
2 answers
1163
Here a as well as c can be the answer based on the construction of the parse tree. So how to decide which one to choose?
1 votes
0 answers
1164
3 votes
1 answer
1165
The action of parsing the source program into the proper syntactic classes is known as1. Lexical Analysis2. Syntax Analysis3. Interpretation Analysis4. Parsing
1 votes
2 answers
1166
0 votes
1 answer
1167
Which of the following is not LR(1)?a. S->Uab|VacU->dV->db. S->Uab|Vab|VacU->dV->dc.S->ABA->aB->bd. A->AbA->a|cPlease Explain.
1 votes
1 answer
1168
In 3 address code format can LHS be repeated ?For eg if we have expression a + b*c then t1 = a t2 = b*c t1 = t1 + t2 or t3 = t1 + t2 which one is correct?
3 votes
1 answer
1169
0 votes
0 answers
1170
If a non deterministic CFL is not inherently ambiguous can it be parsed by some LR(1) parser??