Answered step by step
Verified Expert Solution
Question
00
1 Approved Answer
Problem 3: Suppose we want to enforce the following rules in the grammar from Problem 2: (a) The type of the expression must match the
Problem 3: Suppose we want to enforce the following rules in the grammar from Problem 2: (a) The type of the expression must match the type of the variable in all assignment statements. (b) A variable must be declared before it can be used. (c) A variable must be assigned a value as its first use in the program. Where in the parse tree should these rules be checked (i.e. at which non-terminals), and write the precise tests that should be done at those non-terminals using the attibutes available. Problem 3: Suppose we want to enforce the following rules in the grammar from Problem 2: (a) The type of the expression must match the type of the variable in all assignment statements. (b) A variable must be declared before it can be used. (c) A variable must be assigned a value as its first use in the program. Where in the parse tree should these rules be checked (i.e. at which non-terminals), and write the precise tests that should be done at those non-terminals using the attibutes available
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started