For each of the following grammars state whether it is ambiguous or unambiguous. if it is ambiguous give an equivalent unambiguous grammar. if it is unambiguous, state all the precedence and associativities enforced by the grammar. assume id generates identifiers. a) e: : = e + f | f f: : = f * f | id | (e) b) e: : = f e | f e | f f: : = f g | f g | g g: : = id | (e)

professionals can use many types of technology that can them. some examples are, computers (they research and can use for programs for data, they are also used for job applications, school work, and even to make new ideas), speedometers (can get data for unknown data), sometimes something as small as a pen (used for rough drafts, to insert data, and again job applications).