Explanation Given: The language generated by the grammar G = < v , t , s , p > . Where V = { a , b , c , A , B , C , S } T = { a , b , c } , S is the starting symbol and the productions are S → A B A → C a B → B a B → C b C → c b C → b Concept used: A bottom-up passing is to work backward from the given string with the goal of undoing productions one-by-one to reach the start symbol. Calculation: Part a) Using bottom-up passing. In order to derive the string b a b a Use the production C → b So that, C a b a ⇒ b a b a Then use A → C a A b a ⇒ C a b a ⇒ b a b a Next use B → b A B a ⇒ A b a ⇒ C a b a ⇒ b a b a Then use B → B a A B ⇒ A B a ⇒ A b a ⇒ C a b a ⇒ b a b a Finally using S → A B S ⇒ A B ⇒ A B a ⇒ A b a ⇒ C a b a ⇒ b a b a Part b) Using bottom passing. In order to derive the string a b a b There is no production which starts with ‘ a ’ Hence a b a b cannot be generated. Part c) Using bottom-up passing

Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991

8th Edition

ISBN: 9781259676512

Author: Kenneth H Rosen

Publisher: McGraw-Hill Education

See similar textbooks

Videos

Question

Chapter 13.1, Problem 26E

To determine

To find:

Whether the string is generated by the given grammar by bottom-up passing.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 13.1, Problem 25E

Chapter 13.1, Problem 27E

Students have asked these similar questions

Determine a possible regular expression that could define a language containing strings ab, acb, accb, adb, addb, adddb,...

Show that ADFA ∈ L, where ADFA = {< B,w > |B is a DFA that accepts input string w}.

A palindrome is a string that reads the same backward as it does forward, that is, a string w, where w = wr, where wr is the reversal of the string w. Find a context-free grammar that generates the set of all palindromes over the alphabet { 0, 1 }.

Chapter 13 Solutions

Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991

Ch. 13.1 - Exercises 1-3 refer to the grammar with start...Ch. 13.1 - Exercises 1-3 refer to the grammar with start...Ch. 13.1 - Prob. 3E Ch. 13.1 - Let G=(V,T,S,P) be the phrase-structure grammar...Ch. 13.1 - Prob. 5E Ch. 13.1 - Prob. 6E Ch. 13.1 - Prob. 7E Ch. 13.1 - Show that the grammar given in Example 5 generates...Ch. 13.1 - Prob. 9E Ch. 13.1 - Prob. 10E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

Whether the string is generated by the given grammar by bottom-up passing.

Solution Summary: The author explains that a bottom-up passing is to work backward from the given string with the goal of undoing productions one-by-one to reach the start symbol.

Videos

To find: Whether the string is generated by the given grammar by bottom-up passing.

Want to see the full answer?

Chapter 13 Solutions

To find:

Whether the string is generated by the given grammar by bottom-up passing.