|
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: 3072 (0xc00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Body_Description, seg_038b3d
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Lex, Error, Debug, Binary_Tree;
with Description_List;
package body Body_Description is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1 : Binary_Tree.Node;
Ok : Boolean := True;
begin
Success := True;
if Lex.Current_Token_Is (Lex.Begin_Bracket) then
N1 := new Binary_Tree.Node_Structure;
N1.The_Type := Binary_Tree.Body_Type;
Debug.Put (230);
Lex.Next;
Description_List.Parse (N1.Right_Son, Ok);
Success := Success and Ok;
if Lex.Current_Token_Is (Lex.End_Bracket) then
Debug.Put (231);
Lex.Next;
else
Error.Append (31);
Success := False;
end if;
N := N1;
else
Error.Append (57);
end if;
end Parse;
procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
begin
Debug.Put (2);
if not Binary_Tree."=" (N.Right_Son, null) then
case N.Right_Son.The_Type is
when Binary_Tree.Null_Type =>
Generate (N.Right_Son, T);
when Binary_Tree.L_Description_Type =>
Description_List.Generate (N.Right_Son, T);
when others =>
null;
end case;
end if;
end Generate;
end Body_Description;
nblk1=2
nid=0
hdr6=4
[0x00] rec0=21 rec1=00 rec2=01 rec3=068
[0x01] rec0=10 rec1=00 rec2=02 rec3=001
tail 0x2173663d284e839082adf 0x42a00088462060003