|
|
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: 10240 (0x2800)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Instructions, seg_0464ff
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Lexical, Token_List, Erreur, Instruction_Si, Nom_De_Variable,
Variable, Expression_Generale, Etat, Param_Afficher;
with Models, Symbols, Comps_Dictionary, Verbs_Dictionary;
with Abstract_Tree, Bounded_String, Text_Io;
use Lexical, Token_List, Bounded_String;
package body Instructions is
Node : Abstract_Tree.Object; -- Phase de test
Instruction_First : Token_List.Object :=
Make ((Si, Moins, Comp, Detruire_Connexion, Lie_Connexion,
Delie_Connexion, Detruire_Lien, Lie_Lien, Delie_Lien,
Liste_Lien, Echanger_Lien, Afficher, Fin));
procedure Instruction (Models_Table : Models.Object;
Symbols_Table : Symbols.Object;
Comp : Comps_Dictionary.Object;
Dict : Verbs_Dictionary.Object) is
Etat_Liaison : Lexical.Token;
Nom_Var, Nom_Ext : Variable_String (32);
Param1, Param2, Param3 : Variable_String (32);
Operation : Token;
begin
if Is_In (Lexical.Get_Token, Instruction_Si.First) then
Instruction_Si.Parse (Models_Table, Symbols_Table, Comp, Dict);
else
if Is_In (Lexical.Get_Token, Variable.First) then
Variable.Parse (Nom_Var, Nom_Ext);
if Lexical.Get_Token = Affect then
Lexical.Next;
Expression_Generale.Parse
(Node, Models_Table, Symbols_Table);
Text_Io.Put_Line ("**********************************");
Abstract_Tree.Dump (Node);
Text_Io.Put_Line ("Type retourne: " &
Abstract_Tree.Node_Type'Image
(Abstract_Tree.What_Type (Node)));
Abstract_Tree.Destroy (Node);
else
Erreur.Syntaxe ("Manque :=");
end if;
else
case Lexical.Get_Token is
when Echanger_Lien =>
Operation := Lexical.Get_Token;
Lexical.Next;
if Lexical.Get_Token = Parnto then
Lexical.Next;
Nom_De_Variable.Parse (Param1);
if Lexical.Get_Token = Virgul then
Lexical.Next;
Nom_De_Variable.Parse (Param2);
if Lexical.Get_Token = Virgul then
Lexical.Next;
Nom_De_Variable.Parse (Param3);
if Lexical.Get_Token = Parntf then
Lexical.Next;
else
Erreur.Syntaxe ("Manque )");
end if;
else
Erreur.Syntaxe ("Manque ,");
end if;
else
Erreur.Syntaxe ("Manque ,");
end if;
else
Erreur.Syntaxe ("Manque (");
end if;
when Lie_Connexion | Delie_Connexion |
Lie_Lien | Delie_Lien =>
Operation := Lexical.Get_Token;
Lexical.Next;
if Lexical.Get_Token = Parnto then
Lexical.Next;
Nom_De_Variable.Parse (Param1);
if Lexical.Get_Token = Virgul then
Lexical.Next;
Nom_De_Variable.Parse (Param2);
if Lexical.Get_Token = Parntf then
Lexical.Next;
else
Erreur.Syntaxe ("Manque )");
end if;
else
Erreur.Syntaxe ("Manque ,");
end if;
else
Erreur.Syntaxe ("Manque (");
end if;
when Liste_Lien =>
Operation := Lexical.Get_Token;
Lexical.Next;
if Lexical.Get_Token = Parnto then
Lexical.Next;
Nom_De_Variable.Parse (Param1);
if Lexical.Get_Token = Virgul then
Lexical.Next;
Etat.Parse (Etat_Liaison);
if Lexical.Get_Token = Parntf then
Lexical.Next;
else
Erreur.Syntaxe ("Manque )");
end if;
else
Erreur.Syntaxe ("Manque ,");
end if;
else
Erreur.Syntaxe ("Manque (");
end if;
when Afficher =>
Lexical.Next;
if Lexical.Get_Token = Parnto then
Lexical.Next;
Param_Afficher.Parse;
if Lexical.Get_Token = Parntf then
Lexical.Next;
else
Erreur.Syntaxe ("Manque )");
end if;
else
Erreur.Syntaxe ("Manque (");
end if;
when Fin =>
Lexical.Next;
when others =>
Erreur.Syntaxe ("Mauvaise instruction");
end case;
end if;
end if;
end Instruction;
procedure Parse (Models_Table : Models.Object;
Symbols_Table : Symbols.Object;
Comp : Comps_Dictionary.Object;
Dict : Verbs_Dictionary.Object) is
begin
Instruction (Models_Table, Symbols_Table, Comp, Dict);
while Is_In (Lexical.Get_Token, Instruction_First) loop
Instruction (Models_Table, Symbols_Table, Comp, Dict);
end loop;
end Parse;
end Instructions;
nblk1=9
nid=4
hdr6=10
[0x00] rec0=19 rec1=00 rec2=01 rec3=06a
[0x01] rec0=17 rec1=00 rec2=06 rec3=02e
[0x02] rec0=07 rec1=00 rec2=08 rec3=028
[0x03] rec0=12 rec1=00 rec2=09 rec3=02e
[0x04] rec0=15 rec1=00 rec2=07 rec3=072
[0x05] rec0=17 rec1=00 rec2=03 rec3=070
[0x06] rec0=1c rec1=00 rec2=02 rec3=00c
[0x07] rec0=19 rec1=00 rec2=05 rec3=000
[0x08] rec0=dc rec1=40 rec2=e8 rec3=726
tail 0x21748a85c86503e422f40 0x42a00088462060003
Free Block Chain:
0x4: 0000 00 00 00 a9 80 23 20 20 20 20 20 20 20 20 20 20 ┆ # ┆