Make c++ program about Chomsky's hierarchy of grammars [on hold]

Can someone write a program in c++ that tell if it type-0 or type-1 or type-3 i tried to make it but i fail
likes this S → aA' | a A' → a | aA' B → bA' | b and the output tell what type it is