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
icon
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)
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps

Blurred answer
Knowledge Booster
Instruction Format
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education