edited by
372 views
4 votes
4 votes

Consider the following given grammar and the parse tree for the sentence $x + y * z.$

The first reduction made by the shift-reduce parser is labeled as 1, and we keep labeling in the same increasing order, such that the 8th (here, the last) reduction made by the parser is labeled as 8.

Which of the following statements is TRUE regarding the labeling of reductions?

  1. $E \rightarrow T$ will be labeled 5.
  2. $E \rightarrow T$ will be labeled 3.
  3. $T \rightarrow T^* P$ will be labeled 6.
  4. $T \rightarrow T^* P$ will be labeled 7.
edited by

1 Answer

5 votes
5 votes

edited by
Answer:

Related questions

1.0k
views
0 answers
4 votes
GO Classes asked Feb 5
1,038 views
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?
928
views
1 answers
2 votes
474
views
2 answers
3 votes
GO Classes asked Feb 5
474 views
Select the grammatically incorrect sentence from the options given.The case holding the plates are broken.Either Ravi or Reena is attempting to come today.Both ... test.The overall sentiment in the office is negative regarding the reports.
345
views
1 answers
4 votes
GO Classes asked Feb 5
345 views
A class of 30 students was asked what they did on their winter holiday. 20 students said that they went skating. 9 students said that they went skiing. ... went skiing. How many students did not go skating and did not go skiing?161119