Using Java, write a program that takes a context-free grammar, removes the lambda productions, and returns the new language. Comments are appreciated! Thank you!

A sample input: S -> ABAC

A->aA|e

B->bB|e

C->c

should output: S->ABAC|ABC|BAC|BC|AAC|AC|C

A->aA|a

B->bB|b

C->c

Thank you!!