Question

•  
• Which of the following statement/s is/are false for the following language:
  L = {a^m bⁿ c^q | 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.
  1.   Only S2
  2.   Only S1
  3.   Both S1 and S2
  4.   Neither S1 nor S2

Comments

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.

---

this is beacause LR parsers are determinitic ..right??Thankyou

---

Yes.