b) Write the CFG for the following language over alphabet Σ= {p,q ,r} L={ pqr, ppqrr, pppqrrr, ppppqrrrr, pppppqrrrrr, ……………..} Hint : pn q rn where n>=1 Note: derive at least four strings for the given CFG

Write the code in java and here is the lab 12 code read the question why I gave you lab 12 code :  public class lab12daneshelahi {   public static void main (String[]args)   { CanadianAddress testAddress = new CanadianAddress (); CanadianAddress SMUAddress =  new CanadianAddress ("923 Robie St.", "Halifax", "Nova Scotia",   "B3H 3C3");    System.out.println ("The testAddress is created as:");  testAddress.printAddress ();  System.out.println ();    System.out.println ("The SMUAddress is created as:");  SMUAddress.printAddress ();  System.out.println ();    System.out.println ("The testAddress is equal to SMUAddress? :( " +  testAddress.equalAddress (SMUAddress));  System.out.println ();    testAddress.setStreetAddress ("923 Robie St.");  testAddress.setCity ("Halifax");  testAddress.setProvince ("Nova Scotia");  testAddress.setPostalCode ("B3H 3C3");    System.out.println ("The testAddress is updated as: :D ");  testAddress.printAddress ();  System.out.println ();    System.out.println…

Let L = { w ∈ { a, b, c }* | w contains exactly one b or starts with ac }.a) Construct an NFA that recognizes L.b) Construct an NFA that accepts any positive number of occurrences of various strings (not empty string)from this language concatenated together.

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).