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

⟦b83402fcd⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Statements, seg_035501, seg_0363ab, seg_036913

Derivation

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

with Statements, Scanner, Object, Printer, Bug;
package body More_Statements is

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

    function Is_Follow (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return (T = T_Block_End or T = T_Eof);
    end Is_Follow;


    procedure Parse (N : in out Node) is
    begin
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        case Scanner.Get_Token is
            when Scanner.T_Dot =>
                N.Rule := 1;
                Scanner.Next;
                Statements.Parse (N.Stat);
            when others =>
                if not Is_Follow (Scanner.Get_Token) then
                    raise Bug.Missing_Point;
                end if;
        end case;
    end Parse;

    procedure Unparse (N : in Node) is
    begin
        Scanner.Set_Line_Number (N.Line);
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Printer.Write_Ln (".");
                Statements.Unparse (N.Stat);
        end case;
    end Unparse;

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


    function Interpret (N : Node; Inherited : Object.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 := Statements.Interpret (N.Stat, Inherited);
        end case;
        return Result;
    end Interpret;
end More_Statements;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=23 rec1=00 rec2=01 rec3=02c
        [0x01] rec0=21 rec1=00 rec2=02 rec3=001
    tail 0x217321f5084d9692c7893 0x42a00088462060003