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.

Consider the following attribute grammar for variable declarations, based on the CFG of Exercise 2.11: decl ID decl_tail D decl.t:- decl tail.t decl.tail.in.tab :- insert (decl.in.tab, ID.n, decl.tail.t) D decl.out tab:- decl.tail.out tab decl_tail, decl D decl_tail.t:- decl.t decl.in tab:- decl tail.in tab dect tail.out tab:- decl.out.tab decl tail-ID decl tail.t: ID.n decl.tail.out.tab:- decl.tail.in.tab Consider the following attribute grammar for variable declarations, based on the CFG of Exercise 2.11: decl ID decl_tail D decl.t:- decl tail.t decl.tail.in.tab :- insert (decl.in.tab, ID.n, decl.tail.t) D decl.out tab:- decl.tail.out tab decl_tail, decl D decl_tail.t:- decl.t decl.in tab:- decl tail.in tab dect tail.out tab:- decl.out.tab decl tail-ID decl tail.t: ID.n decl.tail.out.tab:- decl.tail.in.tab