1. (10 points) The following given grammar is a left recursive grammar S Saba |b The language generated by this grammar is of the following form: L=Lbs l This left recursive grammar can be transformed to a right recursive grammar as follows: ) grammar. This right recursive grammar is an Show transcribed image text 1. (10 points) The following given grammar is a left recursive grammar S Saba |b The language generated by this
OR
OR