Recent questions tagged context-free-language

2 votes
0 answers
543
7 votes
4 answers
545
Which of the following sentences can be generated by S - aS $\mid$ bAA - d $\mid$ cAbccddabbccaabcabcabcd
3 votes
1 answer
546
If language $L=\{a^n b^n \mid n \geq 0\}$, then language $L^2$ is given by$\{a^{2n} b^{2n} \mid n \geq 0\}$$\{a^n b^n a^n b^n \mid n \geq 0\}$$\{a^n b^n \mid n \geq 0\}$$...
1 votes
2 answers
547
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ inChomsky normal formGreibach norma...
0 votes
1 answer
548
What does this Language Represents ? And what is the machine which is able to represent this Language.L = { a^i b^j c^k d^l } where i = k or j = lHow it is different fro...
6 votes
7 answers
549
Consider the grammar$S \rightarrow ABCc \mid bc$$BA \rightarrow AB$$Bb \rightarrow bb$$Ab \rightarrow ab$$Aa \rightarrow aa$Which of the following sentences can be derive...
1 votes
1 answer
550
The context free grammar for the language $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 $S \rightarrow S_{1}S_{3}, S_{1} \...
1 votes
2 answers
551
12 votes
1 answer
554
Construct a context free grammar (CFG) to generate the following language:$L = \{a^nb^mc^{n+m}: \text{n, m are integers, and } n \geq 1, m \geq 1 \}$
2 votes
1 answer
564
1 votes
1 answer
566
Consider the language L1 = { apbqcr / p,q,r >= 0} and L2 = { apbqcr ​/ p,q,r >= 0 and p=r} Then L1 - L2 is regular of CFL ?
5 votes
2 answers
567
2 votes
2 answers
568
Follow(S) comes as {(, ). $ }So, do we count $ as terminal or not.Could anyone please tell me, $ should be considered as terminal or not ? Although I think, I should not...
3 votes
2 answers
569
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
5 votes
4 answers
570
Consider the following push down automata.The language accepted by above PDA is_______.Regular but infinite.DCFL but not regular.CFL but not DCFLFinite language.