0 votes 0 votes Ques. S --> Aa/bAc/dc A --> d Isn't this grammar Ambiguous? If First(S) has more than one production giving the same first value, isn't it ambiguous? Compiler Design ambiguous grammar + – Warlock lord asked Aug 22, 2017 • retagged Jul 12, 2019 by Cristine Warlock lord 864 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply stblue commented Aug 22, 2017 reply Follow Share No you can't say grammar is ambiguous, just by looking at first of some production, if checking grammar is ambiguous or not is that easy then its won't become an unsolved problem. Always take some input string and check whether multiple parse trees are possible are not. Above grammar is unambigious, take any input string which is accepted by the grammer, you wont get 2 parse tree. 0 votes 0 votes Warlock lord commented Aug 22, 2017 reply Follow Share Ok got it. Is this an LL(1)? 0 votes 0 votes stblue commented Aug 22, 2017 reply Follow Share No, its not LL(1), Entry [S, d] in LL(1) parsing table will contain 2 entries, so you can't decide what to do when top of the stack is S and next input symbol is d. 1 votes 1 votes Please log in or register to add a comment.