|
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: 3072 (0xc00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Description_List, seg_0389d4
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Lex, Description;
with Debug;
package body Description_List is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1 : Binary_Tree.Node;
Ok : Boolean := True;
begin
Success := True;
N1 := new Binary_Tree.Node_Structure;
N1.The_Type := Binary_Tree.L_Description_Type;
Description.Parse (N1.Left_Son, Ok);
Success := Success and Ok;
if Lex.Current_Token_In ((Lex.Si, Lex.Selon, Lex.Tant,
Lex.Attendre, Lex.Pour, Lex.Puis, Lex.Au,
Lex.Identifier, Lex.Executer)) then
Parse (N1.Right_Son, Ok);
Success := Success and Ok;
end if;
N := N1;
end Parse;
procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
begin
Debug.Put (3);
case N.Left_Son.The_Type is
when Binary_Tree.Null_Type =>
Debug.Put (31);
Generate (N.Right_Son, T);
when Binary_Tree.Description_Type =>
Debug.Put (32);
Description.Generate (N.Left_Son, T);
if not Binary_Tree."=" (N.Right_Son, null) then
Generate (N.Right_Son, T);
end if;
when others =>
Debug.Put (33);
null;
end case;
end Generate;
end Description_List;
nblk1=2
nid=0
hdr6=4
[0x00] rec0=1f rec1=00 rec2=01 rec3=014
[0x01] rec0=10 rec1=00 rec2=02 rec3=001
tail 0x21735637a84e57a2e27e6 0x42a00088462060003