write Interpreters

------------------------------------------

Question Twos 2 Marks Let G = (V,E, R, (STMT)) be the following grammar. (STMT)-. (ASSIGN) |1F-THEN)IF-THEN-ELSE) (IF-THEN) (IF-THEN-ELSE) if condition then (STMT) else (STMT) (ASSIGN) a:s] = {if, condition, then, else, a V = {(STMT), (IF-THEN), IF-THEN-ELSE), ASSIGN)} G is a natural-looking grammar for a fragment of a programming language, but G is ambiguous. a. Show that G is ambiguous. b. Give a new unambiguous grammar for the same language if condition then (STMT) Question Twos 2 Marks Let G = (V,E, R, (STMT)) be the following grammar. (STMT)-. (ASSIGN) |1F-THEN)IF-THEN-ELSE) (IF-THEN) (IF-THEN-ELSE) if condition then (STMT) else (STMT) (ASSIGN) a:s] = {if, condition, then, else, a V = {(STMT), (IF-THEN), IF-THEN-ELSE), ASSIGN)} G is a natural-looking grammar for a fragment of a programming language, but G is ambiguous. a. Show that G is ambiguous. b. Give a new unambiguous grammar for the same language if condition then (STMT)