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

⟦0f591ee27⟧ Ada Source

    Length: 6144 (0x1800)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Block, seg_0354ff, seg_0363a9, seg_0368f3

Derivation

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

with Arguments, Statements, Scanner, Object, Message, Table, Bug;
package body Block is

    type Node_Structure is
        record
            Arg : Arguments.Node := Arguments.Empty_Node;
            Stat : Statements.Node := Statements.Empty_Node;
            Id_List : Message.List;
            Keyword_List : Message.List;
            Symbol : Table.Symbol_Kind;
            Parent_Block : Node := Empty_Node;
            Line : Natural;
        end record;

    Current_Node : Node;


    function Current return Node is
    begin  
        return Current_Node;
    end Current;

    function Symbol (N : Node) return Table.Symbol_Kind is
    begin
        return N.Symbol;
    end Symbol;

    function Parent (N : Node) return Node is
    begin  
        return N.Parent_Block;
    end Parent;

    function Keyword_List (N : Node) return Message.List is
    begin
        return N.Keyword_List;
    end Keyword_List;

    function Identifier_List (N : Node) return Message.List is
    begin
        return N.Id_List;
    end Identifier_List;

    procedure Parse (N : in out Node) is
        use Scanner;
    begin  
        N := new Node_Structure;
        N.Line := Scanner.Get_Line_Number;
        N.Parent_Block := Current_Node;
        Current_Node := N;
        Message.Init (N.Keyword_List);
        Message.Init (N.Id_List);
        Table.Initialize (N.Symbol);
        Scanner.Next;
        Arguments.Parse (N.Arg, N.Keyword_List, N.Id_List, N.Symbol);
        Statements.Parse (N.Stat);
        if Scanner.Get_Token /= Scanner.T_Block_End then
            raise Bug.Missing_Right_Brace;
        end if;
        if N.Parent_Block /= Empty_Node then
            Current_Node := N.Parent_Block;
        end if;
    end Parse;

    procedure Unparse (N : in Node) is
    begin
        Scanner.Set_Line_Number (N.Line);
        Arguments.Unparse (N.Arg, N.Keyword_List, N.Id_List);
        Statements.Unparse (N.Stat);
    end Unparse;

    function Interpret (N : Node) return Object.Reference is
        Result : Object.Reference;
        Execution_Parent_Block_Node : Block.Node;
    begin  
        Scanner.Set_Line_Number (N.Line);
        Execution_Parent_Block_Node := Current_Node;
        Current_Node := N;  
        Result := Statements.Interpret (N.Stat, Result);
        Current_Node := Execution_Parent_Block_Node;
        return (Result);
    end Interpret;

begin
    Current_Node := new Node_Structure;
    Message.Init (Current_Node.Keyword_List);
    Message.Init (Current_Node.Id_List);
    Table.Initialize (Current_Node.Symbol);
end Block;

    nblk1=5
    nid=2
    hdr6=6
        [0x00] rec0=27 rec1=00 rec2=01 rec3=01c
        [0x01] rec0=1e rec1=00 rec2=05 rec3=004
        [0x02] rec0=15 rec1=00 rec2=04 rec3=000
        [0x03] rec0=19 rec1=00 rec2=04 rec3=000
        [0x04] rec0=c0 rec1=00 rec2=00 rec3=100
    tail 0x217321f0884d9690ecbe3 0x42a00088462060003
Free Block Chain:
  0x2: 0000  00 03 00 0b 80 08 63 74 69 6f 6e 20 4b 65 08 09  ┆      ction Ke  ┆
  0x3: 0000  00 00 01 f0 80 12 22 4c 65 20 62 6c 6f 63 20 64  ┆      "Le bloc d┆