1 votes 1 votes Give an example of Unambiguous CFL which is not DCFL . Theory of Computation theory-of-computation context-free-language dcfl + – Himanshu1 asked Nov 2, 2015 retagged Jul 4, 2017 by Arjun Himanshu1 991 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes The set of all of EVEN PALINDROMES over ∑ = {0. 1} is an unambiguous language & it is not a DCFL. An unambiguous grammar for this language will be: S --> 0S0 | 1S1 | ∈ अनुराग पाण्डेय answered Nov 2, 2015 अनुराग पाण्डेय comment Share Follow See all 0 reply Please log in or register to add a comment.