DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

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 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - download
Index: ┃ B T ┃

⟦06fb19e88⟧ TextFile

    Length: 1975 (0x7b7)
    Types: TextFile
    Names: »B«

Derivation

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧

TextFile

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;