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

⟦ffb5e7015⟧ Ada Source

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

Derivation

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

with Text_Io;
with Lex;
with Object;
with Bounded_String;
with Bloc_Class;
package body More1_List is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Ident : Object.Message;
            More1 : More1_List.Node := More1_List.Empty_Node;
        end record;

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

    begin
        N := new Node_Structure;
        case Lex.Get_Token is

            when Lex.Identifier =>
                Bounded_String.Copy (N.Ident, Lex.Get_Value);
                Bloc_Class.Local_Put (N.Ident);
                Lex.Next_Token;
                if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                     Lex.Token'Pos (Lex.Identifier) then

                    N.Rule := 1;
                    More1_List.Parse (N.More1, Failed);
                end if;
            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;
    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return T = Lex.Identifier;
    end Is_First;
    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;
            when 1 =>
                Result := Inherited;
                Result := More1_List.Interpret (N.More1, Result);
        end case;
        return Result;
    end Interpret;
    procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is
        Obj : Object.Reference;
    begin
        case N.Rule is
            when 0 =>  
                Object.Parameters.Get (The_Argument, Obj);
                Bloc_Class.Set (N.Ident, Obj);

            when 1 =>
                Object.Parameters.Get (The_Argument, Obj);
                Bloc_Class.Set (N.Ident, Obj);
                Set (N.More1, The_Argument);
        end case;



    end Set;
end More1_List;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=1e rec1=00 rec2=01 rec3=05e
        [0x01] rec0=1f rec1=00 rec2=03 rec3=04a
        [0x02] rec0=0e rec1=00 rec2=02 rec3=000
        [0x03] rec0=0e rec1=00 rec2=02 rec3=000
    tail 0x2152ed0d084da6bc5881c 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 09 80 06 6f 72 65 31 2c 20 06 05 20 04  ┆      ore1,     ┆