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

⟦bbe426d50⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Unary, seg_038ed3, seg_038f61

Derivation

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

with Lex;
with Object;
with Bounded_String;
with Unparser;
package body More_Unary is
    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;  
    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                Unparser.Put (" ");
                Unparser.Put (Bounded_String.Image (N.Mess));

            when 1 =>  
                Unparser.Put (" ");
                Unparser.Put (Bounded_String.Image (N.Mess));
                More_Unary.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);
            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=4
    nid=3
    hdr6=6
        [0x00] rec0=21 rec1=00 rec2=01 rec3=00e
        [0x01] rec0=1f rec1=00 rec2=04 rec3=004
        [0x02] rec0=03 rec1=00 rec2=02 rec3=000
        [0x03] rec0=02 rec1=a6 rec2=be rec3=442
    tail 0x21531ed1a84e86f6e322c 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 00 cc 80 29 65 73 75 6c 74 20 3a 3d 20 4f  ┆     )esult := O┆