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

⟦a439bb2aa⟧ Ada Source

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

Derivation

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

with Object, Unary, Message, Argument, Scanner, Printer;
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 := Empty_Node;
            Mess : Message.Selector;  
            Line : Natural;
        end record;

    procedure Parse (N : in out Node) is
        use Scanner;
    begin  
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        N.Mess := Scanner.Get_Value;
        Scanner.Next;
        Unary.Parse (N.Unar);
        if Is_First (Scanner.Get_Token) then
            N.Rule := 1;
            Parse (N.More);
        end if;
    end Parse;

    procedure Unparse (N : in Node) is
    begin  
        Scanner.Set_Line_Number (N.Line);
        Printer.Write (Message.Get (N.Mess));
        Unary.Unparse (N.Unar);
        if N.Rule = 1 then
            Unparse (N.More);
        end if;
    end Unparse;

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

    function Interpret (N : Node; Inherited : Object.Reference)
                       return Object.Reference is
        Result : Object.Reference;
        Args : Argument.List;
    begin  
        Scanner.Set_Line_Number (N.Line);
        Argument.Init (L => Args);
        case N.Rule is
            when 0 =>
                Result := Unary.Interpret (N.Unar);
                Args := Argument.Put (L => Args, Obj => Result);
                Result := Message.Send (Inherited, N.Mess, Args);
            when 1 =>
                Result := Unary.Interpret (N.Unar);
                Args := Argument.Put (L => Args, Obj => Result);
                Result := Message.Send (Inherited, N.Mess, Args);
                Result := Interpret (N.More, Result);
        end case;
        return (Result);
    end Interpret;
end More_Binary;

    nblk1=4
    nid=2
    hdr6=6
        [0x00] rec0=22 rec1=00 rec2=01 rec3=026
        [0x01] rec0=1b rec1=00 rec2=04 rec3=020
        [0x02] rec0=04 rec1=00 rec2=03 rec3=000
        [0x03] rec0=02 rec1=b7 rec2=83 rec3=742
    tail 0x217337c2884df5d4ff0c2 0x42a00088462060003
Free Block Chain:
  0x2: 0000  00 00 03 fc 80 0c 65 6e 64 20 55 6e 70 61 72 73  ┆      end Unpars┆