vishapoberon/oberonbyexample
1
0
Fork 0
mirror of https://github.com/vishapoberon/oberonbyexample.git synced 2026-04-06 05:12:25 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

post rebranding

Browse source
This commit is contained in:
Antranig Vartanian 2024-05-11 19:17:23 +04:00
parent 4169aecd5b
commit 95b512baf4
No known key found for this signature in database
GPG key ID: DE3998662D59F21C
66 changed files with 716 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

33
examples/recursion/Fib.Mod Normal file
View file

@ -0,0 +1,33 @@
MODULE fibonacci;
IMPORT Out, Modules;
VAR
n : LONGINT;
Arg0 : LONGINT;
PROCEDURE getFib (n : LONGINT) : LONGINT;
VAR result : LONGINT;
BEGIN
IF n = 0 THEN
result := 0
ELSIF n = 1 THEN
result:= 1
ELSE
result := getFib(n-1) + getFib(n-2)
END;
RETURN result
END getFib;
BEGIN
IF Modules.ArgCount # 2 THEN
Out.String("one argument needed"); Out.Ln;
HALT(1);
END;
Modules.GetIntArg(1, Arg0);
Out.Int(getFib(Arg0), 0); Out.Ln;
END fibonacci.

33
examples/recursion/Fib.Mod.ob2 Normal file
View file

@ -0,0 +1,33 @@
MODULE fibonacci;
IMPORT Out, Modules;
VAR
n : LONGINT;
Arg0 : LONGINT;
PROCEDURE getFib (n : LONGINT) : LONGINT;
VAR result : LONGINT;
BEGIN
IF n = 0 THEN
result := 0
ELSIF n = 1 THEN
result:= 1
ELSE
result := getFib(n-1) + getFib(n-2)
END;
RETURN result
END getFib;
BEGIN
IF Modules.ArgCount # 2 THEN
Out.String("one argument needed"); Out.Ln;
HALT(1);
END;
Modules.GetIntArg(1, Arg0);
Out.Int(getFib(Arg0), 0); Out.Ln;
END fibonacci.

31
examples/recursion/Gcd.Mod Normal file
View file

@ -0,0 +1,31 @@
MODULE gcd;
IMPORT Out, Modules;
VAR
gcd : INTEGER;
arg0, arg1 : LONGINT;
PROCEDURE getGCD(a, b : INTEGER): INTEGER;
VAR ret : INTEGER;
BEGIN
IF a = 0 THEN ret := b;
ELSIF b = 0 THEN ret := a;
ELSIF b > a THEN ret := getGCD(b, a);
ELSE ret := getGCD(b, a MOD b) END;
RETURN ret;
END getGCD;
BEGIN
IF Modules.ArgCount # 3 THEN
Out.String("enter two integers to get GCD"); Out.Ln;
HALT(1)
END;
Modules.GetIntArg(1, arg0); Modules.GetIntArg(2, arg1);
gcd := getGCD(SHORT(arg0), SHORT(arg1));
Out.Int(gcd, 0); Out.Ln;
END gcd.

31
examples/recursion/Gcd.Mod.ob2 Normal file
View file

@ -0,0 +1,31 @@
MODULE gcd;
IMPORT Out, Modules;
VAR
gcd : INTEGER;
arg0, arg1 : LONGINT;
PROCEDURE getGCD(a, b : INTEGER): INTEGER;
VAR ret : INTEGER;
BEGIN
IF a = 0 THEN ret := b;
ELSIF b = 0 THEN ret := a;
ELSIF b > a THEN ret := getGCD(b, a);
ELSE ret := getGCD(b, a MOD b) END;
RETURN ret;
END getGCD;
BEGIN
IF Modules.ArgCount # 3 THEN
Out.String("enter two integers to get GCD"); Out.Ln;
HALT(1)
END;
Modules.GetIntArg(1, arg0); Modules.GetIntArg(2, arg1);
gcd := getGCD(SHORT(arg0), SHORT(arg1));
Out.Int(gcd, 0); Out.Ln;
END gcd.