Recent questions tagged context-free-language

3 votes
2 answers
571
$L1$ is a Context free language (CFL), $L2$ is a Deterministic Context free language (DCFL)and , $L = L1 \cap\overline{L2}$then $L$ isa) Need not be CFLb) not CFLc)DCFL
1 votes
0 answers
573
Write a CFG for language L= {a m b n c p d q | m +n = p + q }
1 votes
3 answers
574
how to approach$L=\{a^mb^nc^pd^q\ |\ m+n=p+q \}$give grammar for it???
3 votes
1 answer
575
I read some where that if thier is one comparision at any time then only CFL otherwise CSL?plz give proof.
8 votes
3 answers
577
1 votes
1 answer
579
2 votes
1 answer
581
2 votes
1 answer
583
5 votes
2 answers
584
$L = \{ a^i b^j c^k d^l \mid i+k=j+l \}$Is L context free? If yes, then draw PDA. If no, why?
4 votes
2 answers
587
4 votes
2 answers
588
4 votes
4 answers
589
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ?i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language ...
67 votes
3 answers
592
44 votes
7 answers
596
Consider a CFG with the following productions.$S \to AA \mid B$$A \to 0A \mid A0 \mid 1$$B \to 0B00 \mid 1$$S$ is the start symbol, $A$ and $B$ are non-terminals and 0 an...
23 votes
6 answers
598
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one?$L_1.L_2$$L_1 \cap L...
32 votes
8 answers
599