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

⟦d11996a58⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Binary, seg_0359e4

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 Unary;
package body More_Binary is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            More : More_Binary.Node := More_Binary.Empty_Node;
            Una : Unary.Node := Unary.Empty_Node;
            Mess : Object.Message;
        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.Binary_Message =>

                Bounded_String.Copy (N.Mess, Lex.Get_Value);
                Lex.Next_Token;
                Unary.Parse (N.Una, Failed);
                if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                     Lex.Token'Pos (Lex.Binary_Message) then
                    N.Rule := 1;
                    More_Binary.Parse (N.More, 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.Binary_Message;
    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 := Object.Send (Inherited, N.Mess,
                                       Unary.Interpret (N.Una, Result));
            when 1 =>
                Result := Object.Send (Inherited, N.Mess,
                                       Unary.Interpret (N.Una, Result));
                Result := More_Binary.Interpret (N.More, Result);
        end case;
        return Result;
    end Interpret;
end More_Binary;

    nblk1=3
    nid=3
    hdr6=4
        [0x00] rec0=20 rec1=00 rec2=01 rec3=022
        [0x01] rec0=1e rec1=00 rec2=02 rec3=000
        [0x02] rec0=06 rec1=00 rec2=03 rec3=000
    tail 0x2152ecbf684da69fc6249 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 00 62 80 04 6c 74 29 3b 04 00 11 20 20 20  ┆   b  lt);      ┆