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

⟦5612e5d19⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Statements, seg_037e12

Derivation

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

with Object;
with Errors;
with Scanner;
with Statements;  
with Trace;
with Unparser;

package body More_Statements is

    type Node_Structure is
        record
            Line : Natural;
            Rule : Natural range 0 .. 1 := 0;
            Stat : Statements.Node := Statements.Empty_Node;
        end record;

    procedure Parse (N : in out Node) is
    begin
        Trace.Display ("parsing More_Statements");
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        case Scanner.Get_Token is
            when Scanner.L_Dot =>
                N.Rule := 1;
                Scanner.Next_Token;
                Statements.Parse (N.Stat);
            when Scanner.L_Eof | Scanner.L_Cbra =>
                null;
            when others =>
                raise Errors.Expecting_Dot;
        end case;
    end Parse;

    procedure Unparse (N : Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Unparser.Put (".");
                Unparser.New_Line;
                Statements.Unparse (N.Stat);
        end case;
        Trace.Display ("fin unparse more_statements");
    end Unparse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Scanner.L_Dot;
    end Is_First;

    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 := Statements.Interpret (N.Stat, Inherited);
        end case;
        Trace.Display ("fin interpretation More_Statements");
        Trace.Display (Result);
        return Result;
    end Interpret;

end More_Statements;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=26 rec1=00 rec2=01 rec3=02a
        [0x01] rec0=1f rec1=00 rec2=02 rec3=004
        [0x02] rec0=05 rec1=00 rec2=03 rec3=000
        [0x03] rec0=02 rec1=a4 rec2=61 rec3=242
    tail 0x2153132c884e58e854c4f 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 04 80 01 3e 01 20 20 77 68 65 6e 20 30  ┆      >   when 0┆