Consider the following grammar in BNF notation:

::= 0 | 1

::= 0

::= 1 | 1

Which of the following sentences are in the language generated by this grammar? For those that are in the language, show a possible derivation. For the others, explain why they cannot be generated using the rules of the grammar.

a. 10101

b. 10110

c. 001010

Describe the language generated by this grammar using regular expressions.

Trace the table-driven LL(1) parse of the input x := (a b)/3, similar to the example on slide 47.

Construct the parse tree for the input given in point a.

solve all to give you like