I need help with the coding portion mentioned in Question 2. Question 1 is listed for context(please use Python or C)

1. Define an EBNF grammar for any valid number, not starting with zero, like the next examples: 1 102 9723 Next examples won't be accepted 0123 123abc 12E4 Just consider that the "tokens" are not separated with spaces in this case. If this is a problem, then include a space between digits. 2. Create a recursive-descent parser in python or any other language for recognizing the expressions