The Gateway to Computer Science Excellence
0 votes
52 views

Consider the following cfg

S → aSa | bSb | a | b

find the number of conflicts in LR(0) state diagram?

  1. 2
  2. 4
  3. 8
  4. 10
in Compiler Design by (245 points)
closed by | 52 views
0
2?
0

The given answer is 8



But after drawing table, I am getting 4 conflicts

0
4 conflicting entries in parsing table right?
0
Yup
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,314 answers
198,358 comments
105,085 users