The context free grammar for the language L={anbmck∣k=∣n−m∣,n≥0,m≥0,k≥0} is
- A.
S→S1S3,S1→aS1c∣S2∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λ
- B.
S→S1S3,S1→aS1S2c∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λ
- C.
S→S1∣S2,S1→aS1S2c∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λ
- D.
S→S1∣S3,S1→aS1c∣S2∣λ,S2→aS2b∣λ,S3→aS3b∣S4∣λ,S4→bS4c∣λ
Attempted by 46 students.