1. Suppose that in some programming language numbers are restricted as follows: (a) a number may be signed or unsigned. (b) the value field consists of two nonempty parts, separated by a decimal point. (c) there is an optional exponent field. If present this field must contain the letter e, followed by a signed two-digit integer.

   Design a grammar for the such numbers in this programming language.