4. (20pt) Consider the following grammar for a declaration list: ded list - ded list deel ; ded; dedid : type type intreal char array const .. const of type record ded_list end Construct the characteristic finite state machine for this grammar (like the one in Fig. 2.26. p.96-97 of textbook). Then use it to parse (like in Fig.2.30, p.100 of textbook) the program below: foo: record a : char; b: array 1.. 2 of real; end; 4. (20pt) Consider the following grammar for a declaration list: ded list - ded list deel ; ded; dedid : type type intreal char array const .. const of type record ded_list end Construct the characteristic finite state machine for this grammar (like the one in Fig. 2.26. p.96-97 of textbook). Then use it to parse (like in Fig.2.30, p.100 of textbook) the program below: foo: record a : char; b: array 1.. 2 of real; end