Question: Consider the following attribute grammar for variable declarations, based on the CFG: Show a parse tree for the string A, B : C;. Then, using

Consider the following attribute grammar for variable declarations, based on the CFG:

→ ID decl_tail decl.t := decl_tail.t decl - decl_tail.in_tab := insert (decl.in.tab, ID.n, decl_tail.t) decl.out_tab := decl_tail.out_tab decl_tail +, decl decl_tail.t := decl.t decl.in_tab := decl_tail.in_tab decl_tail.out_tab := decl.out_tab decl_tail + : ID ; decl_tail.t := ID.n decl tail.out_tab := decl_tail.in_tab

Show a parse tree for the string A, B : C;. Then, using arrows and textual description, specify the attribute flow required to fully decorate the tree.

ID decl_tail decl.t := decl_tail.t decl - decl_tail.in_tab := insert (decl.in.tab, ID.n, decl_tail.t) decl.out_tab := decl_tail.out_tab decl_tail +, decl decl_tail.t := decl.t decl.in_tab := decl_tail.in_tab decl_tail.out_tab := decl.out_tab decl_tail + : ID ; decl_tail.t := ID.n decl tail.out_tab := decl_tail.in_tab

Step by Step Solution

3.40 Rating (169 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Decoration occurs in three phases First the type propagates up to the top of ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Language Pragmatics Questions!