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

⟦c99307dac⟧ Ada Source

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

Derivation

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

with Broker;
with Errors;
with Trace;
with Unary;
with Unparser;

package body More_Binary is

    type Node_Structure is
        record
            Line : Natural;
            Rule : Natural range 0 .. 1 := 0;
            Binm : Scanner.Lexeme;
            Unar : Unary.Node := Unary.Empty_Node;
            More : Node := Empty_Node;
        end record;

    procedure Parse (N : in out Node) is
    begin
        Trace.Display ("parsing More_Binary");
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        case Scanner.Get_Token is
            when Scanner.L_Binm =>
                N.Rule := 1;
                N.Binm := Scanner.Get_Value;
                Scanner.Next_Token;
                if Unary.Is_First (Scanner.Get_Token) then
                    Unary.Parse (N.Unar);
                    Parse (N.More);
                else
                    raise Errors.Expecting_Unary_After_Binary_Message;
                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.Binm);
                Unparser.Put (" ");
                Unary.Unparse (N.Unar);
                More_Binary.Unparse (N.More);
        end case;
        Trace.Display ("fin unparse more_binary");
    end Unparse;

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

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        Errors.Save_Interpret_Line (N.Line);
        case N.Rule is
            when 0 =>
                Result := Inherited;
            when 1 =>
                Result := Unary.Interpret (N.Unar);
                Result := Broker.Send (Inherited, N.Binm, Result);
                Result := Interpret (N.More, Result);
        end case;
        Trace.Display ("fin interpretation More_Binary");
        Trace.Display (Result);
        return Result;
    end Interpret;

end More_Binary;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=22 rec1=00 rec2=01 rec3=016
        [0x01] rec0=22 rec1=00 rec2=03 rec3=036
        [0x02] rec0=0e rec1=00 rec2=02 rec3=000
        [0x03] rec0=0c rec1=00 rec2=04 rec3=000
    tail 0x2153132a084e58e706d19 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 01 d7 80 14 20 20 20 20 20 20 20 20 20 20  ┆                ┆