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 - metrics - download

⟦b7bcb2c63⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Binary, seg_038e7f, seg_038f3c

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

        end record;

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

    begin
        N := new Node_Structure;
        if Unary.Is_First (Lex.Get_Token) then
            N.Rule := 0;
            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;
        end if;


        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>

                Unary.Unparse (N.Una);
            when 1 =>
                Unary.Unparse (N.Una);
                More_Binary.Unparse (N.More);
        end case;
    end Unparse;


    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return Unary.Is_First (T);
    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 := Unary.Interpret (N.Una);
            when 1 =>
                Result := Unary.Interpret (N.Una);
                Result := More_Binary.Interpret (N.More, Result);
        end case;  
        return Result;
    end Interpret;
end Binary;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=26 rec1=00 rec2=01 rec3=018
        [0x01] rec0=20 rec1=00 rec2=02 rec3=001
    tail 0x21531e7ac84e869db5c84 0x42a00088462060003