Ans for 1-6

) Consider the language of these strings: s, ceSd, ceceSdd, ceeecesddd, etc. Write a recursive grammar for this language. e-{ t tel / 2) Use BNF to define cach of the following: a) A language consisting of any string of zero or more decimal digits, followed by exactly one followed by one or more decimal digits b) A language consisting of all strings that begin with a single z', followed by one or more letters 'at or ) A language consisting of one or more digits o, followed by a single -x, followed by as many di V' as preceded the 'X Consider the lang Write all strings that are in this language and age that the following grammar detines contain seven or fewer character. orammar for the language of strings of one or more letters. The first letter of each be uppercase and all other letters in the string must be lowercase. string must of character strings that contain only dots and dashes. All strings in this language Consider a language ontain at least charact four characters and begin with either two dots or two dashes. If the first two characters last one must be a dash; if the first two characters are dashes the last one must be a dot. 5) Write a recursive grammar for this language. 6) Consider the language that the following grammar defines: