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

⟦6667e3046⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Unary, seg_0359e6

Derivation

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

with Text_Io;
with Lex;
with Object;
with Bounded_String;
package body More_Unary is
    subtype Message is String;
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            More : More_Unary.Node := More_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.Identifier =>

                Bounded_String.Copy (N.Mess, Lex.Get_Value);
                Lex.Next_Token;
                if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                     Lex.Token'Pos (Lex.Identifier) then
                    N.Rule := 1;
                    More_Unary.Parse (N.More, Failed);
                end if;
            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;
    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return T = Lex.Identifier;
    end Is_First;
    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);
            when 1 =>
                Result := Object.Send (Inherited, N.Mess);
                Result := More_Unary.Interpret (N.More, Result);
        end case;
        return Result;

    end Interpret;
end More_Unary;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=23 rec1=00 rec2=01 rec3=00a
        [0x01] rec0=18 rec1=00 rec2=02 rec3=001
    tail 0x2152ecc7084da6a3fa451 0x42a00088462060003