I don't know how to translet regex to bison flex

Introduction This programming assignment is an extension of Lab 1 - Task 2, which is to develop a parser program using flex and bison. Your task is to define rules and grammars for flex and bison so that they will automatically translate the rules into a shift-reduce, bottom-up parser program. Your parser program must recognized the below grammar: ::= :: ; ; ::- | print ::- - ::- | xr> ::= - ::- + ::- - ::- * ::= / ::= ::- ( ::- (1-9][0-9] :-(_a-zA-Z] ([_a-zA-Z][0-9])* Note that strings such as "print", "-", "", "+", ",", "T, and "" are terminal symbols. You can define them as tokens or just strings in the grammar. Preparation Introduction This programming assignment is an extension of Lab 1 - Task 2, which is to develop a parser program using flex and bison. Your task is to define rules and grammars for flex and bison so that they will automatically translate the rules into a shift-reduce, bottom-up parser program. Your parser program must recognized the below grammar: ::= :: ; ; ::- | print ::- - ::- | xr> ::= - ::- + ::- - ::- * ::= / ::= ::- ( ::- (1-9][0-9] :-(_a-zA-Z] ([_a-zA-Z][0-9])* Note that strings such as "print", "-", "", "+", ",", "T, and "" are terminal symbols. You can define them as tokens or just strings in the grammar. Preparation