Consider the following grammar G1:
E S E S | num
S − S | S | e
E and S are non-terminals, , −, and num are terminals (with the usual interpretation).
The start symbol is E (not S).
Describe short how sentences generated by G1 look like, and give one example of a sentence consisting of 4 terminal symbols
Give a regular expression representing the same sentences as G1.