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

⟦2ddfc55cd⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Case_Structure, seg_037aeb, seg_0389cb

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─ ⟦5a81ac88f⟧ »Space Info Vol 1« 
        └─⟦this⟧ 
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─ ⟦cfc2e13cd⟧ »Space Info Vol 2« 
        └─⟦this⟧

E3 Source Code



with Lex, Error, Debug, Symbol;
with Case_List;
package body Case_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.Selon) then
            N1 := new Binary_Tree.Node_Structure;
            N1.The_Type := Binary_Tree.Selon_Type;
            Debug.Put (260);
            Lex.Next;
            if Lex.Current_Token_Is (Lex.Identifier) then
                N1.S := new String'(Lex.Image);
                Debug.Put (261);
                Lex.Next;
                if Lex.Current_Token_Is (Lex.Est) then
                    Debug.Put (262);
                    Lex.Next;
                    Case_List.Parse (N1.Right_Son, Ok);
                    Success := Success and Ok;
                    if Lex.Current_Token_Is (Lex.Fin) then
                        Debug.Put (263);
                        Lex.Next;
                        if Lex.Current_Token_Is (Lex.Selon) then
                            Debug.Put (264);
                            Lex.Next;  
                        else
                            Error.Append (27);
                            Success := False;
                        end if;
                    else
                        Error.Append (28);
                        Success := False;
                    end if;
                else
                    Error.Append (29);
                    Success := False;
                end if;
            else
                Error.Append (30);
                Success := False;
            end if;  
            N := N1;
        end if;
    end Parse;


    procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
    begin  
        Case_List.Generate (N.Right_Son, T, N.S.all);
    end Generate;


end Case_Structure;

E3 Meta Data

    nblk1=3
    nid=3
    hdr6=4
        [0x00] rec0=1b rec1=00 rec2=01 rec3=020
        [0x01] rec0=21 rec1=00 rec2=02 rec3=001
        [0x02] rec0=0b rec1=00 rec2=00 rec3=004
    tail 0x21734e45884e485e3250b 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 00 13 80 0a 53 74 72 75 63 74 75 72 65 3b  ┆      Structure;┆