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

⟦948abf074⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Expression, seg_032d0c

Derivation

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

with Scanner;
with Object;
with Symbols;
with Value, Block;

package body Expression is

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

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;
        use Scanner;
    begin  
        N := new Node_Structure;
        if Value.Is_First (Scanner.Get_Token) then
            N.Rule := 0;
            Value.Parse (N.Val, Failed);
        else
            case Scanner.Get_Token is
                when Scanner.Pour =>
                    N.Rule := 1;
                    Scanner.Next;
                    Object.Put (This => Scanner.Get_Value, Into => N.Ident);
                    Scanner.Next;
                    if Scanner.Get_Token = Scanner.Prendre then
                        Scanner.Next;
                        Value.Parse (N.Val, Failed);
                    end if;
                when others =>
                    null;
            end case;
        end if;
        Error := Failed;
    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;

    function Interpret (N : Node) return Object.Reference is
        Result : Object.Reference;
    begin
        case N.Rule is
            when 0 =>
                Result := Value.Interpret (N.Val);
            when 1 =>
                Result := Value.Interpret (N.Val);
                Symbols.Put (This_Object => Result,
                             Named => Object.Get (N.Ident),
                             Into => Block.Get_Current_Table);
        end case;
        return Result;
    end Interpret;
end Expression;

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