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

⟦e9e83ec0a⟧ Ada Source

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

Derivation

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

with Binary;
with Errors;
with Trace;
with Unparser;

package body More_Value is

    type Node_Structure is
        record
            Line : Natural;
            Rule : Natural range 0 .. 1 := 0;
            Keyw : Scanner.Lexeme;
            Bin : Binary.Node := Binary.Empty_Node;
            More : Node := Empty_Node;
        end record;

    procedure Parse (N : in out Node) is
    begin
        Trace.Display ("parsing More_Value");
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        case Scanner.Get_Token is
            when Scanner.L_Keyw =>
                N.Rule := 1;
                N.Keyw := Scanner.Get_Value;
                Scanner.Next_Token;
                if Binary.Is_First (Scanner.Get_Token) then
                    Binary.Parse (N.Bin);
                    Parse (N.More);
                else
                    raise Errors.Expecting_Binary_After_Keyword;
                end if;
            when others =>
                null;
        end case;
    end Parse;

    procedure Unparse (N : Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Unparser.Put (N.Keyw);
                Unparser.Put (" ");
                Binary.Unparse (N.Bin);
                More_Value.Unparse (N.More);
        end case;
        Trace.Display ("fin unparse more_value");
    end Unparse;


    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Scanner.L_Keyw;
    end Is_First;

    procedure Interpret (N : Node;
                         Selector : in out Message.Selector;
                         Arg_List : in out Parameters.List) is
        Result : Object.Reference := Object.Void_Reference;
    begin
        Errors.Save_Interpret_Line (N.Line);
        case N.Rule is
            when 0 =>  
                null;
            when 1 =>  
                Interpret (N.More, Selector, Arg_List);
                Message.Insert (N.Keyw, Selector);
                Result := Binary.Interpret (N.Bin);  
                Parameters.Insert (Result, Arg_List);
        end case;
        Trace.Display ("fin interpretation More_Value");
        Trace.Display (Result);
    end Interpret;

end More_Value;

    nblk1=4
    nid=3
    hdr6=6
        [0x00] rec0=22 rec1=00 rec2=01 rec3=00a
        [0x01] rec0=22 rec1=00 rec2=04 rec3=02a
        [0x02] rec0=0e rec1=00 rec2=02 rec3=000
        [0x03] rec0=0c rec1=00 rec2=03 rec3=000
    tail 0x21531332484e58ea553a2 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 01 f8 80 03 65 29 3b 03 00 16 20 20 20 20  ┆      e);       ┆