Problem
Consider the language consisting of strings that represent the list of numbers separated by commas. For instance, the string "10,7" and "1,7,5,13" are in the language; also included in the language are lists of a single number (e.g., "12"). Devise an unambiguous BNF grammar for the language. Briefly explain why your grammar is unambiguous.