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 - metrics - download

⟦1ba6038e5⟧ Ada Source

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

Derivation

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

with Expression, More_Statements, Scanner, Objects;
package body Statements is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 2 := 0;
            Expr : Expression.Node := Expression.Empty_Node;
            More : More_Statements.Node := More_Statements.Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := True;
    begin
        N := new Node_Structure;
        if Expression.Is_First (Scanner.Symbol) then
            N.Rule := 1;
            Expression.Parse (N.Expr, Failed);
            if not Failed then
                More_Statements.Parse (N.More, Failed);
            end if;
        else
            N.Rule := 2;
            case Scanner.Symbol is
                when Scanner.Renvoyer =>
                    Expression.Parse (N.Expr, Failed);
                when others =>
                    Failed := True;
            end case;
        end if;
        Error := Failed;
    end Parse;


    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Renvoyer or else Expression.Is_First (T);
    end Is_First;


    function Interpret (N : Node) return Objects.Reference is
        Result : Objects.Reference := Objects.Void_Reference;
        use More_Statements;
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Result := Expression.Interpret (N.Expr);
                if N.More /= More_Statements.Empty_Node then
                    Result := More_Statements.Interpret (N.More);
                end if;
            when 2 =>
                Result := Expression.Interpret (N.Expr);
        end case;
        return Result;
    end Interpret;

end Statements;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=1e rec1=00 rec2=01 rec3=010
        [0x01] rec0=1f rec1=00 rec2=02 rec3=000
    tail 0x217013cf081aa4c81229c 0x42a00088462060003