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

⟦c0d0aeb86⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Call_Sub_Routine, seg_038b3f

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, Description_List, Symbol, Debug;
with Liste_Value;
with Body_Description;
package body Call_Sub_Routine is

    procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
        N1 : Binary_Tree.Node;
        Ok : Boolean := True;
    begin  
        Success := True;
        if Lex.Current_Token_Is (Lex.Executer) then
            N1 := new Binary_Tree.Node_Structure;
            N1.The_Type := Binary_Tree.Executer_Type;
            Debug.Put (400);
            Lex.Next;
            if Lex.Current_Token_Is (Lex.Identifier) then
                Debug.Put (401);  
                N1.S := new String'(Lex.Image);
                Lex.Next;
                if Lex.Current_Token_Is (Lex.Avec) then
                    Debug.Put (402);
                    Lex.Next;
                    if Lex.Current_Token_Is (Lex.Open_Bracket) then
                        Debug.Put (403);
                        Lex.Next;
                        Liste_Value.Parse (N1.Right_Son, Ok);
                        Success := Success and Ok;
                        if Lex.Current_Token_Is (Lex.Close_Bracket) then
                            Debug.Put (404);
                            Lex.Next;
                        else
                            Debug.Put (4000);
                            Error.Append (5);  
                            Success := False;
                        end if;
                    else
                        Error.Append (6);  
                        Success := False;
                    end if;
                end if;
            else
                Error.Append (7);
                Success := False;
            end if;
            N := N1;
        end if;
    end Parse;


    procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
    begin  
        Symbol.Set_Current_Level (To => 2, Function_Name => N.S.all);
        if not Binary_Tree."=" (N.Right_Son, null) then
            Liste_Value.Generate (N.Right_Son, 1);
        end if;
        Body_Description.Generate
           (Symbol.Get_Start_Point (N.S.all).Right_Son, T);  
        Symbol.Set_Current_Level (To => 1, Function_Name => " ");
    end Generate;

end Call_Sub_Routine;

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=1b rec1=00 rec2=01 rec3=02c
        [0x01] rec0=1b rec1=00 rec2=03 rec3=054
        [0x02] rec0=09 rec1=00 rec2=02 rec3=000
    tail 0x2173663f084e839099719 0x42a00088462060003