One parse tree only a The role of the grammar a distinguish between syntactically legal and illegal programs a But that's not enough: it must also define a parse tree a the parse tree conveys the meaning of the program What if a string can be parsed with multiple parse trees? a we say the grammar is ambiguous a must fix the grammar(the problem is not in the parser) a Note: often a string can be derived in more than one way D ie, with more than one derivation sequence o this does not mean the grammar is ambiguous
5-A1 2,4,6-Tribromanilin aus Anilin 5-A2 2-Amino-4’-nitrobiphenyl aus 2-Aminobiphenyl 5-A3 Bis(4-methoxyphenyl)phenylmethylchlorid ausBenzotrichlorid und Anisol
Due: Monday, April 11 at 9 PM Problem 1. An electronic toy displays a 4x4 grid of colored squares. At all times, four are red, four are green, four are blue, and four are yellow. For example, here is one possible configuration: