Register

context free grammar

• edited by
689 views

2 Answers

0 0 votes
The language generated will be

    ε UNION { All strings that start with “ a “ and # a’s greater than or equal to # b’s and no consecutive b’s are allowed } where # is a short hand notation for “ number of “
0 0 votes

for each ‘b’, the #a’s > #b’s (sub-string before ‘b’).

Voting & Accepting an answer helps improve the community
← Previous · #Combinatorics and C...Next → · context free grammar
← Previous in category · Complement of the ma...Next in category → · context free grammar
Position:
Show:

Related questions

2 2 votes
2 2 answers
1.5k
1.5k views
Sambhrant Maurya asked Oct 18, 2018
1,511 views
Context Free Grammar
Consider the following CFG 'G'S aA/bSS/SSA aAb/bAa/AA/εThe language generated by G is:a)Set of all strings with atleast one 'a'b)Set of all strings with atleast two a's...
1 1 vote
1 1 answer
3.2k
3.2k views
Mk Utkarsh asked Mar 22, 2018
3,193 views
Linear Ambiguous Context Free Grammar
Please post few examples of Linear Ambiguous Context Free Grammar.It would be helpful if you post grammars for famous languages.
0 0 votes
1 answers 1 answer
765
765 views
Srinivas Rao asked Apr 4, 2017
765 views
context free grammar
Do the following productions mean the sameBb->bb and B->bMy doubt is that will the first production be used only when we have b in the follow of B or it can be used in an...
1 1 vote
1 answers 1 answer
1.0k
1.0k views
gabbar asked Mar 25, 2017
1,038 views
context free grammar
Construct context-free grammars to accept the following languages.$$\begin{align*} \large L = \left \{ 0^i1^j2^k \;\; | \;\; i \neq j \;\; or \;\; j \neq k \right \} \end...