We have the following grammar with the start symbol : -> + | -> / < factor> | | -> 0|1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 1. Show a leftmost derivation for the expression "6*4 / 2-0 +9"; show every step. 2. Show a rightmost derivation for the above expression; show every step. 3. Show the parse trees for the above expression's leftmost derivation and rightmost derivation.
We have the following grammar with the start symbol : -> + | -> / < factor> | | -> 0|1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 1. Show a leftmost derivation for the expression "6*4 / 2-0 +9"; show every step. 2. Show a rightmost derivation for the above expression; show every step. 3. Show the parse trees for the above expression's leftmost derivation and rightmost derivation.
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
Context Free Grammar
ASAP Please

Transcribed Image Text:We have the following grammar with the start symbol <expr>:
<expr>
<factor> + <factor> | <factor> - <factor> <expr>
<factor> -> <factor> * <factor> | <factor> / < factor> | <expr> | <digit>
<digit> ->0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
1. Show a leftmost derivation for the expression "6*4 / 2-0 +9"; show every step.
2. Show a rightmost derivation for the above expression; show every step.
3. Show the parse trees for the above expression's leftmost derivation and rightmost derivation.
4. Show a new grammar that removes the ambiguity and makes "+" and "-" left-associative.
Show the parse tree for "6 * 4 / 2-0 + 9" in your new grammar. Provide proper reasoning
as to why this is the only parse tree possible for your grammar (making it unambiguous).
5. Show a new grammar that removes the ambiguity and makes "+" and "-"right-associative.
Show the parse tree for "6*4 / 2-0 + 9" in your new grammar. Provide proper reasoning
as to why this is the only parse tree possible for your grammar (making it unambiguous).
Expert Solution

Step 1: Overview
We are given with a grammar and its productions, based on the grammar we have questions.
- We will find the leftmost derivation for the given expression
- We will find the rightmost derivation for the same expression.
- We will draw the parse tree for the expression.
As per bartleby guidelines we are suppose to answer three subparts of a question, you can post again as a separate question. Provided answers for 1,2 and 3 and have uploaded images for the solution.
Let's solve and hope this helps if you have any queries please utilize threaded questions feature.
Step by step
Solved in 4 steps with 3 images

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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education