Let BLOOP be the language of strings of even length over the alphabet {a,b} in which the two middle letters are different to every other letter in the string. Give a Context-Free Grammar for the language BLOOP.

language L of all strings of symbols from the alphabet ∑ = {a,b,c} where each a is followed by b, and c only appears in pairs.  Provide a regular expression and a grammar (regular grammar or context-free grammar) corresponding to L

Write a grammar for the language consisting of strings over the alphabet {a,b} where all strings start with the letter a and can have a’s and b’s after.

Consider the language L of strings over the alphabet Σ = {a, b} which contain an equal number of a’s and b’s, and the set of b’s is consecutive in the string, e.g., ab, abba, aabb, abbbaa, aaabbbbbaa, etc. Note that ε ∈ L for completeness (0 number of a’s is equal to 0 number of b’s, which are also consecutive). Show that this language is context-free by giving a context-free grammar. Please make sure to test the answers onhttps://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/