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

⟦9a6f53137⟧ TextFile

    Length: 2242 (0x8c2)
    Types: TextFile
    Names: »B«

Derivation

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

TextFile

with Text_Io;
with Lex;
with Object;
with Bounded_String;
with Unary;  
with Unparser;
package body More_Binary is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            More : More_Binary.Node := More_Binary.Empty_Node;
            Una : Unary.Node := Unary.Empty_Node;
            Mess : Object.Message;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;

    begin
        N := new Node_Structure;
        case Lex.Get_Token is

            when Lex.Binary_Message =>

                Bounded_String.Copy (N.Mess, Lex.Get_Value);
                Lex.Next_Token;
                Unary.Parse (N.Una, Failed);
                if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                     Lex.Token'Pos (Lex.Binary_Message) then
                    N.Rule := 1;
                    More_Binary.Parse (N.More, Failed);
                end if;
            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                Unparser.Put (" ");
                Unparser.Put (Bounded_String.Image (N.Mess));
                Unary.Unparse (N.Una);
            when 1 =>
                Unparser.Put (" ");
                Unparser.Put (Bounded_String.Image (N.Mess));
                Unary.Unparse (N.Una);
                More_Binary.Unparse (N.More);
        end case;
    end Unparse;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        case N.Rule is
            when 0 =>
                Result := Object.Send (Inherited, N.Mess,
                                       Unary.Interpret (N.Una, Result));
            when 1 =>
                Result := Object.Send (Inherited, N.Mess,
                                       Unary.Interpret (N.Una, Result));
                Result := More_Binary.Interpret (N.More, Result);
        end case;
        return Result;
    end Interpret;
end More_Binary;