1 votes 1 votes Remove left recursion from the below grammar S->Aa / b A->Ac / Aad / bd / epsilon Compiler Design compiler-design parsing + – Vicky rix asked Aug 22, 2017 Vicky rix 607 views answer comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 22, 2017 reply Follow Share S--->Aa/b A--->A' / bdA' A'--->cA' / adA' /epsilon 1 votes 1 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes S-> Aa / b A->Ac /Aad / bd /eps Modified grammar: S->Aa / b A->bdA' / A' A'-> adA' / cA' / eps Manu Thakur answered Aug 22, 2017 • selected Aug 22, 2017 Manu Thakur comment Share Follow See all 4 Comments See all 4 4 Comments reply Shubhanshu commented Aug 28, 2017 reply Follow Share What are the parsers which support left recursive grammars? 0 votes 0 votes Manu Thakur commented Aug 28, 2017 reply Follow Share Bottom Up Parsers ( LR - Parsers) don't have any problem with left recursive grammars. 0 votes 0 votes Shubhanshu commented Aug 29, 2017 reply Follow Share and parsers like LL and Recursive decent parser not allow Left recursion right? 0 votes 0 votes Manu Thakur commented Aug 29, 2017 reply Follow Share yes, parser may go into infinite loop as it follows top-down approach 0 votes 0 votes Please log in or register to add a comment.