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

⟦f626bef63⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body List, seg_038eb7, seg_038f5a

Derivation

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

with Lex;
with Object;
with More1_List;
with More2_List;
package body List is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            More1 : More1_List.Node := More1_List.Empty_Node;
            More2 : More2_List.Node := More2_List.Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;

    begin
        N := new Node_Structure;

        if Lex.Token'Pos (Lex.Get_Token) = Lex.Token'Pos (Lex.Identifier) then
            N.Rule := 0;
            More1_List.Parse (N.More1, Failed);
        else
            if Lex.Token'Pos (Lex.Get_Token) = Lex.Token'Pos (Lex.Key_Word) then
                N.Rule := 1;
                More2_List.Parse (N.More2, Failed);
            end if;
        end if;


        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                More1_List.Unparse (N.More1);
            when 1 =>
                More2_List.Unparse (N.More2);
        end case;
    end Unparse;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        case N.Rule is
            when 0 =>
                Result := Inherited;
                Result := More1_List.Interpret (N.More1, Result);
            when 1 =>
                Result := Inherited;
                Result := More2_List.Interpret (N.More2, Result);

        end case;
        return Result;
    end Interpret;
    procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is

    begin
        case N.Rule is
            when 0 =>
                More1_List.Set (N.More1, The_Argument);
            when 1 =>
                More2_List.Set (N.More2, The_Argument);
        end case;
    end Set;

end List;

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=25 rec1=00 rec2=01 rec3=012
        [0x01] rec0=1e rec1=00 rec2=03 rec3=050
        [0x02] rec0=06 rec1=00 rec2=02 rec3=000
    tail 0x21531eae284e86ddf2f3e 0x42a00088462060003