Consider the following grammar G: S → ABC|AC|A|B A → a B B - bC|a C-cD D- dA Recall that a non-terminal A is useful if there is a derivation of a string of terminals starting from S in which A appears: S=* xA y=* w holds for some x and y which are sequences of terminals and non-terminals (possibly empty) and some w which is a sequence of terminals (possibly empty). For example, if there are only three rules S→ a A, A→ B and B → a , then A is useful because S = a A=a B= a a is a derivation of the sequence of terminals a a starting from S and in which A appears. If A is not useful, then we say that it is useless. Which of the following are the useless symbols of the grammar G above?
Consider the following grammar G: S → ABC|AC|A|B A → a B B - bC|a C-cD D- dA Recall that a non-terminal A is useful if there is a derivation of a string of terminals starting from S in which A appears: S=* xA y=* w holds for some x and y which are sequences of terminals and non-terminals (possibly empty) and some w which is a sequence of terminals (possibly empty). For example, if there are only three rules S→ a A, A→ B and B → a , then A is useful because S = a A=a B= a a is a derivation of the sequence of terminals a a starting from S and in which A appears. If A is not useful, then we say that it is useless. Which of the following are the useless symbols of the grammar G above?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Hi there,
Can anyone please resolve the bellow question in detail step by step?
I want to understand why the correct answer is "None of the above". Could you please break down the process used to reach this answer?
![Consider the following grammar G:
S- ABC|AC|A|B
A - a B
B - bC|a
C-cD
D -dA
Recall that a non-terminal A is useful if there is a derivation of a string of terminals starting from S in which A appears: S =* x A y =* w
holds for some x and y which are sequences of terminals and non-terminals (possibly empty) and some w which is a sequence of terminals
(possibly empty). For example, if there are only three rules S → a A, A → B and B → a , then A is useful because S = a A = a B = a a is a
derivation of the sequence of terminals a a starting from S and in which A appears. If A is not useful, then we say that it is useless. Which
of the following are the useless symbols of the grammar G above?
O A, C, and D only
O D only
O Cand D only
A All non-terminals are useless
O None of the above](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F17312ebc-3315-4779-a281-0dae2a4182c3%2F413b6338-b092-4afc-8576-54ef0cdecdaf%2F6p905gu_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following grammar G:
S- ABC|AC|A|B
A - a B
B - bC|a
C-cD
D -dA
Recall that a non-terminal A is useful if there is a derivation of a string of terminals starting from S in which A appears: S =* x A y =* w
holds for some x and y which are sequences of terminals and non-terminals (possibly empty) and some w which is a sequence of terminals
(possibly empty). For example, if there are only three rules S → a A, A → B and B → a , then A is useful because S = a A = a B = a a is a
derivation of the sequence of terminals a a starting from S and in which A appears. If A is not useful, then we say that it is useless. Which
of the following are the useless symbols of the grammar G above?
O A, C, and D only
O D only
O Cand D only
A All non-terminals are useless
O None of the above
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education