DataMuseum.dk Presents historical artifacts from the history of: Rational R1000/400

This is an automatic "excavation" of a thematic subset of artifacts from Datamuseum.dk's BitArchive. See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software.

top - download

⟦24cfc03f7⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body While_Structure, seg_038b62

Derivation

└─⟦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;
with Condition, Description_List;

package body While_Structure 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.Tant) then
            N1 := new Binary_Tree.Node_Structure;
            N1.The_Type := Binary_Tree.Tant_Que_Type;
            Debug.Put (280);
            Lex.Next;
            if Lex.Current_Token_Is (Lex.Que) then
                Debug.Put (281);
                Lex.Next;
                Condition.Parse (N1.Left_Son, Ok);
                Success := Success and Ok;
                if Lex.Current_Token_Is (Lex.Faire) then
                    Debug.Put (282);
                    Lex.Next;
                    Description_List.Parse (N1.Right_Son, Ok);
                    Success := Success and Ok;
                    if Lex.Current_Token_Is (Lex.Fin) then
                        Debug.Put (283);
                        Lex.Next;
                        if Lex.Current_Token_Is (Lex.Tant) then
                            Debug.Put (284);
                            Lex.Next;
                            if Lex.Current_Token_Is (Lex.Que) then
                                Debug.Put (285);
                                Lex.Next;
                            else
                                Error.Append (21);
                                Success := False;
                            end if;
                        else
                            Error.Append (22);
                            Success := False;
                        end if;
                    else
                        Error.Append (23);
                        Success := False;
                    end if;
                else
                    Error.Append (24);
                    Success := False;
                end if;
            else
                Error.Append (25);
                Success := False;
            end if;
        end if;  
        N := N1;
    end Parse;


    procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
    begin
        while Condition.Generate (N.Left_Son) loop
            Description_List.Generate (N.Right_Son, T);
        end loop;
    end Generate;

end While_Structure;

    nblk1=4
    nid=0
    hdr6=8
        [0x00] rec0=1b rec1=00 rec2=01 rec3=06c
        [0x01] rec0=01 rec1=00 rec2=02 rec3=00a
        [0x02] rec0=18 rec1=00 rec2=04 rec3=014
        [0x03] rec0=12 rec1=00 rec2=03 rec3=000
    tail 0x2173665f084e8391fc3c8 0x42a00088462060003