0 votes 0 votes Compiler Design compiler-design testbook-test-series parsing + – Dheeraj Pant asked Nov 16, 2018 edited Mar 12, 2019 by ajaysoni1924 Dheeraj Pant 543 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Shivam Kasat commented Nov 16, 2018 reply Follow Share B is the answer.. 0 votes 0 votes Dheeraj Pant commented Nov 16, 2018 reply Follow Share Yes answer is B , but i have a doubt ...... there is an indirect right recursion with respect to @ (due to A --> B) , so we shouldn't consider that ??? 0 votes 0 votes Shivam Kasat commented Nov 16, 2018 reply Follow Share Yes we don't consider that indirect right recursion. But I don't know why we do so! 0 votes 0 votes Dheeraj Pant commented Nov 16, 2018 reply Follow Share Because if you will try to solve 2@[email protected] we can make two different parse trees to justify above.. one will do (2@3)@4 and other 2@(3@4) 0 votes 0 votes Dheeraj Pant commented Nov 16, 2018 reply Follow Share So in practice @ can show both left as well as right asociativity 0 votes 0 votes Shivam Kasat commented Nov 16, 2018 reply Follow Share Yes you are right! In this way @ is both left and right associative which is not possible. 0 votes 0 votes Dheeraj Pant commented Nov 16, 2018 reply Follow Share I think all options are correct except last one, please correct me if iam wrong. 0 votes 0 votes Shivam Kasat commented Nov 16, 2018 reply Follow Share Yeah D is the correct answer As A,B and C are correct statment 2 votes 2 votes Please log in or register to add a comment.