What is the best data structure / class hierarchy to work with rules of a formal grammar?

Question

I am trying to build a general Top Down parsing algorithm that works with the rules of any given grammar (context-free) but I am struggling to find a way to work with the ru