Based on the grammar,

->

-> | ;

-> =

-> a | b | c | d

-> + | -

-> | const

1. derive (=>) the following sentences:

b = const

a = b - const

2. create parse trees for the above two sentences

3. Treat the following two sentences as a in the same and create derivation and parse tree.

c = a - b

b = c + d