A simple recursive Toy Grammar for an assignment statement, consisting of four productions:
<assignment> --> ID = <expression> ;<expression> --> <term> ( (+|-) <term> )*<term> --> <factor> ( (*|/) <factor> )*<factor> --> ID | CONST | ( <expression> )