1 votes 1 votes state true /false 1) for every DCFL there exist at least one unambiguous grammar Theory of Computation theory-of-computation grammar dcfl + – Gurdeep Saini asked Nov 22, 2018 • edited Feb 25, 2019 by Gurdeep Saini Gurdeep Saini 575 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply kumar.dilip commented Nov 22, 2018 reply Follow Share This may help you. https://gateoverflow.in/135969/dcfls 1 votes 1 votes Gurdeep Saini commented Nov 22, 2018 reply Follow Share @kumar.dilip thanks so conclusion is there exist a least one unambiguous grammar for every DCFL 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes TRUE upto DCFL there exist at least one unambiguous grammar for every language .(that is for regular language and for DCFL) from CFL onward there may or may not exist unambiguous grammar Gurdeep Saini answered Feb 25, 2019 Gurdeep Saini comment Share Follow See all 3 Comments See all 3 3 Comments reply abhishekmehta4u commented Feb 25, 2019 reply Follow Share How to prove given language is ambiguous or not ?? 0 votes 0 votes akash.dinkar12 commented Feb 25, 2019 reply Follow Share @abhishekmehta4u how can u say particular language is ambiguous or not Can u give some example of such languages 0 votes 0 votes Gurdeep Saini commented Feb 25, 2019 reply Follow Share how can u say particular language is ambiguous or not there is no such terminology whether a language is ambiguous or not . ambiguous word is define for grammar not for language 0 votes 0 votes Please log in or register to add a comment.
