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

⟦bcf4c206c⟧ Ada Source

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

Derivation

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

with Lex, Error, Debug, Symbol;
with Expression, Value;
package body Factor is

    procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is  
        N1 : Binary_Tree.Node;
        Ok : Boolean := True;
    begin  
        Success := True;
        N1 := new Binary_Tree.Node_Structure;
        case Lex.Get is
            when Lex.Open_Bracket =>
                N1.The_Type := Binary_Tree.Expression_Type;
                Debug.Put (510);
                Lex.Next;
                Expression.Parse (N1.Right_Son, Ok);
                Success := Success and Ok;
                if Lex.Current_Token_Is (Lex.Close_Bracket) then
                    Debug.Put (511);
                    Lex.Next;
                else
                    Error.Append (3);
                    Success := False;
                end if;
            when Lex.Identifier | Lex.Int | Lex.Temps =>
                Value.Parse (N1.Right_Son, Ok);  
                Success := Success and Ok;
            when others =>
                Error.Append (55);
                Success := False;
        end case;
        N := N1;
    end Parse;


    procedure Generate (N : in out Binary_Tree.Node;
                        The_Value : in out Natural) is
        Value1 : Natural;
    begin
        Debug.Put (5);
        case N.The_Type is
            when Binary_Tree.Null_Type =>
                Generate (N.Right_Son, Value1);
            when Binary_Tree.Expression_Type =>
                Expression.Generate (N.Right_Son, Value1);
                The_Value := Value1;
            when Binary_Tree.Valeur_Type =>
                Value.Generate (N, Value1);
                The_Value := Value1;
            when others =>
                Value1 := 0;
        end case;
        The_Value := Value1;
    end Generate;

end Factor;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=1c rec1=00 rec2=01 rec3=02a
        [0x01] rec0=1f rec1=00 rec2=02 rec3=001
    tail 0x2173664e284e83914dae6 0x42a00088462060003