1 votes 1 votes Theory of Computation theory-of-computation grammar + – Vicky rix asked Apr 1, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 710 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes All are deterministic CFL. See, if your problem can be defined by using one condition completely then your problem can be solved by using PDA. In the above problems all are can be defined just by using one condition. rude answered Apr 1, 2017 • selected Apr 15, 2017 by rude rude comment Share Follow See 1 comment See all 1 1 comment reply Anmol Verma commented Oct 18, 2018 reply Follow Share @rude....the question is asked about what is the grammar for the given language......and not about it is DCFL or not.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes A) S -> aSb / b B) S -> aSb /a C) S -> aSbb /E D) option D is same as A just solving the equation suryaprakash answered Feb 8, 2018 suryaprakash comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Anmol Verma commented Oct 18, 2018 reply Follow Share So what will be the Grammar for B) 0 votes 0 votes Verma Ashish commented Oct 18, 2018 reply Follow Share even his grammar for A is also wrong.. I found something for B) https://stackoverflow.com/questions/36360541/context-free-grammar-for-languages-with-more-number-of-as-than-bs 0 votes 0 votes Anmol Verma commented Oct 18, 2018 reply Follow Share Yes... 0 votes 0 votes Please log in or register to add a comment.
