|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 7168 (0x1c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Analyseur_Joueur, seg_0468c1
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Itf_Joueur, Dictionnary, Unbounded_String, Text_Io;
package body Analyseur_Joueur is
package Infinite_String is new Unbounded_String (1);
Maxword : constant Positive := 3;
Tab_Word : array (1 .. Maxword) of Infinite_String.Variable_String;
Tab_Token : array (1 .. Maxword) of Token_Itf;
procedure Initialize is
begin
for I in 1 .. Maxword loop
Infinite_String.Free (Tab_Word (I));
Tab_Token (I) := Empty;
end loop;
end Initialize;
procedure Next_Entry is
begin
Initialize;
while not Itf_Joueur.Next_Command loop
Text_Io.Put_Line ("Vous ne devez donner que trois mots au maximum");
end loop;
Tab_Word (1) := Infinite_String.Value (Itf_Joueur.Get_Value (1));
if not (Infinite_String.Length (Tab_Word (1)) = 0) then
if Dictionnary.Is_Verb (Infinite_String.Image (Tab_Word (1))) then
Tab_Token (1) := Verb;
else
if Dictionnary.Is_Complement
(Infinite_String.Image (Tab_Word (1))) then
Tab_Token (1) := Complement;
else
Tab_Token (1) := Unknown;
end if;
end if;
else
Tab_Token (1) := Empty;
end if;
Tab_Word (2) := Infinite_String.Value (Itf_Joueur.Get_Value (2));
if not (Infinite_String.Length (Tab_Word (2)) = 0) then
if Dictionnary.Is_Verb (Infinite_String.Image (Tab_Word (2))) then
Tab_Token (2) := Verb;
else
if Dictionnary.Is_Complement
(Infinite_String.Image (Tab_Word (2))) then
Tab_Token (2) := Complement;
else
Tab_Token (2) := Unknown;
end if;
end if;
else
Tab_Token (2) := Empty;
end if;
Tab_Word (3) := Infinite_String.Value (Itf_Joueur.Get_Value (3));
if not (Infinite_String.Length (Tab_Word (3)) = 0) then
if Dictionnary.Is_Verb (Infinite_String.Image (Tab_Word (3))) then
Tab_Token (3) := Verb;
else
if Dictionnary.Is_Complement
(Infinite_String.Image (Tab_Word (3))) then
Tab_Token (3) := Complement;
else
Tab_Token (3) := Unknown;
end if;
end if;
else
Tab_Token (3) := Empty;
end if;
end Next_Entry;
function Get_Word (I : Positive) return String is
begin
return Infinite_String.Image (Tab_Word (I));
end Get_Word;
function Get_Token_Itf (I : Positive) return Token_Itf is
begin
return Tab_Token (I);
end Get_Token_Itf;
end Analyseur_Joueur;
nblk1=6
nid=2
hdr6=6
[0x00] rec0=21 rec1=00 rec2=01 rec3=01e
[0x01] rec0=1b rec1=00 rec2=06 rec3=036
[0x02] rec0=21 rec1=00 rec2=03 rec3=000
[0x03] rec0=01 rec1=00 rec2=02 rec3=000
[0x04] rec0=07 rec1=00 rec2=03 rec3=000
[0x05] rec0=43 rec1=02 rec2=40 rec3=6ab
tail 0x215433cdc86515cb19e4a 0x42a00088462060003
Free Block Chain:
0x2: 0000 00 04 00 03 00 00 00 01 00 00 00 75 72 6e 20 54 ┆ urn T┆
0x4: 0000 00 05 03 fc 80 21 20 20 20 20 69 66 20 44 69 63 ┆ ! if Dic┆
0x5: 0000 00 00 00 bc 80 14 6f 6b 65 6e 20 28 32 29 20 3a ┆ oken (2) :┆