- Consider CFG G = ({S}, {a, b, c}, R, S) where R = {S → SbbS | SacS | a}. Show how the string abbaacabba - What cause ambiguity?

The objective of this question is to generate and read files that contain a list of random numbers. Write a function that generates a file with following parameters: def fillFile(fileSize, fileName): The function should be called to generate files in the following sizes: fileSizes = [1000, 5000, 10000, 20000, 30000, 40000, 50000] The generated files can have names file1000, file 5000, file 10000, file20000, fi130000, file40000, file 50000. You can use random.randint(0.fileSize+1000) to generate a random number. Write another function that reads numbers inside of a file and returns a list. def readFile(fileName): The returned list contains the numbers stored in the file. At each call of fillFile and readFile, record the times before and after the function call as in following example (import time): start = time.time() fillFile(file Size, "file" + str(fileSize)) finish time.time() runTime = finish - start Record the run times of functions into a file named "fileStats.txt". The…

Question 2. Find a regular expression that describes the given language:(2.a) Language of strings over Σ = {a, b, c} in which every character c is followed by the character a.(2.b) Language of strings over Σ = {a, b} which contain both substrings abb and bab. Note that thesubstrings can occur in any order and can overlap, so for example the string babb is in this language.(2.c) Let Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, −, .}. The language L contains all strings that form a properdecimal representation of some number.Some examples of strings in the language: 42, -999, 0, 12.333, -0.14, 5.000.Some examples of strings that are not in the language: 028 (leading zero), 75. (decimal point but nodecimal part), -.5 (no integer part), -0 (there is no negative zero), 4..2-6 (malformed nonsense).You can use the shorthand [0−9] to stand for (0 + 1 + 2 + ···+ 9).

Use a closure operation to reduce the language L of all even-lengthed strings of as and bs where both halves of the string end with an a, that is L = {w0aw1a | w0,w1 ∈ {a,b}∗ ∧ |w0| = |w1|}, to a simpler language L0 which must also be regular if L is regular. Use the pumping lemma to show L0 is not regular.