2 votes 2 votes Compiler Design compiler-design grammar left-recursion recurrence-relation test-series + – rahuldb asked Jan 31, 2017 retagged Jul 18, 2022 by makhdoom ghaya rahuldb 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes S -> Aa/Sa/c A -> Ab/Sd/e after substituting the value of S in terms of A S -> Aa/Sa/c; A -> Ab/ Aad/e/Aaa/ca; after removing left recursion S -> cS'/ AaS'; S' -> aS'/epsilon; A -> eA'/caA' A' -> bA'/adA'/aaA'/epsilon $ruthi answered Aug 10, 2017 edited Aug 10, 2017 by $ruthi $ruthi comment Share Follow See 1 comment See all 1 1 comment reply Manu22 commented Mar 2, 2018 reply Follow Share How did you get Aaa and ca after substituting the value of S in terms of A in the second production? 0 votes 0 votes Please log in or register to add a comment.