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

⟦848428319⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Value, seg_038f24, seg_038f74

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 Binary;
with Error_Broadcaster;
with More_Value;
package body Value is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Bin : Binary.Node := Binary.Empty_Node;
            More : More_Value.Node := More_Value.Empty_Node;
        end record;

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

    begin
        N := new Node_Structure;
        Binary.Parse (N.Bin, Failed);
        if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                             Lex.Token'Pos (Lex.Key_Word) then
            N.Rule := 1;
            More_Value.Parse (N.More, Failed);
        end if;
        if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                             Lex.Token'Pos (Lex.Prendre) then
            raise Error_Broadcaster.Pour_Is_Missing;
        end if;
        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                Binary.Unparse (N.Bin);
            when 1 =>
                Binary.Unparse (N.Bin);
                More_Value.Unparse (N.More);
        end case;
    end Unparse;

    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return Binary.Is_First (T);

    end Is_First;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is

        Result : Object.Reference;
        This_List : Object.Parameters.List;

    begin
        case N.Rule is
            when 0 =>
                Result := Binary.Interpret (N.Bin);
            when 1 =>
                Result := Binary.Interpret (N.Bin);

                More_Value.Interpret (N.More, This_List);
                Result := Object.Send (Result, This_List);
        end case;
        return Result;
    end Interpret;
end Value;

    nblk1=4
    nid=2
    hdr6=6
        [0x00] rec0=1e rec1=00 rec2=01 rec3=030
        [0x01] rec0=24 rec1=00 rec2=04 rec3=036
        [0x02] rec0=06 rec1=00 rec2=03 rec3=000
        [0x03] rec0=02 rec1=a2 rec2=18 rec3=342
    tail 0x21531fb3c84e875ad6701 0x42a00088462060003
Free Block Chain:
  0x2: 0000  00 00 00 88 80 30 20 20 20 20 20 20 52 65 73 75  ┆     0      Resu┆