0 votes 0 votes Consider the following grammar: S→ a | ^ | ( T ) T→ T , S | S Draw the parse tree for “ (((a,a),^,(a)),a)” Compiler Design compiler-design + – Subhrangsu asked Apr 17, 2022 Subhrangsu 334 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kabir5454 commented Apr 17, 2022 reply Follow Share can you able to show your solution? 0 votes 0 votes Vishnu__ commented Apr 18, 2022 reply Follow Share shld we remove left recursion first? 0 votes 0 votes Please log in or register to add a comment.