5 votes 5 votes How to know whether L(G) is inherently ambiguous or not for a particular grammar 'G' ? Is there any algorithm for it ? Theory of Computation theory-of-computation + – ankitgupta.1729 asked Nov 14, 2017 ankitgupta.1729 541 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Red_devil commented Nov 14, 2017 reply Follow Share no...there is no algo... 0 votes 0 votes Naveen Kumar 3 commented Mar 1, 2018 reply Follow Share What is it meant by inherently ambiguous? 0 votes 0 votes ankitgupta.1729 commented Mar 1, 2018 reply Follow Share @Naveen , A Language is called Inherently Ambiguous if all the grammars which generates this language that all are ambiguous ie. if no unambiguous grammar exist for a language then it is called Inherently Ambiguous... "Whether a CFL is inherently ambiguous or not ?" This problem is undecidable .. Bcoz there is no algo for it...But I don't know it is undecidable for csl , recursive , recursive enumerable , non-recursive enumerable languages or not ? 1 votes 1 votes BASANT KUMAR commented Aug 19, 2018 reply Follow Share there is no any algorithm for finding whether a grammer is ambigious or not .it is undecidable for CFL,CSL,RECURSIVE,RECURSIVE ENUMERABLE because if lower level of grammer(CFG) is undecidable so automatically higher level of grammer will be undecidable. 0 votes 0 votes Please log in or register to add a comment.
