7. What language does the grammar with these productions generate (5 points)? S + Aa, AB,...

Question

Question

7. What language does the grammar with these productions generate (5 points)? S + Aa, AB, B → Aa

engineering Computer-Science

Answer 1

Answer #1

7)ANSWER)

Given Grammar

S->Aa

A->B

B->Aa

There is no terminating production in given grammar.So the given grammar accepts φ... means it doesn't generating any language.

Answer 2

Answer #2

Not terminated

source: Mind

answered by: Belay

Answer 3

Similar Homework Help Questions

15. Give a simple description of the language generated by the grammar with productions SaaA, A...

15. Give a simple description of the language generated by the grammar with productions SaaA, A -> bS 16. What language does the grammar with these productions generate? A ->B B- Aa
What language does the grammar below generate? S rightarrow abS | aA A rightarrow aA |...

What language does the grammar below generate? S rightarrow abS | aA A rightarrow aA | a Select the correct answer. L = {(ab)^n aaa^m: n greaterthanorequalto 0, m greaterthanorequalto 0} L = {(ab)^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 2} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1}
Remove all lambda-productions, unit-productions, and useless productions from the following grammar.

Remove all lambda-productions, unit-productions, and useless productions from the following grammar.S -> AB | BC | aAbA -> Aa | D | lambdaB -> aSC | bB | lambdaC -> aC | bBCD -> abS | ab

4. Consider the following context-free grammar S SSSS a (a) Show how the string aa+a* can...

4. Consider the following context-free grammar S SSSS a (a) Show how the string aa+a* can be generated by this grammar (b) What language does this grammar generate? Explain
For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba...

For the following grammar (7 points) 1. B - Ba|A S - ABb A - Aba |A to find a grammar without A productions that generates the same language, we first identify non-terminals that drive A. These non-terminals are: A and B. Then from S - ABb, we construct S from A - Aba, we construct A - from B - Ba, we construct B - So, the grammar without A that generates the same language is:
Give a set notation definition of the language generated by the grammar S → aS |...

Give a set notation definition of the language generated by the grammar S → aS | aA | a A → aAb | ab

11. Find a left-linear grammar for the language L((aaab*ba)*).

-Find a left-linear grammar for the language L((aaab*ba)*). -Find a regular grammar that generates the language L(aa* (ab + a)*).-Construct an NFA that accepts the language generated by the grammar.S → abS|A,A → baB,B → aA|bb
Remove the λ - productions from the grammar: S → aAb | BBa A → bb...

Remove the λ - productions from the grammar: S → aAb | BBa A → bb B → AA | λ
Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by

Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by Construct a regular grammar G (a" b) c (aa bb)? VT, S, P) that generates the language generated by

Find a derivation tree in Example 5.1 ({S}, {a, b}, S, P), with productions The grammar...

Find a derivation tree in Example 5.1 ({S}, {a, b}, S, P), with productions The grammar G - aSa, bSb S is context-free. A typical derivation in this grammar is S aSa aa Saa aabSbaa aabbaa This, and similar derivations, make it clear that {a, b}'} L (G) wwR