0 0 votes Can DCFL be ambiguous? Theory of Computation theory-of-computation dcfl ambiguous + – h4kr 949 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply DebRC commented Feb 2, 2023 reply Follow flag A language cannot be ambiguous. A grammar can be ambiguous. A Deterministic CFG cannot be ambiguous, while a grammar-producing DCFL (not necessarily DCFG) can be ambiguous. 3 3 replyShare h4kr commented Feb 2, 2023 reply Follow flag thanks can you give an example 0 0 replyShare DebRC commented Feb 2, 2023 reply Follow flag @h4kr This is an example of a grammar which is ambiguous but produces a Deterministic CFL. https://gateoverflow.in/940/gate-cse-2003-question-51 1 1 replyShare Chandrabhan Vishwa 1 commented Feb 2, 2023 reply Follow flag Upto DCFL atleat one non ambiguous grammer exist this word also called as not Inherently ambiguous Language . if any language does not exist nonAmbiguos grammer then this grammer is inherently Ambiguos . if u telling about DCFL there is grammer exist which is nonambiguous so ambiguous word uses for the Grammer not for language but inherently ambiguous or not inherently ambiguous word use for the Language . 0 0 replyShare Ali. commented Feb 2, 2023 reply Follow flag For the record, even Regular Grammar can be ambigous. I learnt it the hard way. 3 3 replyShare Please log in or register to add a comment.