Recent questions tagged compiler-design

1 votes
2 answers
1051
Are recursive descent parsers with backtracking or without?
0 votes
1 answer
1054
0 votes
1 answer
1055
First {a} =?First{a, b} =?First{a, b, c} =?First {a, $} =?Where a, b, c are terminals.
0 votes
1 answer
1056
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
2 votes
0 answers
1057
Can anyone explain why operator precedence parsing cannot handle unary minus,and what are the approach to handle it.
3 votes
1 answer
1059
8 votes
3 answers
1060
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...
1 votes
1 answer
1062
Power of Predictive parser and recursive decent parser is same?
0 votes
0 answers
1063
0 votes
0 answers
1065
Do we need to study Assembler in Compiler Design. It's just I saw questions on Assembler in GO book, but all those questions were from 90's. So, do we need to study Asse...
2 votes
1 answer
1066
1 votes
2 answers
1067
0 votes
2 answers
1069
For the below given grammar:S→-SS→S-aS→aThe number of inadequate states (states which have conflicts) and number of shift reduce conflicts are _____ and _____ respe...
1 votes
1 answer
1072
S- L=R|RL->*R|idR->Lcan someone draw the states with lookaheads?i am always getting confused on what should be the lookahead along with the grammarand how to find if ther...
1 votes
1 answer
1073
0 votes
1 answer
1074
2 votes
1 answer
1075
someone please explain how to draw operator precedence table to solve this question.
0 votes
1 answer
1076
0 votes
2 answers
1077
–2 votes
1 answer
1078
1 votes
1 answer
1080
Match the description of several parts of a classic optimizing compiler in $\textbf{List-I}$, with the names of those parts in $\textbf{List-II}$ :$\begin{array}{clcl} & ...