Is there any way to count the production of specific rules in order in a context free grammar?

Question

Is there any way to use a counter in context-free grammars?

I need to add a module number (for example starting from M1:0, M1:1, ... , M1:K representing the module number) and I want to count every block productions in order. The following production rule just adds an arbitrary digit number from <digit_list>:

S ⇒ <block> <fblock> <fcblock>  
<block> ⇒ <cblocks><pblock>  
<cblock> ⇒ <Module_ID>:<digit_list><cblock>|<Module_ID>:<digit_list><cblock><cblock>|<Module_ID>:<digit_list><cblock><cblock><cblock>  
<cblock> ⇒ [C<block>]
<bblock> ⇒ BN|λ 
<pblock> ⇒ <Module_ID>:<digit_list>[P<dblock>] |λ 
<dblock> ⇒ D|λ   
<fblock> ⇒ <Module_ID>:<digit_list>[F]
<fcblock>⇒ <Module_ID>:<digit_list>[FC<UNIT><dblock>]|λ 
<UNIT> ⇒ 64|128
<Module_ID> ⇒ M1
<digit_list>⇒ <digit>|<digit><digit_list>
<digit>⇒ 0|1|2|...|9

Is there any way to generate and count the modules number produced on the right-hand side of the production rules (the modules that have <Module_ID>:<digit_list> before) that I need to count them?

Is there any example or resources that I can use and refer to them?

Edited:

For example, the following shows the generated string I need to add M1:0 and etc before the modules in bracket [] to count them:

M1:0[CBN][CBN][C]M1:1[PD]M1:2[F]M1:3[FC64D]