Answer the given question with a proper explanation and step-by-step solution. Write an attribute grammar whose BNF basis is that of Example 3.6 in Section 3.4.5 but whose language rules are as follows: Data types cannot be mixed in expressions, but assignment statements need not have the same types on both sides of the assignment operator. Be clear, as I have no idea how this works EXAMPLE 3.6An Attribute Grammar for Simple Assignment Statements1. Syntax rule: → = Semantic rule: .expected_type ← .actual_type2. Syntax rule: →→ [2] + [3]Semantic rule: .actual_type ←if ([2].actual_type=int) and([3].actual_type = int)then intelse realend ifPredicate:.actual_type .expected_type3. Syntax rule: → Semantic rule: .actual_type< .actual_typePredicate:.actual_type == .expected_type==4. Syntax rule: → A | B | CSemantic rule: .actual_type look-up (.string)The look-up function looks up a given variable name in the symbol table andreturns the variable's type.

Hello student Greetings Hope you are doing great. Thank You!!!

Answered: Answer the given question with a proper…

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

See similar textbooks

Related questions

Question

Answer the given question with a proper explanation and step-by-step solution.

Write an attribute grammar whose BNF basis is that of Example 3.6 in Section 3.4.5 but whose language rules are as follows: Data types cannot be mixed in expressions, but assignment statements need not have the same types on both sides of the assignment operator. Be clear, as I have no idea how this works

EXAMPLE 3.6
An Attribute Grammar for Simple Assignment Statements
1. Syntax rule: <assign> → <var> = <expr>
Semantic rule: <expr>.expected_type ← <var>.actual_type
2. Syntax rule: <expr> →→ <var>[2] + <var>[3]
Semantic rule: <expr>.actual_type ←
if (<var>[2].actual_type=int) and
(<var>[3].actual_type = int)
then int
else real
end if
Predicate:
<expr>.actual_type <expr>.expected_type
3. Syntax rule:
<expr> → <var>
Semantic rule: <expr>.actual_type< <var>.actual_type
Predicate:
<expr>.actual_type == <expr>.expected_type
==
4. Syntax rule: <var> → A | B | C
Semantic rule: <var>.actual_type look-up (<var>.string)
The look-up function looks up a given variable name in the symbol table and
returns the variable's type.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions