3. For each of the grammars below, do the following: > Using set notation (or a regular expression), say what language it generates. Find a string that has two different parse trees (and draw them): Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .