0 votes 0 votes S→ aS | bS | epsilon what is the language generated by this grammar ? Theory of Computation theory-of-computation context-free-grammar + – moe12leb asked Jan 21, 2023 • retagged Jan 21, 2023 by makhdoom ghaya moe12leb 276 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Gateprep#2022 answered Jan 21, 2023 Gateprep#2022 comment Share Follow See all 0 reply Please log in or register to add a comment.
