0 votes 0 votes Get LL(1) parsing table for the following grammar A--> aCDq / aBg C --> p /Ct / BD / rAB D--> d B-->e Compiler Design compiler-design parsing ll-parser descriptive + – Sagar Chintawar asked Feb 11, 2019 • retagged Jun 22, 2022 by Lakshman Bhaiya Sagar Chintawar 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes May be wrong? Anyone pls verify: First (C) = p,r,e Arko Jyoti Shith answered Feb 15, 2019 Arko Jyoti Shith comment Share Follow See all 3 Comments See all 3 3 Comments reply subhrob commented Feb 15, 2019 i edited by subhrob Feb 15, 2019 reply Follow Share We need to have the actual production in the table. For example in 'A' row and 'a' column, we need to have the productions A--> aCDq / aBg Similarly we need to correct the other entries in the table 0 votes 0 votes Arko Jyoti Shith commented Feb 15, 2019 reply Follow Share Yes this was an example the grammer is not LL(1) as there are two entries in [A,a] . Is this correct? Columns for g,q,t,$ are empty and is [C,e] = C-> BD??? 0 votes 0 votes subhrob commented Feb 15, 2019 reply Follow Share yes, you are right, the grammar is not LL(1) as there are 2 entires in [A,a] 0 votes 0 votes Please log in or register to add a comment.
