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

⟦d1f7b505f⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Unary, seg_038f1f, seg_038f72

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 More_Unary;
with Primary;
package body Unary is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Prim : Primary.Node := Primary.Empty_Node;
            More : More_Unary.Node := More_Unary.Empty_Node;

        end record;

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

    begin
        N := new Node_Structure;
        if Primary.Is_First (Lex.Get_Token) then
            N.Rule := 0;
            Primary.Parse (N.Prim, Failed);
            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;
        end if;


        Error := Failed;
    end Parse;
    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                Primary.Unparse (N.Prim);
            when 1 =>
                Primary.Unparse (N.Prim);
                More_Unary.Unparse (N.More);
        end case;
    end Unparse;

    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return Primary.Is_First (T);
    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 := Primary.Interpret (N.Prim);
            when 1 =>
                Result := Primary.Interpret (N.Prim);
                Result := More_Unary.Interpret (N.More, Result);
        end case;
        return Result;
    end Interpret;
end Unary;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=24 rec1=00 rec2=01 rec3=028
        [0x01] rec0=1d rec1=00 rec2=02 rec3=001
    tail 0x21531faba84e87530f91e 0x42a00088462060003