2 votes 2 votes S→ A/a A→ a LL1 or not? Compiler Design compiler-design ll-parser syntax-directed-translation + – Hirak asked Jun 4, 2019 Hirak 973 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply srestha commented Jun 4, 2019 reply Follow Share not LL1 1 votes 1 votes Hirak commented Jun 4, 2019 reply Follow Share Because S--> A and S--> a are the two productions of S for 'a' right? 1 votes 1 votes srestha commented Jun 4, 2019 reply Follow Share yes.. 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes this is not LL(1) because intersection is there,both are going to same cell infact this grammer is ambiguous. Ambiguous grammer cannot parse by any parsers except operator precedence parser Ravijha answered Jun 20, 2019 Ravijha comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes If a grammar is ambiguous then it never be LL(1),LR(0),SLR,LALR,CLR. Given grammar is ambiguous . So its not LL(1) abhishekmehta4u answered Jun 4, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Given grammar is ambiguous .even 2 parse tree generated for a string 'a'. and if the grammar is ambiguous it can not be LL(1), LR(0),SLR(1), LALR(1) and CLR(1) also. prashant dubey answered Jun 6, 2019 prashant dubey comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Not LL(1) ..not pair wise disjoint Anup dogrial answered Jan 16, 2020 Anup dogrial comment Share Follow See all 0 reply Please log in or register to add a comment.