870 views
0 0 votes

Suppose Grammars given:-

S→ Bbb

B→ epsilon

If we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right??

Because B→ epsilon would be same as B→ . right? Please make this clear.

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
2 2 answers
5.5k
5.5k views
goluabhinan asked Sep 16, 2018
5,480 views
Which of the following optimization techniques are typically applied on loops?(a) Removal of invariant computation (b) Elimination of induction variables(c) Peephole opti...
0 0 votes
1 answers 1 answer
1.4k
1.4k views
sushmita asked Jan 18, 2017
1,428 views
is DAG in compiler syllabus?
1 1 vote
1 answers 1 answer
1.2k
1.2k views
sushmita asked Jan 17, 2017
1,174 views
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT?CAN SOMEONE EXPLAIN??
0 0 votes
1 1 answer
602
602 views
abhiyodayapandey asked Jan 7, 2024
602 views
Find the minimum number of total variables in SSA form:a = b + mm = a + ed = b + mb = a + e