Question
Given the following contextfree grammar. Add attribute rules to the grammar to accumulate into the root of the tree a count of the number of
Given the following contextfree grammar. Add attribute rules to the grammar to accumulate into the root of the tree a count of the number of subroutine calls. For example, given the string f1(a, f2(b * (c + (d - (e - f))))), the stmt at the root of the tree should have an attribute with a count of 2.
stmt assignment
stmt subr call
assignment id := expr
subr call id ( arg list )
expr primary expr tail
expr tail op expr
expr tail
primary id
primary subr call
primary ( expr )
op + | - | * | /
arg list expr args tail
args tail , arg list
args tail
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored 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