Register

context free grammar

• retagged by
295 views

1 Answer

0 votes
0 votes
the language generated by this grammar is regular and  in regular expression form this grammar can be written as (a+b)*

and we know that this expression is regular hence we can say that the language generated by this grammar is regular language
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

303
views
2 answers
0 votes
moe12leb asked Jan 21, 2023
303 views
context free grammar
what is the langauge generated by this grammar ?S-->aS | aSbS | ε what is the language
User Avatar
238
views
0 answers
0 votes
moe12leb asked Nov 28, 2022
238 views
Context Free Grammar
Find context-free grammars for the following languageL = { w : na(w) = 2nb(w); where w belongs {a, b}*}
User Avatar
376
views
1 answers
0 votes
moe12leb asked Nov 28, 2022
376 views
Context Free Grammar
Find context-free grammars for the following languageThe complement of the language L = belongs {a^n, b^n}
User Avatar
954
views
2 answers
2 votes
Sambhrant Maurya asked Oct 18, 2018
954 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 ... )Set of all strings with atleast one more 'a' than number of b'sd)None of these
User Avatar
Link Copied!