0 votes 0 votes Which of the following statement/s is/are false for the following language: L = {am bn cq | m = n or n = q, m > 0, n > 0, q > 0} S1: The language can be parsed by any LR(K) parsers for any value of K. S2: The language cannot be recognized by deterministic PDA. Only S2 Only S1 Both S1 and S2 Neither S1 nor S2 Compiler Design theory-of-computation compiler-design + – Akriti sood asked Dec 10, 2016 Akriti sood 1.1k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply focus _GATE commented Dec 10, 2016 reply Follow Share S2: The language cannot be recognized by deterministic PDA (this statement is true) anyone explain s1 :?? 0 votes 0 votes Akriti sood commented Dec 10, 2016 reply Follow Share @kunal,why the language cannot be accepted by deterministic PDA??can you explain ?is it cuz of OR in the grammar ?but it can be accepted by non-deterministic PDA..right?? but they are separate conditions..so they can be accepted by DPDA na?? 0 votes 0 votes focus _GATE commented Dec 10, 2016 reply Follow Share yes, one comparison with OR condition makes its cfl. we cannot accept it by DPDA. 0 votes 0 votes Akriti sood commented Dec 10, 2016 reply Follow Share alright and if it would have been AND then,it could'nt be accepted by cfl also then..right?? and if language is L 1= {am bn cq dp | m = n or p = q, m > 0, n > 0, q > 0,p>0} and if language is L 2= {am bn cq dp | m = n AND p = q, m > 0, n > 0, q > 0,p>0} then please tell which is cfl anf which is dcfl?? thankyou 0 votes 0 votes Gate Mission 1 commented Dec 10, 2016 reply Follow Share Every LR(K) parser can handle DCFL but as here the language is NCFL ,so we cannot have an LR(K) parser for it. Hence S1 is wrong. 2 votes 2 votes Akriti sood commented Dec 10, 2016 reply Follow Share this is beacause LR parsers are determinitic ..right??Thankyou 0 votes 0 votes Gate Mission 1 commented Dec 10, 2016 reply Follow Share Yes. 0 votes 0 votes Please log in or register to add a comment.