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

⟦206677943⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Statements, seg_035188, seg_0363ad, seg_036912

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, Printer;
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;
            Line : Natural;
        end record;

    procedure Parse (N : in out Node) is
    begin  
        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.T_Renvoyer =>
                    N.Rule := 2;
                    Scanner.Next;
                    Expression.Parse (N.Expr);
                when others =>  
                    null;  
            end case;
        end if;
    end Parse;

    procedure Unparse (N : in Node) is
    begin
        Scanner.Set_Line_Number (N.Line);
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Expression.Unparse (N.Expr);
                More_Statements.Unparse (N.More);
            when 2 =>
                Printer.Write ("renvoyer");
                Expression.Unparse (N.Expr);
        end case;
    end Unparse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = 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  
        Scanner.Set_Line_Number (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;
        return Result;
    end Interpret;
end Statements;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=1e rec1=00 rec2=01 rec3=018
        [0x01] rec0=21 rec1=00 rec2=03 rec3=004
        [0x02] rec0=09 rec1=00 rec2=02 rec3=000
        [0x03] rec0=07 rec1=00 rec2=04 rec3=000
    tail 0x21731b98084d87531eb26 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 b4 80 07 65 73 75 6c 74 29 3b 07 00 15  ┆      esult);   ┆