0 votes 0 votes Theory of Computation theory-of-computation grammar context-free-language + – Rahul Jain25 asked Oct 9, 2016 • retagged Jul 4, 2017 by Arjun Rahul Jain25 603 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Prashant. commented Oct 9, 2016 i edited by Prashant. Oct 9, 2016 reply Follow Share remove B, C and D since they never end with terminal symbol. 3 0 votes 0 votes Rahul Jain25 commented Oct 9, 2016 reply Follow Share @Anirudh, why B is not removed?? Because B rule does not teminate?? 0 votes 0 votes Prashant. commented Oct 9, 2016 reply Follow Share ya B is also be removed. 0 votes 0 votes Rahul Jain25 commented Oct 9, 2016 reply Follow Share @Anirudh here S has B in its rule should S also be removed???bcoz S is also not terminating, then will S be removed or its rule will be changed, and if we change what will that rule. 0 votes 0 votes Shubhanshu commented Oct 13, 2017 reply Follow Share @Rahul Jain25 @Prashant. we will remove D, C, B After all these the only production of S will also be removed as it contain an useless varaiable B. so I think answer should be 0. crct me if I am wrong. 0 votes 0 votes Please log in or register to add a comment.
