Consider the following augmented grammar for a compound statement in

the programming language C.

C' -> C

C -> { L }

C -> { }

L -> L S

L -> S

S -> C

-> a

a) Build the LR( 0) canonical finite state machine for G.

b) Build the LR( 0) parse table for G.

c) Trace the parse of the input { a { a a } }$.