Draw a DFA that is defined by a language L that contains all possible integer literals in C

Design a program that allows the user to enter 20 names into a String array. Sort the array in ascending (alphabetical) order and display its contents. This is what I have so far: #include <iostream> const int size=20; int names[size]; int i; int main() {  std::cout<<"This program will alphabetize a list of names\n\n";  for (int i = 0;i<size; i++) {    std::cout << "Enter names number "<<i+1<<"\n";    std::cin >> names[i+1];  }

Determine whether some C compiler to which you have access implements the free function.

Could you define parametric polymorphism in a subprogram and provide an example of its application?

A.  Write a Scheme function that returns the number of zeros in a given simple list of numbers.B.  Write a Scheme function that returns the reverse of its simple list parameter.C.  Write a Scheme predicate function that tests for the structural equality of two given lists. Two lists are structurally       equal if they have the same list structure, although their atoms may be different.

Write a regular expression to describe each of the following languages. Example: {w € (a, b)* : w has both aa and bb as substrings} Regular expression: (a U b)* aa (a U b)* bb (a U b)* U (a U b)* bb (a U b)* aa (a U b)*

How do function objects aid in creating custom iterable constructs in languages like Python?

Write a concise English language description of the C/C++ function fflush().

2. A piece of declaration code in C programming language is as follows: typedef struct {     int a, b; } CELL, *PCELL; CELL foo[100]; PCELL bar ( int x, CELL y ); Write the type expression for foo and bar.   3. Write an SDT for the following grammar, which can perform type checking. The type of S is the valid type of its body.  S -> id := E | if E then S | while E do S | S; S