Which of the following statement/s is/are false for the following language:
$$L = \{a^m b^n c^q \mid m = n \text{ 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