Other Programming & Computer Science Answers

1) Briefly review Regular Expressions – the notation and the languages they represent with suitable
examples using the basic operations – namely, concatenation, union , Kleene Closure.

Different programming languages use different notations to represent integers. Construct a regular
expression for each one of the following:
(a) Nonnegative integers in C represented in bases 10 and 16.
(b) Currency, in dollars, is represented as a positive decimal number rounded to the nearest onehundredth.
Such numbers begin with the character $, have commas separating each group of
three digits to the left of the decimal point, and end with two digits to the right of the decimal
point, for example, $8,937.43 and $7,777,777.77.
Question-

a manufacture produces tables and desks. each table requires 2.5 houres for assembly (A), 3 hours for the polishing (P) and 1 hour for packaging (C). each desk requires 1 hour for assembly, 3 hours for the polishing and 2 hours for packaging. the company cannot have, each week, more than 20 hours for the assembly, and 30 hours for polishing and 16 hours for packaging. its profit margin is 3$ per table and 4$ per office. find the combination of the products which maximize the weekly profits of the company

Write a Regular Expression (RE) for the language of all strings defined over Σ = {x, y, z} which begins with z, x in the middle and ends with y. The minimum length of all strings must be 4.

outline all the eligibility and ineligibility requirements of :
1,a licensed estate agent
2,an agent`s representative; and
3, the officer on effective control and what additional responsibilities does the OIEC have?

how do you connect mysql with c++ ?

How do I create a table using microsoft access for parolees entering the community

A simple loop in Ada has the following form:
loop
<statement>;
<statement>;
...
<statement>;
end loop;
That is, it begins with the word loop, contains one or more statements (each followed by a semicolon), and ends with the words end loop. There must be at least one statement inside the loop.
a) Write a set of Extended Backus-Naur Form (EBNF) grammar rules that describe Ada simple loops. You may assume that <statement> has already been defined elsewhere.

b) Write a syntax diagram (syntax graph) that describes Ada simple loops. You may assume that <statement> has already been defined elsewhere.

Consider this ADA program:

procedure Example is
X: Integer;

procedure First is
begin
Put(X); -- Print X
New_Line; -- Print a newline character
end First;

procedure Second is
X: integer;

procedure Third is
X: Integer;
begin -- Third
x := 99;
First;
end Third;

begin -- Second
x := 88;
Third;
end Second;

begin -- Example
x := 77;
First;
Second;
end Example;
a) What will be printed by this program if we assume static scope?
b) What will be printed by this program if we assume dynamic scope?

How different between BNF (Backus-Naur Form) and EBNF(Backus-Naur Form)? Can you an example how to express them?