R P Q R L Cfl Explain 2 Let L Apbqc L P Q R 0 P Q Course Q37096601

r or p-q-r)). Is L a CFL or not? Explain, of 2. Let L-(apbqc” l p,q, r > 0 and (p+ q course. Show transcribed image text r or p-q-r)). Is L a CFL or not? Explain, of 2. Let L-(apbqc” l p,q, r > 0 and (p+ q course.

Answer

Given L is context free language because we can makenon-deterministic pushdown automata.

Here, p+q = r or p = q+r

Logic used to make NPDA

OR

 

OR