rs for the following language: The set of all strings of Os and 1s with 010 as a substring. 2. (20pts) Considering the following grammar: A -1A | 1 a) Left factor this grammar b) Does left factoring make the grammar suita c In addition to left factoring, eliminate left recursion from the original ble for top-down parsing? grammar d) Is the resulting grammar suitable for top-down parsing? 3.(10pts) For the grammar s >os 1|01, indicate the handle in ea following right-sentential form: 0011 handle i each of the