Questions 1, 2 and 3 are based on following Grammar:

begin end

| ;

=

A | B | C

+ | - |

1. Identify the following: Terminals:

Abstractions:

2. Give the parse tree for

Begin A = B+C; B = C end

3. Is the language ambiguous?