|
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 - download
Length: 6144 (0x1800)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Corps_Cond, seg_04818f
└─⟦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, Variable, Nom_De_Variable, Etat, Nombre;
with Models, Symbols, Abstract_Tree, Bounded_String;
use Lexical, Token_List, Bounded_String;
package body Corps_Cond is
A_Number : Integer;
Follow : Token_List.Object := Make ((Equ, Inf, Infequ, Diffr, Sup,
Supequ, Et, Ou, Alors, Parntf));
procedure Parse (Node : in out Abstract_Tree.Object;
Models_Table : Models.Object;
Symbols_Table : Symbols.Object) is
Etat_Liaison : Lexical.Token;
Nom_Var, Nom_Ext : Variable_String (32);
Param1, Param2 : Variable_String (32);
Operation : Token;
begin
if Is_In (Lexical.Get_Token, Variable.First) then
Variable.Parse (Nom_Var, Nom_Ext);
Node := Abstract_Tree.Make_Node (Image (Nom_Var), Image (Nom_Ext),
Models_Table, Symbols_Table);
else
if Is_In (Lexical.Get_Token, Etat.First) then
Etat.Parse (Etat_Liaison);
Node := Abstract_Tree.Make_Node (Etat_Liaison);
else
if Is_In (Lexical.Get_Token, Nombre.First) then
Nombre.Parse (A_Number);
Node := Abstract_Tree.Make_Node (A_Number);
else
case Lexical.Get_Token is
when Existe_Connexion | Etat_Connexion |
Existe_Lien | Etat_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;
Node := Abstract_Tree.Make_Node
(Operation, Image (Param1),
Image (Param2));
else
Erreur.Syntaxe ("Manque )", Follow);
Node := Abstract_Tree.Make_Node (Vrai);
end if;
else
Erreur.Syntaxe ("Manque ,", Follow);
Node := Abstract_Tree.Make_Node (Vrai);
end if;
else
Erreur.Syntaxe ("Manque (", Follow);
Node := Abstract_Tree.Make_Node (Vrai);
end if;
when Vrai | Faux =>
Node := Abstract_Tree.Make_Node (Lexical.Get_Token);
Lexical.Next;
when others =>
Erreur.Syntaxe ("Mauvaise condition", Follow);
Node := Abstract_Tree.Make_Node (Vrai);
end case;
end if;
end if;
end if;
end Parse;
end Corps_Cond;
nblk1=5
nid=0
hdr6=a
[0x00] rec0=19 rec1=00 rec2=01 rec3=006
[0x01] rec0=01 rec1=00 rec2=05 rec3=04a
[0x02] rec0=15 rec1=00 rec2=02 rec3=00e
[0x03] rec0=10 rec1=00 rec2=03 rec3=00a
[0x04] rec0=16 rec1=00 rec2=04 rec3=001
tail 0x2174c277a865861982e57 0x42a00088462060003