+29 votes
2.9k views

Choose the correct alternatives (more than one may be correct ) and write the corresponding letters only:

Consider the $SLR(1)$ and $LALR (1)$  parsing tables for a context free grammar. Which of the following statement is/are true?

1. The goto part of both tables may be different.
2. The shift entries are identical in both the tables.
3. The reduce entries in the tables may be different.
4. The error entries in tables may be different

edited | 2.9k views
0
I understood what a Shift entry is, a Reduce entry is and goto part is in parsing table. But what is an error entry?
+4
blank in the parsing table

## 2 Answers

+26 votes
Best answer
• Goto part & shift entry must be same.
• Reduce entry & error entry may b different due to conflicts.

Correct Answer: $B,C,D$

edited
0
Seeing some examples we can say that the goto entries and shift entries are same but can give u some ,logic behind it and why is not affected by the lookahead symbols present in LALR(1) parser .
+2
in LALR(1) we merge LR(1) items states with same LR(0) items but with different lookaheads
+9
answer must be b,c,d
0
• Reduce entry & error entry may b different due to conflicts. I think reduce entries are different because of look a heads.
+2
yes Reduce entries are different because of look aheads due to combining of states.

Reduce(LALR) >= Reduce(SLR)
0

Anu007  can you explain how "Reduce(LALR) >= Reduce(SLR)"? Does it means LALR can have more reduce entries than SLR?

0

Reduce entries in LALR and SLR are different unless Follow of nonterminals != Lookaheads

We can't always say that Reduce(LALR) >= Reduce(SLR)

In LALR we place reduce only in Lookaheads but in SLR we place it in FOLLOWs

Corrrect me if i am wrong

0
The Answer should be B, C & D.

Shift Entries are also identical in both SLR(1) & LALR(1).
0
Same applies for LR(0) as well right?
0
Yes
0

@Verma Ashish how?..... number of state in LR(0) & SLR(1)  not same

0

where i said that?

0
you said "yes".for this question answer applicable for also LR(0).
0
And there is no option about number of states..right?

Ofcourse there will be same number of states in slr(1), LR(0) and LALR(1).

But if question is about LR(0) and SLR(1) or LR(0) and LALR(0) then also same options will be correct...(that's why i added "yes" in that comment)
0
Bro.. number of state in LR(0)<=SLR(1)=LALR(1)..... it will be effect on GOTO entries .... so how can you say that This ans is also applicable for "LR(0) & SLR(1)" or  "LR(0) & LALR(1)"......................GOTO entries same because of number of state ........let me know if i am wrong
0
Number of states in LR(0) parsing table are always equal to states in SLR(1)..it can never be less
0
thank you very much  for correct me
0
If in ques asked for slr and clr then what would be ans?
+2 votes

All the LR parsers differ just in the placement of reduce moves.

The entire GoTo part is the same for LR(0), SLR(1), LALR(1) and CLR(1).

The placements of shift-moves is the same for LR(0), SLR(1), LALR(1) and CLR(1).

However, they differ in the placement of reduce moves. Which, in turn, makes them differ in the blank spaces(error entries) left in the parsing table.

Options B, C and D

How they differ in the placement of reduce moves in the parsing table?

1. LR(0) puts reduce moves in the entire row for the final item.

2. SLR(1) puts reduce moves only in the Follow() of LHS of the final item.

3.  CLR(1) puts reduce moves only in the lookaheads of the final item.

4. LALR(1) puts reduce moves in all the merged lookaheads for same final items. (You need to get a grip over LR(1) items to get this line)

+4 votes
1 answer
3
+12 votes
3 answers
4