Consider the following grammar: <S> → <A> a b <A> → <A> b | b...

Question

Question

Consider the following grammar: <S> → <A> a b <A> → <A> b | b...

Consider the following grammar:

<S> → <A> a b
<A> → <A> b | b
→ a | a

Which of the following sentences are in the language generated by this grammar?

baab
bbbab
bbaaaaaS
bbaab

Please explain why

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

<A> generates one or more consecutive b's
<B> generates one or more consecutive a's

so, <A> a <B> b generates
One or more b's followed by Two a's followed by a b

Answer: baab, bbaab

Add a comment

Answer 2

Similar Homework Help Questions

Consider the following grammar: <S> → <A> a b <A> → <A> b | b...

Consider the following grammar: <S> → <A> a b <A> → <A> b | b → a | a Is the following sentence in the language generated by this grammar? baab Consider the following grammar: <S> → a <S> c | <A> | b <A> → c <A> | c → d | <A> Is the following sentence in the language generated by this grammar? acccbcc SHOW WORK
Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start...

Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start symbol; 0 and 1 are terminal symbols): S → AA A → BCB B → B0 | B1 | 0 | 1 C → 00 | 11 Which of the following sentences are in the language generated by the grammar? Show derivations for the sentences that can be generated. If a sentence cannot be generated by the grammar, explain why. a) 10010001 b) 01101101...
1. Who are language descriptions intended for? Consider the following grammar: ab b | b a...

1. Who are language descriptions intended for? Consider the following grammar: ab b | b a | a Which of the following sentences are in the language generated by this grammar? (DONE) a) baab ==> YES b) bbbab ==> NO c) bbaaaaaS ==> NO d) bbaab ==> YES 2. Write a BNF grammar for the language consisting of binary strings (any combination of 0s and 1s) of at least 2 digits.

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
Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where T={a,b} V={S }. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar? 2. (20 points) Consider a grammar: S -->a | aS | SS | Ssb | Sbs, Where T={a,b} V={S}. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar?
Consider a grammar: S --> | aS | SS SSb | Sbs, Where T={a,b} V={S }....

Consider a grammar: S --> | aS | SS SSb | Sbs, Where T={a,b} V={S }. Show that the grammar is ambiguous. What is the language generated by this grammar?

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where T={a,b} V={S }. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar?
Question 9 (10 points) Consider the following EBNF grammar for a “Calculator Language": <calculation> → <expr>=...

Question 9 (10 points) Consider the following EBNF grammar for a “Calculator Language": <calculation> → <expr>= <expr> <term> (+1-) <expr> <term> <term> <factor> (* ) <term> <factor> <factor> → (<expr>) <value> <value> → [<sign> ] <unsigned> [. <unsigned> ] <unsigned> <digit> { <digit> } <digit> → 01|2|3|4|567| 8 | 9 <sign> → +|- which of the following sentences is in the language generated by this grammar ? Why? a. 3/+2.5 = b. 5-*3/4= c. (3/-2) + 3 = d. 5...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...

1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...

Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...

Homework Answers

Add Answer to:
Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...

Post as a guest

Earn Coins

Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...

Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start...

1. Who are language descriptions intended for? Consider the following grammar: ab b | b a...

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

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

Consider a grammar: S --> | aS | SS SSb | Sbs, Where T={a,b} V={S }....

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

Question 9 (10 points) Consider the following EBNF grammar for a “Calculator Language": <calculation> → <expr>=...

1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...

Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...

Homework Answers

Add Answer to: Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...

Post as a guest

Earn Coins

Add Answer to:
Consider the following grammar: <S> → <A> a <B> b <A> → <A> b | b...