Let G be the grammar

S --> abSc | A
A --> cAd | cd

a) Give a left-most derivation of ababccddcc.
b) Build the derivation tree for the derivation in part (a).
c) Use set notation to define L(G).

Explanation:

a) The Left-most derivataion for ababccddcc

S ⇒ AB

L.M.D

→ aAbB

→ aabbB

→ aabb CBd

→ aabb CCdd

b) Derivation tree for the derivation in part(a)

The attached diagram ilustrate the three derivation

c) To define L(G) with set notation

L(G) = {a ∧n b ∧n |n ≥ 0}.

what is inputmismatchexception?