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

⟦bad22f1a1⟧ Ada Source

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

Derivation

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

with Message;
with Class_Printer;
with Unary;
with Bounded_String;

package body More_Binary is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Unar : Unary.Node := Unary.Empty_Node;
            More : More_Binary.Node := More_Binary.Empty_Node;
            Mess : Message.Binary;
            Line : Object.Index := Scanner.Get_Line_Number;
        end record;

    procedure Parse (N : in out Node) is
        use Scanner;
    begin  
        N := new Node_Structure;
        N.Rule := 0;
        Message.Put (Scanner.Get_Value, N.Mess);
        Scanner.Next;
        Unary.Parse (N.Unar);
        if Scanner.Get_Token = Scanner.Binary then
            N.Rule := 1;
            More_Binary.Parse (N.More);
        end if;
    end Parse;

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

    procedure Unparse (N : Node) is

        type E_Message is (Plus, Moins, Mul, Div, Egal, Diff, Sup,
                           Sup_Egal, Inf, Inf_Egal, Et, Ou, Eou);

        Token : E_Message;

    begin
        Token := E_Message'Value (Bounded_String.Image (Message.Get (N.Mess)));
        case Token is
            when Plus =>
                Class_Printer.Put (" + ");
            when Moins =>
                Class_Printer.Put (" - ");
            when Mul =>
                Class_Printer.Put (" * ");
            when Div =>
                Class_Printer.Put (" / ");
            when Egal =>
                Class_Printer.Put (" = ");
            when Diff =>
                Class_Printer.Put (" <> ");
            when Sup =>
                Class_Printer.Put (" > ");
            when Sup_Egal =>
                Class_Printer.Put (" >= ");
            when Inf =>
                Class_Printer.Put (" < ");
            when Inf_Egal =>
                Class_Printer.Put (" <= ");
            when Et =>
                Class_Printer.Put (" & ");
            when Ou =>
                Class_Printer.Put (" | ");
            when Eou =>
                Class_Printer.Put (" # ");
        end case;
        Unary.Unparse (N.Unar);
        if N.Rule = 1 then
            More_Binary.Unparse (N.More);
        end if;
    end Unparse;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        Scanner.Put_Line_Number (N.Line);
        Result := Unary.Interpret (N.Unar);
        Message.Put (Result, N.Mess);
        Result := Message.Send (N.Mess, Inherited);
        if N.Rule = 1 then
            Result := More_Binary.Interpret (N.More, Result);
        end if;
        return Result;
    end Interpret;

end More_Binary;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=26 rec1=00 rec2=01 rec3=00a
        [0x01] rec0=1d rec1=00 rec2=03 rec3=012
        [0x02] rec0=1e rec1=00 rec2=02 rec3=000
        [0x03] rec0=02 rec1=b7 rec2=30 rec3=342
    tail 0x21733998884df71ca0e9e 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 0c 80 06 69 6e 61 72 79 3b 06 00 00 00  ┆      inary;    ┆