Question

We have the language L(G) = {abb^n a|n ? ?, n ? 0}, where {a, b} is the set of terminal symbols. Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.) S ? baSab, S ? b S ? baSba, S ? b S ? aAa, A ? aAa, A ? b S ? aAa, A ? bA, A ? b

          We have the language
L(G) = {abb^n a|n ? ?, n ? 0},
where {a, b} is the set of terminal symbols.
Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.)

S ? baSab, S ? b
S ? baSba, S ? b
S ? aAa, A ? aAa, A ? b
S ? aAa, A ? bA, A ? b

We have the language
L(G) = abb^n a|n ? ?, n ? 0,
where a, b is the set of terminal symbols.
Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.)

S ? baSab, S ? b
S ? baSba, S ? b
S ? aAa, A ? aAa, A ? b
S ? aAa, A ? bA, A ? b

Added by Jose Antonio J.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Sri K

04/10/2023

Step 1

Let's analyze each option: Show more…

Show all steps

Thanks for your feedback!

We have the language L(G) = {abb^n a|n ∈ ℤ, n ≥ 0}, where {a, b} is the set of terminal symbols. Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.) S → baSab, S → b S → baSba, S → b S → aAa, A → aAa, A → b S → aAa, A → bA, A → b