The context free grammar for the language \(L= \left\{a^{n}b^{m}c^{k} \mid k =…

PYQ UGC NET 2014

The context free grammar for the language L={anbmck∣k=∣n−m∣,n≥0,m≥0,k≥0}L= \left\{a^{n}b^{m}c^{k} \mid k = \mid n - m\mid , n \geq 0, m \geq 0, k \geq 0\right\} is

  1. A.

    S→S1S3,S1→aS1c∣S2∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λS \rightarrow S_{1}S_{3}, \\ S_{1} \rightarrow aS_{1}c \mid S_{2} \mid \lambda, \\ S_{2} \rightarrow aS_{2}b\mid \lambda, \\ S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\ S_{4} \rightarrow bS_{4}c \mid \lambda

  2. B.

    S→S1S3,S1→aS1S2c∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λS \rightarrow S_{1}S_{3}, \\ S_{1} \rightarrow a S_{1} S_{2}c \mid \lambda, \\ S_{2} \rightarrow aS_{2}b\mid \lambda, \\ S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\S_{4} \rightarrow bS_{4}c \mid \lambda

  3. C.

    S→S1∣S2,S1→aS1S2c∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λS \rightarrow S_{1} \mid S_{2}, \\S_{1} \rightarrow aS_{1}S_{2}c \mid \lambda, \\S_{2} \rightarrow aS_{2}b\mid \lambda, \\S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\S_{4} \rightarrow bS_{4}c \mid \lambda

  4. D.

    S→S1∣S3,S1→aS1c∣S2∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λS \rightarrow S_{1} \mid S_{3}, \\ S_{1} \rightarrow aS_{1}c \mid S_{2} \mid \lambda, \\ S_{2} \rightarrow aS_{2}b \mid \lambda, \\ S_{3} \rightarrow aS_{3}b \mid S_{4} \mid \lambda, \\ S_{4} \rightarrow bS_{4}c \mid \lambda

Attempted by 46 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…