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

⟦a00784b82⟧ Ada Source

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

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, Object;

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 := False;
    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
            case Scanner.Symbol is
                when Scanner.Renvoyer =>
                    N.Rule := 2;
                    Scanner.Next;
                    Expression.Parse (N.Expr, Failed);
                when Other =>
                    null;
            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;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
                       result : object.reference;
                       begin
                       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;
                       return result;
                       end Interpret;
end Statements;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=1d rec1=00 rec2=01 rec3=032
        [0x01] rec0=1a rec1=00 rec2=02 rec3=001
    tail 0x2172b802484bd54a23851 0x42a00088462060003