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

⟦21453ce91⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Statements, seg_038c4b, seg_039419, seg_039564

Derivation

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

with Errors;
with Expression;
with More_Statements;
with Object;
with Scanner;
with Trace;
with Unparser;

package body Statements is

    type Node_Structure is
        record
            Line : Natural;
            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) is
    begin
        Trace.Display ("parsing Statements");
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        if Expression.Is_First (Scanner.Get_Token) then
            N.Rule := 1;
            Expression.Parse (N.Expr);
            More_Statements.Parse (N.More);
        else
            case Scanner.Get_Token is
                when Scanner.L_Renv =>
                    N.Rule := 2;
                    Scanner.Next_Token;
                    Expression.Parse (N.Expr);
                when others =>
                    null;
            end case;
        end if;
    end Parse;

    procedure Unparse (N : Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Expression.Unparse (N.Expr);
                More_Statements.Unparse (N.More);
            when 2 =>
                Unparser.Put ("Renvoyer ");
                Expression.Unparse (N.Expr);
        end case;
        Trace.Display ("fin unparse statements");
    end Unparse;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        Errors.Save_Interpret_Line (N.Line);
        case N.Rule is
            when 0 =>
                Result := Inherited;
            when 1 =>
                Result := Expression.Interpret (N.Expr);               Result := More_Statements.Interpret (N.More, Result);
            when 2 =>
                Result := Expression.Interpret (N.Expr);
        end case;
        Trace.Display ("fin interpretation Statements");
        Trace.Display (Result);
        return Result;
    end Interpret;

end Statements;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=22 rec1=00 rec2=01 rec3=05c
        [0x01] rec0=21 rec1=00 rec2=03 rec3=002
        [0x02] rec0=0c rec1=00 rec2=02 rec3=000
        [0x03] rec0=02 rec1=a3 rec2=d6 rec3=142
    tail 0x21531c9e884e846579fe9 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 06 80 03 72 29 3b 03 65 20 28 4e 2e 45  ┆      r); e (N.E┆