1. a) Write a grammar for parsing the string a=b/(c-d)*(x+y) b) Now perform a Left-most derivation for the string. c) Draw a parse tree for the string. d) Is the grammar ambiguous? Motivate your answer.
1. a) Write a grammar for parsing the string a=b/(c-d)*(x+y) b) Now perform a Left-most derivation for the string. c) Draw a parse tree for the string. d) Is the grammar ambiguous? Motivate your answer.
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
Topic Video
Question
100%
Course:Compiler Design
![1.
a) Write a grammar for parsing the string a=b/ (c-d)*(x+y).
b) Now perform a Left-most derivation for the string.
c) Draw a parse tree for the string.
d) Is the grammar ambiguous? Motivate your answer.
2.
Use the grammar you have created in Question 1 for an infix expression al
technique: Syntax Directed Definition write appropriate semantic rules to convert an injix
expression of that grammar to a prefix expression.
Precedence of operators are given below (high to low):
()
*, /
+,
Associativity of operators are given below:
+, -, *, /
[Left Associative]
[Right Associative]
%3D
Taking into account the precedence and the associativity of the operators in this question,
if any modification is needed for your grammar in Question 1 to be used in this question,
do it. After the necessary modification(s),
a) write the semantic rules for infix to prefix conversion
b) draw the annotated parse tree for the string: a=Db/(c-d)*(x+y)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8cdc8db6-a7e7-46f5-ab45-baa7a3a66100%2Fc118ae9c-3ed5-43c6-bf72-26f7a4cf5173%2F2g2p3i9_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1.
a) Write a grammar for parsing the string a=b/ (c-d)*(x+y).
b) Now perform a Left-most derivation for the string.
c) Draw a parse tree for the string.
d) Is the grammar ambiguous? Motivate your answer.
2.
Use the grammar you have created in Question 1 for an infix expression al
technique: Syntax Directed Definition write appropriate semantic rules to convert an injix
expression of that grammar to a prefix expression.
Precedence of operators are given below (high to low):
()
*, /
+,
Associativity of operators are given below:
+, -, *, /
[Left Associative]
[Right Associative]
%3D
Taking into account the precedence and the associativity of the operators in this question,
if any modification is needed for your grammar in Question 1 to be used in this question,
do it. After the necessary modification(s),
a) write the semantic rules for infix to prefix conversion
b) draw the annotated parse tree for the string: a=Db/(c-d)*(x+y)
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 6 steps
![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