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 ? Compiler Design gateforum-test-series compiler-design + – Gupta731 asked Nov 29, 2018 Gupta731 626 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments arya_stark commented Nov 29, 2018 reply Follow Share So here , $α1$ is $X$ $α2$ is $Sb$ $β1$ is $XS$ and $β2$ is $a$ 0 votes 0 votes Gupta731 commented Nov 29, 2018 reply Follow Share Yeah got it. I knew that process. Just some confusion was there in application of it. Thank you. 1 votes 1 votes arya_stark commented Nov 29, 2018 reply Follow Share Yoo Bro😃🤘 1 votes 1 votes Please log in or register to add a comment.