Question: Grammar: 1 . S - > aA bB 2 . A - > aS bAA 3 . B - > bS aBB 4 . A

Grammar:
1. S -> aA bB
2. A -> aS bAA
3. B -> bS aBB
4. A ->
5. B ->
Using the grammar given generate the following strings (if possible), showing each step:
aab
baa
bb
If a string cannot be generated, explain why.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

Problem 1. Regarding to the following grammar: SAB AaAa BbB2 1. Find the leftmost and the rightmost derivation of string abbb 2. Draw the derivation tree of string abbb 3. Use set notation to define...

Q:

Convert all of the following regular expressions to DFAs. 1: a(a | b)*b 2: (a | b)* a (a | b)* a (a | b)* 3: b (ab ab* )* 4: a? (a?b + )*a? 5: (a + b)*(aa + ba + bb) + a + 1 6: ^ ([a-zA-Z]+)@([0-9]+)$

Q:

1. Suppose A-[a), B-(b], C (1,2. Give the transition diagram for a nondeterministic finite state machine with alphabet E -fa,b,1,2] that accepts the strings x that are elements of the set A*B C*B A*....

Q:

1. Construct a dfa from this grammar. S abS | A A baB B aA | bb 2. Find an s-grammar for L = {a n b 2n : n 2}.

Q:

1. Derive a regular expression and language from this grammar. Please show steps. S abS | A A baB B aA | bb 2. Show that the language is not regular: L = {a n b k c n : n 0, k n} 3. Find an s-grammar...

Q:

I need help with Picture 1 Chapter 2, problems 5, 7v. Chapter 2, problem 7i, use mathematical induction, Picture 2 and 3 Problems 2-7, 10, 11, 15, 18 oces without DOD. 5. Consider the language S*,...

Q:

**In C++ WITHOUT USING THE HEADER** I'm personally trying to implement Thompson's Construction that is slightly altered in my way but I'm very puzzled (The Question I'm asking you is marked in *****...

Q:

1 . Draw a derivation tree for the string "bab" from the CFG given by S - > bSb | a | b 2 . Construct a derivation tree for the string aabbabba for the CFG given by , S - > aB | bA A - > a | aS | bAA...

Q:

Answer only please. No explanation required answer what you can. 1. If L and M are regular expressions, which of the following is not a regular expression? A. L + M B. L M C. L* D. (LM)* 2. What is...

Q:

2 : Design a grammar for the following language: The set of all strings of a ' s and b ' s that end with aa or bb . Ex: { aa , bb , abb, baa, abaa, . . . }

Q:

Categorize each of the nine different sources of risk according to the investment class to which it applies. If the risk applies to both stocks and bonds, then categorize it as "both."

Q:

At December 31, 2017, the available-for-sale debt portfolio for Waterway Corp. is as follows: Security A B C Total Previous fair value adjustment balance- Dr. Fair value adjustment-Dr. Cost $28,875...

Q:

If the exercise price on a put option is greater than the stock price the option is said to Be at the money

Q:

Suppose the equation for supply of water is Qs=49+20P, and the equation for demand for water looks like Qd=9815P, where PP is the price of a gallon and Q is the number of gallons. Determine the...