2 votes 2 votes Can DCFL be ambiguous? Theory of Computation theory-of-computation dcfl ambiguous + – h4kr asked Feb 2, 2023 • retagged Feb 2, 2023 by makhdoom ghaya h4kr 457 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments DebRC commented Feb 2, 2023 reply Follow Share @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 votes 1 votes Chandrabhan Vishwa 1 commented Feb 2, 2023 reply Follow Share 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 votes 0 votes Ali. commented Feb 2, 2023 reply Follow Share For the record, even Regular Grammar can be ambigous. I learnt it the hard way. 3 votes 3 votes Please log in or register to add a comment.
