| 6 |
7u83 |
1 |
/*
|
|
|
2 |
Crown Copyright (c) 1997
|
|
|
3 |
|
|
|
4 |
This TenDRA(r) Computer Program is subject to Copyright
|
|
|
5 |
owned by the United Kingdom Secretary of State for Defence
|
|
|
6 |
acting through the Defence Evaluation and Research Agency
|
|
|
7 |
(DERA). It is made available to Recipients with a
|
|
|
8 |
royalty-free licence for its use, reproduction, transfer
|
|
|
9 |
to other parties and amendment for any purpose not excluding
|
|
|
10 |
product development provided that any such use et cetera
|
|
|
11 |
shall be deemed to be acceptance of the following conditions:-
|
|
|
12 |
|
|
|
13 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
14 |
reproduced upon any copies or amended versions of it;
|
|
|
15 |
|
|
|
16 |
(2) Any amended version of it shall be clearly marked to
|
|
|
17 |
show both the nature of and the organisation responsible
|
|
|
18 |
for the relevant amendment or amendments;
|
|
|
19 |
|
|
|
20 |
(3) Its onward transfer from a recipient to another
|
|
|
21 |
party shall be deemed to be that party's acceptance of
|
|
|
22 |
these conditions;
|
|
|
23 |
|
|
|
24 |
(4) DERA gives no warranty or assurance as to its
|
|
|
25 |
quality or suitability for any purpose and DERA accepts
|
|
|
26 |
no liability whatsoever in relation to any use to which
|
|
|
27 |
it may be put.
|
|
|
28 |
*/
|
|
|
29 |
|
|
|
30 |
|
|
|
31 |
Iddec printf : proc;
|
|
|
32 |
Iddec f_var_calls : proc;
|
|
|
33 |
Iddec g : proc;
|
|
|
34 |
|
|
|
35 |
String results = "\nThis should print the integers 1 to %d\n\n";
|
|
|
36 |
String s = "%d\n";
|
|
|
37 |
String gs = "g:%d\n";
|
|
|
38 |
|
|
|
39 |
Var count : Int = 0(Int);
|
|
|
40 |
|
|
|
41 |
|
|
|
42 |
Proc f_var_calls = General Int(; i:Int ...)
|
|
|
43 |
Var x:Ptr Int = i
|
|
|
44 |
? {
|
|
|
45 |
? ((*(Int)(* x)) > 0(Int));
|
|
|
46 |
printf [top] (s, f_var_calls [Int] [; *(Int)(* x) - 1(Int) ...; make_top]);
|
|
|
47 |
f_var_calls Tail_call [*(Int)(* x) - 1(Int) ...]
|
|
|
48 |
|
|
|
|
49 |
count = ((* count) + 1(Int));
|
|
|
50 |
return (* count)
|
|
|
51 |
};
|
|
|
52 |
|
|
|
53 |
|
|
|
54 |
|
|
|
55 |
|
|
|
56 |
|
|
|
57 |
|
|
|
58 |
|
|
|
59 |
Proc main = top ()
|
|
|
60 |
{
|
|
|
61 |
|
|
|
62 |
count = 0(Int);
|
|
|
63 |
printf [top] (results, 4(Int));
|
|
|
64 |
printf [top] (s, f_var_calls [Int] [; 2(Int) ... ; make_top]);
|
|
|
65 |
|
|
|
66 |
return (make_top)
|
|
|
67 |
};
|
|
|
68 |
|
|
|
69 |
Keep (main,f_var_calls,g,s)
|