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 - metrics - download

⟦7fb522ad1⟧ Ada Source

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

Derivation

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

with Message;
with Value, Block;
with Class_Printer;
with Bounded_String;
with Bug_Report;

package body Expression is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Val : Value.Node := Value.Empty_Node;
            Ident : Message.Unary;
            Line : Object.Index := Scanner.Get_Line_Number;
        end record;

    procedure Parse (N : in out Node) is
        use Scanner;
    begin  
        N := new Node_Structure;
        if Value.Is_First (Scanner.Get_Token) then
            N.Rule := 0;
            Value.Parse (N.Val);
        else
            if Scanner.Get_Token = Scanner.Pour then
                N.Rule := 1;
                Scanner.Next;
                if Scanner.Get_Token = Scanner.Identifier then
                    Message.Put (This_Name => Scanner.Get_Value,
                                 Into => N.Ident);
                    Scanner.Next;  
                else
                    raise Bug_Report.Identifier_Is_Missing;
                end if;
                if Scanner.Get_Token = Scanner.Prendre then
                    Scanner.Next;
                    Value.Parse (N.Val);
                else
                    raise Bug_Report.Prendre_Is_Missing;
                end if;
            else
                raise Bug_Report.Unexpected_Token;
            end if;
        end if;
    end Parse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Pour or else Value.Is_First (T);
    end Is_First;

    procedure Unparse (N : Node) is
    begin
        case N.Rule is
            when 0 =>
                Value.Unparse (N.Val);
            when 1 =>
                Class_Printer.New_Line;
                Class_Printer.Put_Tab
                   ("pour " & Bounded_String.Image (Message.Get (N.Ident)) &
                    " prendre ");
                Value.Unparse (N.Val);
        end case;
    end Unparse;

    function Interpret (N : Node) return Object.Reference is
        Result : Object.Reference;
        Node : Block.Node := Block.Get_Current_Node;
    begin
        Scanner.Put_Line_Number (N.Line);
        case N.Rule is
            when 0 =>
                Result := Value.Interpret (N.Val);
            when 1 =>
                Result := Value.Interpret (N.Val);
                Block.Put_Into_Table (This_Object => Result,
                                      Named => Message.Get (N.Ident),
                                      Into_Block => Node);
        end case;
        return Result;
    end Interpret;
end Expression;

    nblk1=4
    nid=2
    hdr6=6
        [0x00] rec0=21 rec1=00 rec2=01 rec3=028
        [0x01] rec0=1f rec1=00 rec2=04 rec3=01a
        [0x02] rec0=15 rec1=00 rec2=03 rec3=000
        [0x03] rec0=12 rec1=00 rec2=02 rec3=000
    tail 0x217336bd884df52f5c91e 0x42a00088462060003
Free Block Chain:
  0x2: 0000  00 00 02 a1 00 3c 20 20 20 20 66 75 6e 63 74 69  ┆     <    functi┆