144 views
0 votes
0 votes
Which of the following statements/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.

(A) Only S1

(B) Only S2

(C) Both S1 and S2

(D) Neither S1 nor S2

Please log in or register to answer this question.

No related questions found