The grammar is given:

G (M)

M YZ

Y a | b | G

Z *M | -M | +M| e, where e is the empty string

Design and implement a top-down syntactic parser that recognizes the given string or responds negatively to its syntactic correctness.

Return the corresponding tree and print it. Demonstrate for the expression ((a-b)*(a+b)). Every step of the result must be shown in the output Acceptable programming languages: C/C++

Explain how you worked