in Compiler Design
621 views
0 votes
0 votes
Consider the following Grammar G

S-->SX|SSb|XS|a

X-->a|Xb

The number of productions in the grammar(including epsilon production) after removing left recursion is ?
in Compiler Design
621 views

4 Comments

So here ,

$α1$   is  $X$

$α2$   is  $Sb$

$β1$   is  $XS$

and $β2$  is  $a$
0
0
Yeah got it.

I knew that process. Just some confusion was there in application of it.

Thank you.
1
1
Yoo Bro😃🤘
1
1

Please log in or register to answer this question.